Documentation

Mathlib.Order.Types.Arithmetic

Main definitions #

Notation #

The following are notations in the OrderType namespace:

References #

Tags #

order type, order isomorphism, linear order

@[implicit_reducible, instance 100]
@[implicit_reducible]
@[simp]
theorem OrderType.type_lex_sum (α : Type u) (β : Type v) [LinearOrder α] [LinearOrder β] :
type (Lex (α β)) = type α + type β
@[implicit_reducible, instance 100]
@[implicit_reducible]
@[simp]
theorem OrderType.type_lex_prod (α : Type u) (β : Type v) [LinearOrder α] [LinearOrder β] :
type (Lex (α × β)) = type β * type α
@[implicit_reducible]
instance OrderType.instOfNat (n : ) :

The order type of the rational numbers.

Conventions for notations in identifiers:

  • The recommended spelling of η in identifiers is eta.
Instances For
    noncomputable def OrderType.theta :

    The order type of the real numbers.

    Conventions for notations in identifiers:

    • The recommended spelling of θ in identifiers is theta.
    Instances For
      def OrderType.termη :
      Lean.ParserDescr

      The order type of the rational numbers.

      Conventions for notations in identifiers:

      • The recommended spelling of η in identifiers is eta.
      Instances For
        def OrderType.termθ :
        Lean.ParserDescr

        The order type of the real numbers.

        Conventions for notations in identifiers:

        • The recommended spelling of θ in identifiers is theta.
        Instances For