Documentation

Mathlib.Order.WithBotTop

Adding both and to a type #

This files defines an abbreviation WithBotTop ι for WithBot (WithTop ι). We also introduce an abbreviation EInt for WithBotTop.

@[reducible, inline]
abbrev WithBotTop (ι : Type u_1) :
Type u_1

The type obtained by adding both and to a type.

Equations
    Instances For
      @[reducible, inline]
      abbrev WithTopBot (ι : Type u_1) :
      Type u_1

      The type obtained by adding both and to a type.

      Equations
        Instances For
          def WithBotTop.coe {ι : Type u_1} :
          ιWithBotTop ι

          The canonical inclusion ι → WithBotTop ι. Registered as a coercion.

          Equations
            Instances For
              instance WithBotTop.instCoe {ι : Type u_1} :
              Coe ι (WithBotTop ι)
              Equations
                @[simp]
                theorem WithBotTop.coe_ne_bot {ι : Type u_1} (a : ι) :
                @[simp]
                theorem WithBotTop.coe_ne_top {ι : Type u_1} (a : ι) :
                @[simp]
                theorem WithBotTop.top_ne_bot {ι : Type u_1} :
                def WithBotTop.rec {ι : Type u_1} {motive : WithBotTop ιSort u_2} (bot : motive ) (coe : (a : ι) → motive (coe a)) (top : motive ) (a : WithBotTop ι) :
                motive a

                A recursor for WithBotTop in terms of the coercion.

                Equations
                  Instances For
                    @[simp]
                    theorem WithBotTop.rec_bot {ι : Type u_1} {motive : WithBotTop ιSort u_2} (bot : motive ) (coe : (a : ι) → motive (coe a)) (top : motive ) :
                    WithBotTop.rec bot coe top = bot
                    @[simp]
                    theorem WithBotTop.rec_coe {ι : Type u_1} {motive : WithBotTop ιSort u_2} (bot : motive ) (coe : (a : ι) → motive (coe a)) (top : motive ) (a : ι) :
                    WithBotTop.rec bot coe top (WithBotTop.coe a) = coe a
                    @[simp]
                    theorem WithBotTop.rec_top {ι : Type u_1} {motive : WithBotTop ιSort u_2} (bot : motive ) (coe : (a : ι) → motive (coe a)) (top : motive ) :
                    WithBotTop.rec bot coe top = top
                    @[simp]
                    theorem WithBotTop.coe_le_coe {ι : Type u_1} [LE ι] {a b : ι} :
                    coe a coe b a b
                    @[simp]
                    theorem WithBotTop.coe_lt_coe {ι : Type u_1} [LT ι] {a b : ι} :
                    coe a < coe b a < b
                    @[reducible, inline]
                    abbrev EInt :

                    The type of extended integers [-∞, ∞], constructed as WithBot (WithTop ℤ).

                    Equations
                      Instances For