def inline {α : Sort u} (a : α) : α

inline (f x) is an indication to the compiler to inline the definition of f at the application site itself (by comparison to the @[inline] attribute, which applies to all applications of the function).

Equations

• inline a = a

theorem id_def {α : Sort u} (a : α) : id a = a

@[inline]

def flip {α : Sort u} {β : Sort v} {φ : Sort w} (f : α → β → φ) : β → α → φ

flip f a b is f b a. It is useful for "point-free" programming, since it can sometimes be used to avoid introducing variables. For example, (·<·) is the less-than relation, and flip (·<·) is the greater-than relation.

Equations

• flip f b a = f a b

@[simp]

theorem Function.const_apply {β : Sort u_1} {α : Sort u_2} {y : β} {x : α} : Function.const α y x = y

@[simp]

theorem Function.comp_apply {β : Sort u_1} {δ : Sort u_2} {α : Sort u_3} {f : β → δ} {g : α → β} {x : α} : (f ∘ g) x = f (g x)

theorem Function.comp_def {α : Sort u_1} {β : Sort u_2} {δ : Sort u_3} (f : β → δ) (g : α → β) : f ∘ g = fun (x : α) => f (g x)

@[macro_inline]

def Empty.elim {C : Sort u} : Empty → C

Empty.elim : Empty → C says that a value of any type can be constructed from Empty. This can be thought of as a compiler-checked assertion that a code path is unreachable.

This is a non-dependent variant of Empty.rec.

Equations

• t.elim = Empty.rec (fun (x : Empty) => C) t

instance instDecidableEqEmpty : DecidableEq Empty

Decidable equality for Empty

Equations

• instDecidableEqEmpty a = a.elim

@[macro_inline]

def PEmpty.elim {C : Sort u_1} : PEmpty → C

PEmpty.elim : Empty → C says that a value of any type can be constructed from PEmpty. This can be thought of as a compiler-checked assertion that a code path is unreachable.

This is a non-dependent variant of PEmpty.rec.

Equations

• a.elim = nomatch a

instance instDecidableEqPEmpty : DecidableEq PEmpty

Decidable equality for PEmpty

Equations

• instDecidableEqPEmpty a = a.elim

structure Thunk (α : Type u) : Type u

Thunks are "lazy" values that are evaluated when first accessed using Thunk.get/map/bind. The value is then stored and not recomputed for all further accesses.

• fn : Unit → α

@[extern lean_thunk_pure]

def Thunk.pure {α : Type u_1} (a : α) : Thunk α

Store a value in a thunk. Note that the value has already been computed, so there is no laziness.

Equations

• Thunk.pure a = { fn := fun (x : Unit) => a }

@[extern lean_thunk_get_own]

def Thunk.get {α : Type u_1} (x : Thunk α) : α

Forces a thunk to extract the value. This will cache the result, so a second call to the same function will return the value in O(1) instead of calling the stored getter function.

Equations

• x.get = x.fn ()

@[inline]

def Thunk.map {α : Type u_1} {β : Type u_2} (f : α → β) (x : Thunk α) : Thunk β

Map a function over a thunk.

Equations

• Thunk.map f x = { fn := fun (x_1 : Unit) => f x.get }

@[inline]

def Thunk.bind {α : Type u_1} {β : Type u_2} (x : Thunk α) (f : α → Thunk β) : Thunk β

Constructs a thunk that applies f to the result of x when forced.

Equations

• x.bind f = { fn := fun (x_1 : Unit) => (f x.get).get }

@[simp]

theorem Thunk.sizeOf_eq {α : Type u_1} [SizeOf α] (a : Thunk α) : sizeOf a = 1 + sizeOf a.get

instance thunkCoe {α : Type u_1} : CoeTail α (Thunk α)

Equations

• thunkCoe = { coe := fun (a : α) => { fn := fun (x : Unit) => a } }

definitions

structure Iff (a : Prop) (b : Prop) : Prop

If and only if, or logical bi-implication. a ↔ b means that a implies b and vice versa. By propext, this implies that a and b are equal and hence any expression involving a is equivalent to the corresponding expression with b instead.

• intro :: (
• mp : a → b

  Modus ponens for if and only if. If a ↔ b and a, then b.

• mpr : b → a

  Modus ponens for if and only if, reversed. If a ↔ b and b, then a.

• )

theorem Iff.mp {a : Prop} {b : Prop} (self : a ↔ b) : a → b

Modus ponens for if and only if. If a ↔ b and a, then b.

theorem Iff.mpr {a : Prop} {b : Prop} (self : a ↔ b) : b → a

Modus ponens for if and only if, reversed. If a ↔ b and b, then a.

def «term_<->_» : Lean.TrailingParserDescr

If and only if, or logical bi-implication. a ↔ b means that a implies b and vice versa. By propext, this implies that a and b are equal and hence any expression involving a is equivalent to the corresponding expression with b instead.

Equations

• «term_<->_» = Lean.ParserDescr.trailingNode `term_<->_ 20 21 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " <-> ") (Lean.ParserDescr.cat `term 21))

def «term_↔_» : Lean.TrailingParserDescr

If and only if, or logical bi-implication. a ↔ b means that a implies b and vice versa. By propext, this implies that a and b are equal and hence any expression involving a is equivalent to the corresponding expression with b instead.

Equations

• «term_↔_» = Lean.ParserDescr.trailingNode `term_↔_ 20 21 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ↔ ") (Lean.ParserDescr.cat `term 21))

inductive Sum (α : Type u) (β : Type v) : Type (max u v)

Sum α β, or α ⊕ β, is the disjoint union of types α and β. An element of α ⊕ β is either of the form .inl a where a : α, or .inr b where b : β.

• inl: {α : Type u} → {β : Type v} → α → α ⊕ β

  Left injection into the sum type α ⊕ β. If a : α then .inl a : α ⊕ β.

• inr: {α : Type u} → {β : Type v} → β → α ⊕ β

  Right injection into the sum type α ⊕ β. If b : β then .inr b : α ⊕ β.

def «term_⊕_» : Lean.TrailingParserDescr

Sum α β, or α ⊕ β, is the disjoint union of types α and β. An element of α ⊕ β is either of the form .inl a where a : α, or .inr b where b : β.

Equations

• «term_⊕_» = Lean.ParserDescr.trailingNode `term_⊕_ 30 31 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊕ ") (Lean.ParserDescr.cat `term 30))

inductive PSum (α : Sort u) (β : Sort v) : Sort (max (max 1 u) v)

PSum α β, or α ⊕' β, is the disjoint union of types α and β. It differs from α ⊕ β in that it allows α and β to have arbitrary sorts Sort u and Sort v, instead of restricting to Type u and Type v. This means that it can be used in situations where one side is a proposition, like True ⊕' Nat.

The reason this is not the default is that this type lives in the universe Sort (max 1 u v), which can cause problems for universe level unification, because the equation max 1 u v = ?u + 1 has no solution in level arithmetic. PSum is usually only used in automation that constructs sums of arbitrary types.

• inl: {α : Sort u} → {β : Sort v} → α → α ⊕' β

  Left injection into the sum type α ⊕' β. If a : α then .inl a : α ⊕' β.

• inr: {α : Sort u} → {β : Sort v} → β → α ⊕' β

  Right injection into the sum type α ⊕' β. If b : β then .inr b : α ⊕' β.

def «term_⊕'_» : Lean.TrailingParserDescr

PSum α β, or α ⊕' β, is the disjoint union of types α and β. It differs from α ⊕ β in that it allows α and β to have arbitrary sorts Sort u and Sort v, instead of restricting to Type u and Type v. This means that it can be used in situations where one side is a proposition, like True ⊕' Nat.

The reason this is not the default is that this type lives in the universe Sort (max 1 u v), which can cause problems for universe level unification, because the equation max 1 u v = ?u + 1 has no solution in level arithmetic. PSum is usually only used in automation that constructs sums of arbitrary types.

Equations

• «term_⊕'_» = Lean.ParserDescr.trailingNode `term_⊕'_ 30 31 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊕' ") (Lean.ParserDescr.cat `term 30))

instance instInhabitedPSum {α : Sort u_1} {β : Sort u_2} [Inhabited α] : Inhabited (α ⊕' β)

Equations

• instInhabitedPSum = { default := PSum.inl default }

instance instInhabitedPSum_1 {α : Sort u_1} {β : Sort u_2} [Inhabited β] : Inhabited (α ⊕' β)

Equations

• instInhabitedPSum_1 = { default := PSum.inr default }

@[unbox]

structure Sigma {α : Type u} (β : α → Type v) : Type (max u v)

Sigma β, also denoted Σ a : α, β a or (a : α) × β a, is the type of dependent pairs whose first component is a : α and whose second component is b : β a (so the type of the second component can depend on the value of the first component). It is sometimes known as the dependent sum type, since it is the type level version of an indexed summation.

• fst : α

  The first component of a dependent pair. If p : @Sigma α β then p.1 : α.

• snd : β self.fst

  The second component of a dependent pair. If p : Sigma β then p.2 : β p.1.

structure PSigma {α : Sort u} (β : α → Sort v) : Sort (max (max 1 u) v)

PSigma β, also denoted Σ' a : α, β a or (a : α) ×' β a, is the type of dependent pairs whose first component is a : α and whose second component is b : β a (so the type of the second component can depend on the value of the first component). It differs from Σ a : α, β a in that it allows α and β to have arbitrary sorts Sort u and Sort v, instead of restricting to Type u and Type v. This means that it can be used in situations where one side is a proposition, like (p : Nat) ×' p = p.

The reason this is not the default is that this type lives in the universe Sort (max 1 u v), which can cause problems for universe level unification, because the equation max 1 u v = ?u + 1 has no solution in level arithmetic. PSigma is usually only used in automation that constructs pairs of arbitrary types.

• fst : α

  The first component of a dependent pair. If p : @Sigma α β then p.1 : α.

• snd : β self.fst

  The second component of a dependent pair. If p : Sigma β then p.2 : β p.1.

inductive Exists {α : Sort u} (p : α → Prop) : Prop

Existential quantification. If p : α → Prop is a predicate, then ∃ x : α, p x asserts that there is some x of type α such that p x holds. To create an existential proof, use the exists tactic, or the anonymous constructor notation ⟨x, h⟩. To unpack an existential, use cases h where h is a proof of ∃ x : α, p x, or let ⟨x, hx⟩ := h where `.

Because Lean has proof irrelevance, any two proofs of an existential are definitionally equal. One consequence of this is that it is impossible to recover the witness of an existential from the mere fact of its existence. For example, the following does not compile:

example (h : ∃ x : Nat, x = x) : Nat :=
  let ⟨x, _⟩ := h  -- fail, because the goal is `Nat : Type`
  x

The error message recursor 'Exists.casesOn' can only eliminate into Prop means that this only works when the current goal is another proposition:

example (h : ∃ x : Nat, x = x) : True :=
  let ⟨x, _⟩ := h  -- ok, because the goal is `True : Prop`
  trivial

• intro: ∀ {α : Sort u} {p : α → Prop} (w : α), p w → Exists p

  Existential introduction. If a : α and h : p a, then ⟨a, h⟩ is a proof that ∃ x : α, p x.

inductive ForInStep (α : Type u) : Type u

Auxiliary type used to compile for x in xs notation.

This is the return value of the body of a ForIn call, representing the body of a for loop. It can be:

• .yield (a : α), meaning that we should continue the loop and a is the new state. .yield is produced by continue and reaching the bottom of the loop body.
• .done (a : α), meaning that we should early-exit the loop with state a. .done is produced by calls to break or return in the loop,

• done: {α : Type u} → α → ForInStep α

  .done a means that we should early-exit the loop. .done is produced by calls to break or return in the loop.

• yield: {α : Type u} → α → ForInStep α

  .yield a means that we should continue the loop. .yield is produced by continue and reaching the bottom of the loop body.

instance instInhabitedForInStep : {a : Type u_1} → [inst : Inhabited a] → Inhabited (ForInStep a)

Equations

• instInhabitedForInStep = { default := ForInStep.done default }

class ForIn (m : Type u₁ → Type u₂) (ρ : Type u) (α : outParam (Type v)) : Type (max (max (max u (u₁ + 1)) u₂) v)

ForIn m ρ α is the typeclass which supports for x in xs notation. Here xs : ρ is the type of the collection to iterate over, x : α is the element type which is made available inside the loop, and m is the monad for the encompassing do block.

• forIn : {β : Type u₁} → [inst : Monad m] → ρ → β → (α → β → m (ForInStep β)) → m β

  forIn x b f : m β runs a for-loop in the monad m with additional state β. This traverses over the "contents" of x, and passes the elements a : α to f : α → β → m (ForInStep β). b : β is the initial state, and the return value of f is the new state as well as a directive .done or .yield which indicates whether to abort early or continue iteration.

  The expression

  let mut b := ...
  for x in xs do
    b ← foo x b
  

  in a do block is syntactic sugar for:

  let b := ...
  let b ← forIn xs b (fun x b => do
    let b ← foo x b
    return .yield b)
  

  (Here b corresponds to the variables mutated in the loop.)

class ForIn' (m : Type u₁ → Type u₂) (ρ : Type u) (α : outParam (Type v)) (d : outParam (Membership α ρ)) : Type (max (max (max u (u₁ + 1)) u₂) v)

ForIn' m ρ α d is a variation on the ForIn m ρ α typeclass which supports the for h : x in xs notation. It is the same as for x in xs except that h : x ∈ xs is provided as an additional argument to the body of the for-loop.

• forIn' : {β : Type u₁} → [inst : Monad m] → (x : ρ) → β → ((a : α) → a ∈ x → β → m (ForInStep β)) → m β

  forIn' x b f : m β runs a for-loop in the monad m with additional state β. This traverses over the "contents" of x, and passes the elements a : α along with a proof that a ∈ x to f : (a : α) → a ∈ x → β → m (ForInStep β). b : β is the initial state, and the return value of f is the new state as well as a directive .done or .yield which indicates whether to abort early or continue iteration.

inductive DoResultPRBC (α : Type u) (β : Type u) (σ : Type u) : Type u

Auxiliary type used to compile do notation. It is used when compiling a do block nested inside a combinator like tryCatch. It encodes the possible ways the block can exit:

• pure (a : α) s means that the block exited normally with return value a.
• return (b : β) s means that the block exited via a return b early-exit command.
• break s means that break was called, meaning that we should exit from the containing loop.
• continue s means that continue was called, meaning that we should continue to the next iteration of the containing loop.

All cases return a value s : σ which bundles all the mutable variables of the do-block.

• pure: {α β σ : Type u} → α → σ → DoResultPRBC α β σ

  pure (a : α) s means that the block exited normally with return value a

• return: {α β σ : Type u} → β → σ → DoResultPRBC α β σ

  return (b : β) s means that the block exited via a return b early-exit command

• break: {α β σ : Type u} → σ → DoResultPRBC α β σ

  break s means that break was called, meaning that we should exit from the containing loop

• continue: {α β σ : Type u} → σ → DoResultPRBC α β σ

  continue s means that continue was called, meaning that we should continue to the next iteration of the containing loop

inductive DoResultPR (α : Type u) (β : Type u) (σ : Type u) : Type u

Auxiliary type used to compile do notation. It is the same as DoResultPRBC α β σ except that break and continue are not available because we are not in a loop context.

• pure: {α β σ : Type u} → α → σ → DoResultPR α β σ

  pure (a : α) s means that the block exited normally with return value a

• return: {α β σ : Type u} → β → σ → DoResultPR α β σ

  return (b : β) s means that the block exited via a return b early-exit command

inductive DoResultBC (σ : Type u) : Type u

Auxiliary type used to compile do notation. It is an optimization of DoResultPRBC PEmpty PEmpty σ to remove the impossible cases, used when neither pure nor return are possible exit paths.

• break: {σ : Type u} → σ → DoResultBC σ

  break s means that break was called, meaning that we should exit from the containing loop

• continue: {σ : Type u} → σ → DoResultBC σ

  continue s means that continue was called, meaning that we should continue to the next iteration of the containing loop

inductive DoResultSBC (α : Type u) (σ : Type u) : Type u

Auxiliary type used to compile do notation. It is an optimization of either DoResultPRBC α PEmpty σ or DoResultPRBC PEmpty α σ to remove the impossible case, used when either pure or return is never used.

• pureReturn: {α σ : Type u} → α → σ → DoResultSBC α σ

  This encodes either pure (a : α) or return (a : α):

  • pure (a : α) s means that the block exited normally with return value a
  • return (b : β) s means that the block exited via a return b early-exit command

  The one that is actually encoded depends on the context of use.

• break: {α σ : Type u} → σ → DoResultSBC α σ

  break s means that break was called, meaning that we should exit from the containing loop

• continue: {α σ : Type u} → σ → DoResultSBC α σ

  continue s means that continue was called, meaning that we should continue to the next iteration of the containing loop

class HasEquiv (α : Sort u) : Sort (max u (v + 1))

HasEquiv α is the typeclass which supports the notation x ≈ y where x y : α.

• Equiv : α → α → Sort v

  x ≈ y says that x and y are equivalent. Because this is a typeclass, the notion of equivalence is type-dependent.

def «term_≈_» : Lean.TrailingParserDescr

x ≈ y says that x and y are equivalent. Because this is a typeclass, the notion of equivalence is type-dependent.

Equations

• «term_≈_» = Lean.ParserDescr.trailingNode `term_≈_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ≈ ") (Lean.ParserDescr.cat `term 51))

set notation

class HasSubset (α : Type u) : Type u

Notation type class for the subset relation ⊆.

• Subset : α → α → Prop

  Subset relation: a ⊆ b

class HasSSubset (α : Type u) : Type u

Notation type class for the strict subset relation ⊂.

• SSubset : α → α → Prop

  Strict subset relation: a ⊂ b

@[reducible, inline]

abbrev Superset {α : Type u_1} [HasSubset α] (a : α) (b : α) : Prop

Superset relation: a ⊇ b

Equations

• (a ⊇ b) = (b ⊆ a)

@[reducible, inline]

abbrev SSuperset {α : Type u_1} [HasSSubset α] (a : α) (b : α) : Prop

Strict superset relation: a ⊃ b

Equations

• (a ⊃ b) = (b ⊂ a)

class Union (α : Type u) : Type u

Notation type class for the union operation ∪.

• union : α → α → α

  a ∪ b is the union ofa and b.

class Inter (α : Type u) : Type u

Notation type class for the intersection operation ∩.

• inter : α → α → α

  a ∩ b is the intersection ofa and b.

class SDiff (α : Type u) : Type u

Notation type class for the set difference \.

• sdiff : α → α → α

  a \ b is the set difference of a and b, consisting of all elements in a that are not in b.

def «term_⊆_» : Lean.TrailingParserDescr

Subset relation: a ⊆ b

Equations

• «term_⊆_» = Lean.ParserDescr.trailingNode `term_⊆_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊆ ") (Lean.ParserDescr.cat `term 51))

def «term_⊂_» : Lean.TrailingParserDescr

Strict subset relation: a ⊂ b

Equations

• «term_⊂_» = Lean.ParserDescr.trailingNode `term_⊂_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊂ ") (Lean.ParserDescr.cat `term 51))

def «term_⊇_» : Lean.TrailingParserDescr

Superset relation: a ⊇ b

Equations

• «term_⊇_» = Lean.ParserDescr.trailingNode `term_⊇_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊇ ") (Lean.ParserDescr.cat `term 51))

def «term_⊃_» : Lean.TrailingParserDescr

Strict superset relation: a ⊃ b

Equations

• «term_⊃_» = Lean.ParserDescr.trailingNode `term_⊃_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊃ ") (Lean.ParserDescr.cat `term 51))

def «term_∪_» : Lean.TrailingParserDescr

a ∪ b is the union ofa and b.

Equations

• «term_∪_» = Lean.ParserDescr.trailingNode `term_∪_ 65 65 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∪ ") (Lean.ParserDescr.cat `term 66))

def «term_∩_» : Lean.TrailingParserDescr

a ∩ b is the intersection ofa and b.

Equations

• «term_∩_» = Lean.ParserDescr.trailingNode `term_∩_ 70 70 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∩ ") (Lean.ParserDescr.cat `term 71))

def «term_\_» : Lean.TrailingParserDescr

a \ b is the set difference of a and b, consisting of all elements in a that are not in b.

Equations

• «term_\_» = Lean.ParserDescr.trailingNode `term_\_ 70 71 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " \\ ") (Lean.ParserDescr.cat `term 71))

collections

class EmptyCollection (α : Type u) : Type u

EmptyCollection α is the typeclass which supports the notation ∅, also written as {}.

• emptyCollection : α

  ∅ or {} is the empty set or empty collection. It is supported by the EmptyCollection typeclass.

def «term{}» : Lean.ParserDescr

∅ or {} is the empty set or empty collection. It is supported by the EmptyCollection typeclass.

Equations

• «term{}» = Lean.ParserDescr.node `term{} 1024 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "{") (Lean.ParserDescr.symbol "}"))

def «term∅» : Lean.ParserDescr

∅ or {} is the empty set or empty collection. It is supported by the EmptyCollection typeclass.

Equations

• «term∅» = Lean.ParserDescr.node `term∅ 1024 (Lean.ParserDescr.symbol "∅")

class Insert (α : outParam (Type u)) (γ : Type v) : Type (max u v)

Type class for the insert operation. Used to implement the { a, b, c } syntax.

• insert : α → γ → γ

  insert x xs inserts the element x into the collection xs.

class Singleton (α : outParam (Type u)) (β : Type v) : Type (max u v)

Type class for the singleton operation. Used to implement the { a, b, c } syntax.

• singleton : α → β

  singleton x is a collection with the single element x (notation: {x}).

class LawfulSingleton (α : Type u) (β : Type v) [EmptyCollection β] [Insert α β] [Singleton α β] : Prop

insert x ∅ = {x}

• insert_emptyc_eq : ∀ (x : α), insert x ∅ = {x}

  insert x ∅ = {x}

@[simp]

theorem LawfulSingleton.insert_emptyc_eq {α : Type u} {β : Type v} [EmptyCollection β] [Insert α β] [Singleton α β] [self : LawfulSingleton α β] (x : α) : insert x ∅ = {x}

insert x ∅ = {x}

class Sep (α : outParam (Type u)) (γ : Type v) : Type (max u v)

Type class used to implement the notation { a ∈ c | p a }

• sep : (α → Prop) → γ → γ

  Computes { a ∈ c | p a }.

structure Task (α : Type u) : Type u

Task α is a primitive for asynchronous computation. It represents a computation that will resolve to a value of type α, possibly being computed on another thread. This is similar to Future in Scala, Promise in Javascript, and JoinHandle in Rust.

The tasks have an overridden representation in the runtime.

• pure :: (
• get : α

  If task : Task α then task.get : α blocks the current thread until the value is available, and then returns the result of the task.

• )

instance instInhabitedTask : {a : Type u_1} → [inst : Inhabited a] → Inhabited (Task a)

Equations

• instInhabitedTask = { default := { get := default } }

instance instNonemptyTask : ∀ {α : Type u_1} [inst : Nonempty α], Nonempty (Task α)

Equations

• ⋯ = ⋯

@[reducible, inline]

abbrev Task.Priority : Type

Task priority. Tasks with higher priority will always be scheduled before ones with lower priority.

Equations

• Task.Priority = Nat

def Task.Priority.default : Task.Priority

The default priority for spawned tasks, also the lowest priority: 0.

Equations

• Task.Priority.default = 0

def Task.Priority.max : Task.Priority

The highest regular priority for spawned tasks: 8.

Spawning a task with a priority higher than Task.Priority.max is not an error but will spawn a dedicated worker for the task, see Task.Priority.dedicated. Regular priority tasks are placed in a thread pool and worked on according to the priority order.

Equations

• Task.Priority.max = 8

def Task.Priority.dedicated : Task.Priority

Any priority higher than Task.Priority.max will result in the task being scheduled immediately on a dedicated thread. This is particularly useful for long-running and/or I/O-bound tasks since Lean will by default allocate no more non-dedicated workers than the number of cores to reduce context switches.

Equations

• Task.Priority.dedicated = 9

@[noinline, extern lean_task_spawn]

def Task.spawn {α : Type u} (fn : Unit → α) (prio : optParam Task.Priority Task.Priority.default) : Task α

spawn fn : Task α constructs and immediately launches a new task for evaluating the function fn () : α asynchronously.

prio, if provided, is the priority of the task.

Equations

• Task.spawn fn prio = { get := fn () }

@[noinline, extern lean_task_map]

def Task.map {α : Type u_1} {β : Type u_2} (f : α → β) (x : Task α) (prio : optParam Task.Priority Task.Priority.default) (sync : optParam Bool false) : Task β

map f x maps function f over the task x: that is, it constructs (and immediately launches) a new task which will wait for the value of x to be available and then calls f on the result.

prio, if provided, is the priority of the task. If sync is set to true, f is executed on the current thread if x has already finished.

Equations

• Task.map f x prio sync = { get := f x.get }

@[noinline, extern lean_task_bind]

def Task.bind {α : Type u_1} {β : Type u_2} (x : Task α) (f : α → Task β) (prio : optParam Task.Priority Task.Priority.default) (sync : optParam Bool false) : Task β

bind x f does a monad "bind" operation on the task x with function f: that is, it constructs (and immediately launches) a new task which will wait for the value of x to be available and then calls f on the result, resulting in a new task which is then run for a result.

prio, if provided, is the priority of the task. If sync is set to true, f is executed on the current thread if x has already finished.

Equations

• x.bind f prio sync = { get := (f x.get).get }

structure NonScalar : Type

NonScalar is a type that is not a scalar value in our runtime. It is used as a stand-in for an arbitrary boxed value to avoid excessive monomorphization, and it is only created using unsafeCast. It is somewhat analogous to C void* in usage, but the type itself is not special.

• val : Nat

  You should not use this function

inductive PNonScalar : Type u

PNonScalar is a type that is not a scalar value in our runtime. It is used as a stand-in for an arbitrary boxed value to avoid excessive monomorphization, and it is only created using unsafeCast. It is somewhat analogous to C void* in usage, but the type itself is not special.

This is the universe-polymorphic version of PNonScalar; it is preferred to use NonScalar instead where applicable.

• mk: Nat → PNonScalar

  You should not use this function

@[simp]

theorem Nat.add_zero (n : Nat) : n + 0 = n

theorem optParam_eq (α : Sort u) (default : α) : optParam α default = α

Boolean operators

@[extern lean_strict_or]

def strictOr (b₁ : Bool) (b₂ : Bool) : Bool

strictOr is the same as or, but it does not use short-circuit evaluation semantics: both sides are evaluated, even if the first value is true.

Equations

• strictOr b₁ b₂ = (b₁ || b₂)

@[extern lean_strict_and]

def strictAnd (b₁ : Bool) (b₂ : Bool) : Bool

strictAnd is the same as and, but it does not use short-circuit evaluation semantics: both sides are evaluated, even if the first value is false.

Equations

• strictAnd b₁ b₂ = (b₁ && b₂)

@[inline]

def bne {α : Type u} [BEq α] (a : α) (b : α) : Bool

x != y is boolean not-equal. It is the negation of x == y which is supplied by the BEq typeclass.

Unlike x ≠ y (which is notation for Ne x y), this is Bool valued instead of Prop valued. It is mainly intended for programming applications.

Equations

• (a != b) = !a == b

def «term_!=_» : Lean.TrailingParserDescr

x != y is boolean not-equal. It is the negation of x == y which is supplied by the BEq typeclass.

Unlike x ≠ y (which is notation for Ne x y), this is Bool valued instead of Prop valued. It is mainly intended for programming applications.

Equations

• «term_!=_» = Lean.ParserDescr.trailingNode `term_!=_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " != ") (Lean.ParserDescr.cat `term 51))

class LawfulBEq (α : Type u) [BEq α] : Prop

LawfulBEq α is a typeclass which asserts that the BEq α implementation (which supplies the a == b notation) coincides with logical equality a = b. In other words, a == b implies a = b, and a == a is true.

• eq_of_beq : ∀ {a b : α}, (a == b) = true → a = b

  If a == b evaluates to true, then a and b are equal in the logic.

• rfl : ∀ {a : α}, (a == a) = true

  == is reflexive, that is, (a == a) = true.

theorem LawfulBEq.eq_of_beq {α : Type u} [BEq α] [self : LawfulBEq α] {a : α} {b : α} : (a == b) = true → a = b

If a == b evaluates to true, then a and b are equal in the logic.

theorem LawfulBEq.rfl {α : Type u} [BEq α] [self : LawfulBEq α] {a : α} : (a == a) = true

== is reflexive, that is, (a == a) = true.

instance instLawfulBEqBool : LawfulBEq Bool

Equations

• instLawfulBEqBool = ⋯

instance instLawfulBEq {α : Type u_1} [DecidableEq α] : LawfulBEq α

Equations

• ⋯ = ⋯

instance instLawfulBEqChar : LawfulBEq Char

Equations

• instLawfulBEqChar = ⋯

instance instLawfulBEqString : LawfulBEq String

Equations

• instLawfulBEqString = ⋯

Logical connectives and equality

theorem trivial : True

True is true, and True.intro (or more commonly, trivial) is the proof.

theorem mt {a : Prop} {b : Prop} (h₁ : a → b) (h₂ : ¬b) : ¬a

theorem not_false : ¬False

theorem not_not_intro {p : Prop} (h : p) : ¬¬p

theorem proof_irrel {a : Prop} (h₁ : a) (h₂ : a) : h₁ = h₂

@[macro_inline]

def Eq.mp {α : Sort u} {β : Sort u} (h : α = β) (a : α) : β

If h : α = β is a proof of type equality, then h.mp : α → β is the induced "cast" operation, mapping elements of α to elements of β.

You can prove theorems about the resulting element by induction on h, since rfl.mp is definitionally the identity function.

Equations

• h.mp a = h ▸ a

@[macro_inline]

def Eq.mpr {α : Sort u} {β : Sort u} (h : α = β) (b : β) : α

If h : α = β is a proof of type equality, then h.mpr : β → α is the induced "cast" operation in the reverse direction, mapping elements of β to elements of α.

You can prove theorems about the resulting element by induction on h, since rfl.mpr is definitionally the identity function.

Equations

• h.mpr b = ⋯ ▸ b

theorem Eq.substr {α : Sort u} {p : α → Prop} {a : α} {b : α} (h₁ : b = a) (h₂ : p a) : p b

@[simp]

theorem cast_eq {α : Sort u} (h : α = α) (a : α) : cast h a = a

@[reducible]

def Ne {α : Sort u} (a : α) (b : α) : Prop

a ≠ b, or Ne a b is defined as ¬ (a = b) or a = b → False, and asserts that a and b are not equal.

Equations

• (a ≠ b) = ¬a = b

def «term_≠_» : Lean.TrailingParserDescr

a ≠ b, or Ne a b is defined as ¬ (a = b) or a = b → False, and asserts that a and b are not equal.

Equations

• «term_≠_» = Lean.ParserDescr.trailingNode `term_≠_ 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ≠ ") (Lean.ParserDescr.cat `term 51))

theorem Ne.intro {α : Sort u} {a : α} {b : α} (h : a = b → False) : a ≠ b

theorem Ne.elim {α : Sort u} {a : α} {b : α} (h : a ≠ b) : a = b → False

theorem Ne.irrefl {α : Sort u} {a : α} (h : a ≠ a) : False

theorem Ne.symm {α : Sort u} {a : α} {b : α} (h : a ≠ b) : b ≠ a

theorem ne_comm {α : Sort u_1} {a : α} {b : α} : a ≠ b ↔ b ≠ a

theorem false_of_ne {α : Sort u} {a : α} : a ≠ a → False

theorem ne_false_of_self {p : Prop} : p → p ≠ False

theorem ne_true_of_not {p : Prop} : ¬p → p ≠ True

theorem true_ne_false : ¬True = False

theorem false_ne_true : False ≠ True

theorem Bool.of_not_eq_true {b : Bool} : ¬b = true → b = false

theorem Bool.of_not_eq_false {b : Bool} : ¬b = false → b = true

theorem ne_of_beq_false {α : Type u_1} [BEq α] [LawfulBEq α] {a : α} {b : α} (h : (a == b) = false) : a ≠ b

theorem beq_false_of_ne {α : Type u_1} [BEq α] [LawfulBEq α] {a : α} {b : α} (h : a ≠ b) : (a == b) = false

noncomputable def HEq.ndrec {α : Sort u2} {a : α} {motive : {β : Sort u2} → β → Sort u1} (m : motive a) {β : Sort u2} {b : β} (h : HEq a b) : motive b

Non-dependent recursor for HEq

Equations

• HEq.ndrec m h = HEq.rec m h

noncomputable def HEq.ndrecOn {α : Sort u2} {a : α} {motive : {β : Sort u2} → β → Sort u1} {β : Sort u2} {b : β} (h : HEq a b) (m : motive a) : motive b

HEq.ndrec variant

Equations

• HEq.ndrecOn h m = HEq.rec m h

noncomputable def HEq.elim {α : Sort u} {a : α} {p : α → Sort v} {b : α} (h₁ : HEq a b) (h₂ : p a) : p b

HEq.ndrec variant

Equations

• h₁.elim h₂ = ⋯ ▸ h₂

theorem HEq.subst {α : Sort u} {β : Sort u} {a : α} {b : β} {p : (T : Sort u) → T → Prop} (h₁ : HEq a b) (h₂ : p α a) : p β b

theorem HEq.symm {α : Sort u} {β : Sort u} {a : α} {b : β} (h : HEq a b) : HEq b a

theorem heq_of_eq {α : Sort u} {a : α} {a' : α} (h : a = a') : HEq a a'

theorem HEq.trans {α : Sort u} {β : Sort u} {φ : Sort u} {a : α} {b : β} {c : φ} (h₁ : HEq a b) (h₂ : HEq b c) : HEq a c

theorem heq_of_heq_of_eq {α : Sort u} {β : Sort u} {a : α} {b : β} {b' : β} (h₁ : HEq a b) (h₂ : b = b') : HEq a b'

theorem heq_of_eq_of_heq {α : Sort u} {β : Sort u} {a : α} {a' : α} {b : β} (h₁ : a = a') (h₂ : HEq a' b) : HEq a b

theorem type_eq_of_heq {α : Sort u} {β : Sort u} {a : α} {b : β} (h : HEq a b) : α = β

theorem eqRec_heq {α : Sort u} {φ : α → Sort v} {a : α} {a' : α} (h : a = a') (p : φ a) : HEq (Eq.recOn h p) p

theorem heq_of_eqRec_eq {α : Sort u} {β : Sort u} {a : α} {b : β} (h₁ : α = β) (h₂ : h₁ ▸ a = b) : HEq a b

@[simp]

theorem cast_heq {α : Sort u} {β : Sort u} (h : α = β) (a : α) : HEq (cast h a) a

theorem iff_iff_implies_and_implies (a : Prop) (b : Prop) : (a ↔ b) ↔ (a → b) ∧ (b → a)

theorem Iff.refl (a : Prop) : a ↔ a

theorem Iff.rfl {a : Prop} : a ↔ a

theorem Iff.of_eq {a : Prop} {b : Prop} (h : a = b) : a ↔ b

theorem Iff.trans {a : Prop} {b : Prop} {c : Prop} (h₁ : a ↔ b) (h₂ : b ↔ c) : a ↔ c

instance instTransIff : Trans Iff Iff Iff

Equations

• instTransIff = { trans := ⋯ }

theorem Eq.comm {α : Sort u_1} {a : α} {b : α} : a = b ↔ b = a

theorem eq_comm {α : Sort u_1} {a : α} {b : α} : a = b ↔ b = a

theorem Iff.symm {a : Prop} {b : Prop} (h : a ↔ b) : b ↔ a

theorem Iff.comm {a : Prop} {b : Prop} : (a ↔ b) ↔ (b ↔ a)

theorem iff_comm {a : Prop} {b : Prop} : (a ↔ b) ↔ (b ↔ a)

theorem And.symm {a : Prop} {b : Prop} : a ∧ b → b ∧ a

theorem And.comm {a : Prop} {b : Prop} : a ∧ b ↔ b ∧ a

theorem and_comm {a : Prop} {b : Prop} : a ∧ b ↔ b ∧ a

theorem Or.symm {a : Prop} {b : Prop} : a ∨ b → b ∨ a

theorem Or.comm {a : Prop} {b : Prop} : a ∨ b ↔ b ∨ a

theorem or_comm {a : Prop} {b : Prop} : a ∨ b ↔ b ∨ a

Exists

theorem Exists.elim {α : Sort u} {p : α → Prop} {b : Prop} (h₁ : ∃ (x : α), p x) (h₂ : ∀ (a : α), p a → b) : b

Decidable

theorem decide_true_eq_true (h : Decidable True) : decide True = true

theorem decide_false_eq_false (h : Decidable False) : decide False = false

@[inline]

def toBoolUsing {p : Prop} (d : Decidable p) : Bool

Similar to decide, but uses an explicit instance

Equations

• toBoolUsing d = decide p

theorem toBoolUsing_eq_true {p : Prop} (d : Decidable p) (h : p) : toBoolUsing d = true

theorem ofBoolUsing_eq_true {p : Prop} {d : Decidable p} (h : toBoolUsing d = true) : p

theorem ofBoolUsing_eq_false {p : Prop} {d : Decidable p} (h : toBoolUsing d = false) : ¬p

instance instDecidableTrue : Decidable True

Equations

• instDecidableTrue = isTrue trivial

instance instDecidableFalse : Decidable False

Equations

• instDecidableFalse = isFalse not_false

@[macro_inline]

def Decidable.byCases {p : Prop} {q : Sort u} [dec : Decidable p] (h1 : p → q) (h2 : ¬p → q) : q

Synonym for dite (dependent if-then-else). We can construct an element q (of any sort, not just a proposition) by cases on whether p is true or false, provided p is decidable.

Equations

• Decidable.byCases h1 h2 = match dec with | isTrue h => h1 h | isFalse h => h2 h

theorem Decidable.em (p : Prop) [Decidable p] : p ∨ ¬p

theorem Decidable.byContradiction {p : Prop} [dec : Decidable p] (h : ¬p → False) : p

theorem Decidable.of_not_not {p : Prop} [Decidable p] : ¬¬p → p

theorem Decidable.not_and_iff_or_not (p : Prop) (q : Prop) [d₁ : Decidable p] [d₂ : Decidable q] : ¬(p ∧ q) ↔ ¬p ∨ ¬q

@[inline]

def decidable_of_decidable_of_iff {p : Prop} {q : Prop} [Decidable p] (h : p ↔ q) : Decidable q

Transfer a decidability proof across an equivalence of propositions.

Equations

• decidable_of_decidable_of_iff h = if hp : p then isTrue ⋯ else isFalse ⋯

@[inline]

def decidable_of_decidable_of_eq {p : Prop} {q : Prop} [Decidable p] (h : p = q) : Decidable q

Transfer a decidability proof across an equality of propositions.

Equations

• decidable_of_decidable_of_eq h = decidable_of_decidable_of_iff ⋯

@[macro_inline]

instance instDecidableForall {p : Prop} {q : Prop} [Decidable p] [Decidable q] : Decidable (p → q)

Equations

• instDecidableForall = if hp : p then if hq : q then isTrue ⋯ else isFalse ⋯ else isTrue ⋯

instance instDecidableIff {p : Prop} {q : Prop} [Decidable p] [Decidable q] : Decidable (p ↔ q)

Equations

• instDecidableIff = if hp : p then if hq : q then isTrue ⋯ else isFalse ⋯ else if hq : q then isFalse ⋯ else isTrue ⋯

if-then-else expression theorems

theorem if_pos {c : Prop} {h : Decidable c} (hc : c) {α : Sort u} {t : α} {e : α} : (if c then t else e) = t

theorem if_neg {c : Prop} {h : Decidable c} (hnc : ¬c) {α : Sort u} {t : α} {e : α} : (if c then t else e) = e

def iteInduction {α : Sort u_1} {c : Prop} [inst : Decidable c] {motive : α → Sort u_2} {t : α} {e : α} (hpos : c → motive t) (hneg : ¬c → motive e) : motive (if c then t else e)

Split an if-then-else into cases. The split tactic is generally easier to use than this theorem.

Equations

• iteInduction hpos hneg = match inst with | isTrue h => hpos h | isFalse h => hneg h

theorem dif_pos {c : Prop} {h : Decidable c} (hc : c) {α : Sort u} {t : c → α} {e : ¬c → α} : dite c t e = t hc

theorem dif_neg {c : Prop} {h : Decidable c} (hnc : ¬c) {α : Sort u} {t : c → α} {e : ¬c → α} : dite c t e = e hnc

theorem dif_eq_if (c : Prop) {h : Decidable c} {α : Sort u} (t : α) (e : α) : (if x : c then t else e) = if c then t else e

instance instDecidableIte {c : Prop} {t : Prop} {e : Prop} [dC : Decidable c] [dT : Decidable t] [dE : Decidable e] : Decidable (if c then t else e)

Equations

• instDecidableIte = match dC with | isTrue h => dT | isFalse h => dE

instance instDecidableDite {c : Prop} {t : c → Prop} {e : ¬c → Prop} [dC : Decidable c] [dT : (h : c) → Decidable (t h)] [dE : (h : ¬c) → Decidable (e h)] : Decidable (if h : c then t h else e h)

Equations

• instDecidableDite = match dC with | isTrue hc => dT hc | isFalse hc => dE hc

@[reducible, inline]

abbrev noConfusionTypeEnum {α : Sort u} {β : Sort v} [inst : DecidableEq β] (f : α → β) (P : Sort w) (x : α) (y : α) : Sort w

Auxiliary definition for generating compact noConfusion for enumeration types

Equations

• noConfusionTypeEnum f P x y = Decidable.casesOn (inst (f x) (f y)) (fun (x : ¬f x = f y) => P) fun (x : f x = f y) => P → P

@[reducible, inline]

abbrev noConfusionEnum {α : Sort u} {β : Sort v} [inst : DecidableEq β] (f : α → β) {P : Sort w} {x : α} {y : α} (h : x = y) : noConfusionTypeEnum f P x y

Auxiliary definition for generating compact noConfusion for enumeration types

Equations

• noConfusionEnum f h = Decidable.casesOn (inst (f x) (f y)) (fun (h' : ¬f x = f y) => ⋯.elim) fun (x : f x = f y) (x : P) => x

Inhabited

instance instInhabitedProp : Inhabited Prop

Equations

• instInhabitedProp = { default := True }

instance instInhabitedForInStep_1 : {a : Type u_1} → [inst : Inhabited a] → Inhabited (ForInStep a)

Equations

• instInhabitedForInStep_1 = { default := ForInStep.done default }

instance instInhabitedTrue : Inhabited True

Equations

• instInhabitedTrue = { default := True.intro }

instance instInhabitedPNonScalar : Inhabited PNonScalar

Equations

• instInhabitedPNonScalar = { default := PNonScalar.mk default }

instance instInhabitedNonScalar : Inhabited NonScalar

Equations

• instInhabitedNonScalar = { default := { val := default } }

theorem nonempty_of_exists {α : Sort u} {p : α → Prop} : (∃ (x : α), p x) → Nonempty α

Subsingleton

class Subsingleton (α : Sort u) : Prop

A "subsingleton" is a type with at most one element. In other words, it is either empty, or has a unique element. All propositions are subsingletons because of proof irrelevance, but some other types are subsingletons as well and they inherit many of the same properties as propositions. Subsingleton α is a typeclass, so it is usually used as an implicit argument and inferred by typeclass inference.

• intro :: (
• allEq : ∀ (a b : α), a = b

  Any two elements of a subsingleton are equal.

• )

theorem Subsingleton.allEq {α : Sort u} [self : Subsingleton α] (a : α) (b : α) : a = b

Any two elements of a subsingleton are equal.

theorem Subsingleton.elim {α : Sort u} [h : Subsingleton α] (a : α) (b : α) : a = b

theorem Subsingleton.helim {α : Sort u} {β : Sort u} [h₁ : Subsingleton α] (h₂ : α = β) (a : α) (b : β) : HEq a b

instance instSubsingleton (p : Prop) : Subsingleton p

Equations

• ⋯ = ⋯

instance instSubsingletonEmpty : Subsingleton Empty

Equations

• instSubsingletonEmpty = ⋯

instance instSubsingletonPEmpty : Subsingleton PEmpty

Equations

• instSubsingletonPEmpty = ⋯

instance instSubsingletonProd {α : Type u_1} {β : Type u_2} [Subsingleton α] [Subsingleton β] : Subsingleton (α × β)

Equations

• ⋯ = ⋯

instance instSubsingletonDecidable (p : Prop) : Subsingleton (Decidable p)

Equations

• ⋯ = ⋯

theorem recSubsingleton {p : Prop} [h : Decidable p] {h₁ : p → Sort u} {h₂ : ¬p → Sort u} [h₃ : ∀ (h : p), Subsingleton (h₁ h)] [h₄ : ∀ (h : ¬p), Subsingleton (h₂ h)] : Subsingleton (Decidable.casesOn h h₂ h₁)

structure Equivalence {α : Sort u} (r : α → α → Prop) : Prop

An equivalence relation ~ : α → α → Prop is a relation that is:

• reflexive: x ~ x
• symmetric: x ~ y implies y ~ x
• transitive: x ~ y and y ~ z implies x ~ z

Equality is an equivalence relation, and equivalence relations share many of the properties of equality. In particular, Quot α r is most well behaved when r is an equivalence relation, and in this case we use Quotient instead.

• refl : ∀ (x : α), r x x

  An equivalence relation is reflexive: x ~ x

• symm : ∀ {x y : α}, r x y → r y x

  An equivalence relation is symmetric: x ~ y implies y ~ x

• trans : ∀ {x y z : α}, r x y → r y z → r x z

  An equivalence relation is transitive: x ~ y and y ~ z implies x ~ z

theorem Equivalence.refl {α : Sort u} {r : α → α → Prop} (self : Equivalence r) (x : α) : r x x

An equivalence relation is reflexive: x ~ x

theorem Equivalence.symm {α : Sort u} {r : α → α → Prop} (self : Equivalence r) {x : α} {y : α} : r x y → r y x

An equivalence relation is symmetric: x ~ y implies y ~ x

theorem Equivalence.trans {α : Sort u} {r : α → α → Prop} (self : Equivalence r) {x : α} {y : α} {z : α} : r x y → r y z → r x z

An equivalence relation is transitive: x ~ y and y ~ z implies x ~ z

def emptyRelation {α : Sort u} : α → α → Prop

The empty relation is the relation on α which is always False.

Equations

• emptyRelation x✝ x = False

def Subrelation {α : Sort u} (q : α → α → Prop) (r : α → α → Prop) : Prop

Subrelation q r means that q ⊆ r or ∀ x y, q x y → r x y. It is the analogue of the subset relation on relations.

Equations

• Subrelation q r = ∀ {x y : α}, q x y → r x y

def InvImage {α : Sort u} {β : Sort v} (r : β → β → Prop) (f : α → β) : α → α → Prop

The inverse image of r : β → β → Prop by a function α → β is the relation s : α → α → Prop defined by s a b = r (f a) (f b).

Equations

• InvImage r f a₁ a₂ = r (f a₁) (f a₂)

inductive Relation.TransGen {α : Sort u} (r : α → α → Prop) : α → α → Prop

The transitive closure TransGen r of a relation r is the smallest relation which is transitive and contains r. TransGen r a z if and only if there exists a sequence a r b r ... r z of length at least 1 connecting a to z.

• single: ∀ {α : Sort u} {r : α → α → Prop} {a b : α}, r a b → Relation.TransGen r a b

  If r a b then TransGen r a b. This is the base case of the transitive closure.

• tail: ∀ {α : Sort u} {r : α → α → Prop} {a b c : α}, Relation.TransGen r a b → r b c → Relation.TransGen r a c

  The transitive closure is transitive.

@[reducible, inline, deprecated Relation.TransGen]

abbrev TC {α : Sort u_1} (r : α → α → Prop) : α → α → Prop

Deprecated synonym for Relation.TransGen.

Equations

• @TC = @Relation.TransGen

Subtype

theorem Subtype.existsOfSubtype {α : Type u} {p : α → Prop} : { x : α // p x } → ∃ (x : α), p x

theorem Subtype.eq {α : Type u} {p : α → Prop} {a1 : { x : α // p x }} {a2 : { x : α // p x }} : a1.val = a2.val → a1 = a2

theorem Subtype.eta {α : Type u} {p : α → Prop} (a : { x : α // p x }) (h : p a.val) : ⟨a.val, h⟩ = a

instance Subtype.instDecidableEq {α : Type u} {p : α → Prop} [DecidableEq α] : DecidableEq { x : α // p x }

Equations

• x✝.instDecidableEq x = match x✝ with | ⟨a, h₁⟩ => match x with | ⟨b, h₂⟩ => if h : a = b then isTrue ⋯ else isFalse ⋯

Sum

instance Sum.inhabitedLeft {α : Type u} {β : Type v} [Inhabited α] : Inhabited (α ⊕ β)

Equations

• Sum.inhabitedLeft = { default := Sum.inl default }

instance Sum.inhabitedRight {α : Type u} {β : Type v} [Inhabited β] : Inhabited (α ⊕ β)

Equations

• Sum.inhabitedRight = { default := Sum.inr default }

instance instDecidableEqSum {α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] : DecidableEq (α ⊕ β)

Equations

• One or more equations did not get rendered due to their size.

Product

instance instInhabitedProd {α : Type u_1} {β : Type u_2} [Inhabited α] [Inhabited β] : Inhabited (α × β)

Equations

• instInhabitedProd = { default := (default, default) }

instance instInhabitedMProd {α : Type u_1} {β : Type u_1} [Inhabited α] [Inhabited β] : Inhabited (MProd α β)

Equations

• instInhabitedMProd = { default := ⟨default, default⟩ }

instance instInhabitedPProd {α : Sort u_1} {β : Sort u_2} [Inhabited α] [Inhabited β] : Inhabited (α ×' β)

Equations

• instInhabitedPProd = { default := ⟨default, default⟩ }

instance instDecidableEqProd {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] : DecidableEq (α × β)

Equations

• One or more equations did not get rendered due to their size.

instance instBEqProd {α : Type u_1} {β : Type u_2} [BEq α] [BEq β] : BEq (α × β)

Equations

• instBEqProd = { beq := fun (x x_1 : α × β) => match x with | (a₁, b₁) => match x_1 with | (a₂, b₂) => a₁ == a₂ && b₁ == b₂ }

def Prod.lexLt {α : Type u_1} {β : Type u_2} [LT α] [LT β] (s : α × β) (t : α × β) : Prop

Lexicographical order for products

Equations

• s.lexLt t = (s.fst < t.fst ∨ s.fst = t.fst ∧ s.snd < t.snd)

instance Prod.lexLtDec {α : Type u_1} {β : Type u_2} [LT α] [LT β] [DecidableEq α] [(a b : α) → Decidable (a < b)] [(a b : β) → Decidable (a < b)] (s : α × β) (t : α × β) : Decidable (s.lexLt t)

Equations

• x✝.lexLtDec x = inferInstanceAs (Decidable (x✝.fst < x.fst ∨ x✝.fst = x.fst ∧ x✝.snd < x.snd))

theorem Prod.lexLt_def {α : Type u_1} {β : Type u_2} [LT α] [LT β] (s : α × β) (t : α × β) : s.lexLt t = (s.fst < t.fst ∨ s.fst = t.fst ∧ s.snd < t.snd)

theorem Prod.eta {α : Type u_1} {β : Type u_2} (p : α × β) : (p.fst, p.snd) = p

def Prod.map {α₁ : Type u₁} {α₂ : Type u₂} {β₁ : Type v₁} {β₂ : Type v₂} (f : α₁ → α₂) (g : β₁ → β₂) : α₁ × β₁ → α₂ × β₂

Prod.map f g : α₁ × β₁ → α₂ × β₂ maps across a pair by applying f to the first component and g to the second.

Equations

• Prod.map f g x = match x with | (a, b) => (f a, g b)

@[simp]

theorem Prod.map_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (f : α → β) (g : γ → δ) (x : α) (y : γ) : Prod.map f g (x, y) = (f x, g y)

@[simp]

theorem Prod.map_fst {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (f : α → β) (g : γ → δ) (x : α × γ) : (Prod.map f g x).fst = f x.fst

@[simp]

theorem Prod.map_snd {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (f : α → β) (g : γ → δ) (x : α × γ) : (Prod.map f g x).snd = g x.snd

Dependent products

theorem Exists.of_psigma_prop {α : Sort u} {p : α → Prop} : (x : α) ×' p x → ∃ (x : α), p x

@[deprecated Exists.of_psigma_prop]

theorem ex_of_PSigma {α : Type u} {p : α → Prop} : (x : α) ×' p x → ∃ (x : α), p x

theorem PSigma.eta {α : Sort u} {β : α → Sort v} {a₁ : α} {a₂ : α} {b₁ : β a₁} {b₂ : β a₂} (h₁ : a₁ = a₂) (h₂ : h₁ ▸ b₁ = b₂) : ⟨a₁, b₁⟩ = ⟨a₂, b₂⟩

Universe polymorphic unit

theorem PUnit.subsingleton (a : PUnit) (b : PUnit) : a = b

theorem PUnit.eq_punit (a : PUnit) : a = PUnit.unit

instance instSubsingletonPUnit : Subsingleton PUnit

Equations

• instSubsingletonPUnit = ⋯

instance instInhabitedPUnit : Inhabited PUnit

Equations

• instInhabitedPUnit = { default := PUnit.unit }

instance instDecidableEqPUnit : DecidableEq PUnit

Equations

• instDecidableEqPUnit a b = isTrue ⋯

Setoid

class Setoid (α : Sort u) : Sort (max 1 u)

A setoid is a type with a distinguished equivalence relation, denoted ≈. This is mainly used as input to the Quotient type constructor.

• r : α → α → Prop

  x ≈ y is the distinguished equivalence relation of a setoid.

• iseqv : Equivalence Setoid.r

  The relation x ≈ y is an equivalence relation.

theorem Setoid.iseqv {α : Sort u} [self : Setoid α] : Equivalence Setoid.r

The relation x ≈ y is an equivalence relation.

instance instHasEquivOfSetoid {α : Sort u} [Setoid α] : HasEquiv α

Equations

• instHasEquivOfSetoid = { Equiv := Setoid.r }

theorem Setoid.refl {α : Sort u} [Setoid α] (a : α) : a ≈ a

theorem Setoid.symm {α : Sort u} [Setoid α] {a : α} {b : α} (hab : a ≈ b) : b ≈ a

theorem Setoid.trans {α : Sort u} [Setoid α] {a : α} {b : α} {c : α} (hab : a ≈ b) (hbc : b ≈ c) : a ≈ c

Propositional extensionality

axiom propext {a : Prop} {b : Prop} : (a ↔ b) → a = b

The axiom of propositional extensionality. It asserts that if propositions a and b are logically equivalent (i.e. we can prove a from b and vice versa), then a and b are equal, meaning that we can replace a with b in all contexts.

For simple expressions like a ∧ c ∨ d → e we can prove that because all the logical connectives respect logical equivalence, we can replace a with b in this expression without using propext. However, for higher order expressions like P a where P : Prop → Prop is unknown, or indeed for a = b itself, we cannot replace a with b without an axiom which says exactly this.

This is a relatively uncontroversial axiom, which is intuitionistically valid. It does however block computation when using #reduce to reduce proofs directly (which is not recommended), meaning that canonicity, the property that all closed terms of type Nat normalize to numerals, fails to hold when this (or any) axiom is used:

set_option pp.proofs true

def foo : Nat := by
  have : (True → True) ↔ True := ⟨λ _ => trivial, λ _ _ => trivial⟩
  have := propext this ▸ (2 : Nat)
  exact this

#reduce foo
-- propext { mp := fun x x => True.intro, mpr := fun x => True.intro } ▸ 2

#eval foo -- 2

#eval can evaluate it to a numeral because the compiler erases casts and does not evaluate proofs, so propext, whose return type is a proposition, can never block it.

theorem Eq.propIntro {a : Prop} {b : Prop} (h₁ : a → b) (h₂ : b → a) : a = b

instance instDecidableEqOfIff {p : Prop} {q : Prop} [d : Decidable (p ↔ q)] : Decidable (p = q)

Equations

• instDecidableEqOfIff = match d with | isTrue h => isTrue ⋯ | isFalse h => isFalse ⋯

theorem Nat.succ.inj {m : Nat} {n : Nat} : m.succ = n.succ → m = n

theorem Nat.succ.injEq (u : Nat) (v : Nat) : (u.succ = v.succ) = (u = v)

@[simp]

theorem beq_iff_eq {α : Type u_1} [BEq α] [LawfulBEq α] (a : α) (b : α) : (a == b) = true ↔ a = b

Prop lemmas

def Not.elim {a : Prop} {α : Sort u_1} (H1 : ¬a) (H2 : a) : α

Ex falso for negation: from ¬a and a anything follows. This is the same as absurd with the arguments flipped, but it is in the Not namespace so that projection notation can be used.

Equations

• H1.elim H2 = absurd H2 H1

@[reducible, inline]

abbrev And.elim {a : Prop} {b : Prop} {α : Sort u_1} (f : a → b → α) (h : a ∧ b) : α

Non-dependent eliminator for And.

Equations

• And.elim f h = f ⋯ ⋯

def Iff.elim {a : Prop} {b : Prop} {α : Sort u_1} (f : (a → b) → (b → a) → α) (h : a ↔ b) : α

Non-dependent eliminator for Iff.

Equations

• Iff.elim f h = f ⋯ ⋯

theorem Iff.subst {a : Prop} {b : Prop} {p : Prop → Prop} (h₁ : a ↔ b) (h₂ : p a) : p b

Iff can now be used to do substitutions in a calculation

theorem Not.intro {a : Prop} (h : a → False) : ¬a

theorem Not.imp {a : Prop} {b : Prop} (H2 : ¬b) (H1 : a → b) : ¬a

theorem not_congr {a : Prop} {b : Prop} (h : a ↔ b) : ¬a ↔ ¬b

theorem not_not_not {a : Prop} : ¬¬¬a ↔ ¬a

theorem iff_of_true {a : Prop} {b : Prop} (ha : a) (hb : b) : a ↔ b

theorem iff_of_false {a : Prop} {b : Prop} (ha : ¬a) (hb : ¬b) : a ↔ b

theorem iff_true_left {a : Prop} {b : Prop} (ha : a) : (a ↔ b) ↔ b

theorem iff_true_right {a : Prop} {b : Prop} (ha : a) : (b ↔ a) ↔ b

theorem iff_false_left {a : Prop} {b : Prop} (ha : ¬a) : (a ↔ b) ↔ ¬b

theorem iff_false_right {a : Prop} {b : Prop} (ha : ¬a) : (b ↔ a) ↔ ¬b

theorem of_iff_true {a : Prop} (h : a ↔ True) : a

theorem iff_true_intro {a : Prop} (h : a) : a ↔ True

theorem eq_iff_true_of_subsingleton {α : Sort u_1} [Subsingleton α] (x : α) (y : α) : x = y ↔ True

theorem not_of_iff_false {p : Prop} : (p ↔ False) → ¬p

theorem iff_false_intro {a : Prop} (h : ¬a) : a ↔ False

theorem not_iff_false_intro {a : Prop} (h : a) : ¬a ↔ False

theorem not_true : ¬True ↔ False

theorem not_false_iff : ¬False ↔ True

theorem Eq.to_iff {a : Prop} {b : Prop} : a = b → (a ↔ b)

theorem iff_of_eq {a : Prop} {b : Prop} : a = b → (a ↔ b)

theorem neq_of_not_iff {a : Prop} {b : Prop} : ¬(a ↔ b) → a ≠ b

theorem iff_iff_eq {a : Prop} {b : Prop} : (a ↔ b) ↔ a = b

@[simp]

theorem eq_iff_iff {a : Prop} {b : Prop} : a = b ↔ (a ↔ b)

theorem eq_self_iff_true {α : Sort u_1} (a : α) : a = a ↔ True

theorem ne_self_iff_false {α : Sort u_1} (a : α) : a ≠ a ↔ False

theorem false_of_true_iff_false (h : True ↔ False) : False

theorem false_of_true_eq_false (h : True = False) : False

theorem true_eq_false_of_false : False → True = False

theorem iff_def {a : Prop} {b : Prop} : (a ↔ b) ↔ (a → b) ∧ (b → a)

theorem iff_def' {a : Prop} {b : Prop} : (a ↔ b) ↔ (b → a) ∧ (a → b)

theorem true_iff_false : (True ↔ False) ↔ False

theorem false_iff_true : (False ↔ True) ↔ False

@[simp]

theorem iff_not_self {a : Prop} : ¬(a ↔ ¬a)

theorem heq_self_iff_true {α : Sort u_1} (a : α) : HEq a a ↔ True

implies

theorem not_not_of_not_imp {a : Prop} {b : Prop} : ¬(a → b) → ¬¬a

theorem not_of_not_imp {b : Prop} {a : Prop} : ¬(a → b) → ¬b

@[simp]

theorem imp_not_self {a : Prop} : a → ¬a ↔ ¬a

theorem imp_intro {α : Prop} {β : Prop} (h : α) : β → α

theorem imp_imp_imp {a : Prop} {b : Prop} {c : Prop} {d : Prop} (h₀ : c → a) (h₁ : b → d) : (a → b) → c → d

theorem imp_iff_right {b : Prop} {a : Prop} (ha : a) : a → b ↔ b

theorem imp_true_iff (α : Sort u) : α → True ↔ True

theorem false_imp_iff (a : Prop) : False → a ↔ True

theorem true_imp_iff (α : Prop) : True → α ↔ α

@[simp]

theorem imp_self {a : Prop} : a → a ↔ True

@[simp]

theorem imp_false {a : Prop} : a → False ↔ ¬a

theorem imp.swap {a : Prop} {b : Prop} {c : Prop} : a → b → c ↔ b → a → c

theorem imp_not_comm {a : Prop} {b : Prop} : a → ¬b ↔ b → ¬a

theorem imp_congr_left {a : Prop} {b : Prop} {c : Prop} (h : a ↔ b) : a → c ↔ b → c

theorem imp_congr_right {a : Prop} {b : Prop} {c : Prop} (h : a → (b ↔ c)) : a → b ↔ a → c

theorem imp_congr_ctx {a : Prop} {b : Prop} {c : Prop} {d : Prop} (h₁ : a ↔ c) (h₂ : c → (b ↔ d)) : a → b ↔ c → d

theorem imp_congr {a : Prop} {b : Prop} {c : Prop} {d : Prop} (h₁ : a ↔ c) (h₂ : b ↔ d) : a → b ↔ c → d

theorem imp_iff_not {a : Prop} {b : Prop} (hb : ¬b) : a → b ↔ ¬a

Quotients

axiom Quot.sound {α : Sort u} {r : α → α → Prop} {a : α} {b : α} : r a b → Quot.mk r a = Quot.mk r b

The quotient axiom, or at least the nontrivial part of the quotient axiomatization. Quotient types are introduced by the init_quot command in Init.Prelude which introduces the axioms:

opaque Quot {α : Sort u} (r : α → α → Prop) : Sort u

opaque Quot.mk {α : Sort u} (r : α → α → Prop) (a : α) : Quot r

opaque Quot.lift {α : Sort u} {r : α → α → Prop} {β : Sort v} (f : α → β) :
  (∀ a b : α, r a b → f a = f b) → Quot r → β

opaque Quot.ind {α : Sort u} {r : α → α → Prop} {β : Quot r → Prop} :
  (∀ a : α, β (Quot.mk r a)) → ∀ q : Quot r, β q

All of these axioms are true if we assume Quot α r = α and Quot.mk and Quot.lift are identity functions, so they do not add much. However this axiom cannot be explained in that way (it is false for that interpretation), so the real power of quotient types come from this axiom.

It says that the quotient by r maps elements which are related by r to equal values in the quotient. Together with Quot.lift which says that functions which respect r can be lifted to functions on the quotient, we can deduce that Quot α r exactly consists of the equivalence classes with respect to r.

It is important to note that r need not be an equivalence relation in this axiom. When r is not an equivalence relation, we are actually taking a quotient with respect to the equivalence relation generated by r.

theorem Quot.liftBeta {α : Sort u} {r : α → α → Prop} {β : Sort v} (f : α → β) (c : ∀ (a b : α), r a b → f a = f b) (a : α) : Quot.lift f c (Quot.mk r a) = f a

theorem Quot.indBeta {α : Sort u} {r : α → α → Prop} {motive : Quot r → Prop} (p : ∀ (a : α), motive (Quot.mk r a)) (a : α) : ⋯ = ⋯

@[reducible, inline]

abbrev Quot.liftOn {α : Sort u} {β : Sort v} {r : α → α → Prop} (q : Quot r) (f : α → β) (c : ∀ (a b : α), r a b → f a = f b) : β

Quot.liftOn q f h is the same as Quot.lift f h q. It just reorders the argument q : Quot r to be first.

Equations

• q.liftOn f c = Quot.lift f c q

theorem Quot.inductionOn {α : Sort u} {r : α → α → Prop} {motive : Quot r → Prop} (q : Quot r) (h : ∀ (a : α), motive (Quot.mk r a)) : motive q

theorem Quot.exists_rep {α : Sort u} {r : α → α → Prop} (q : Quot r) : ∃ (a : α), Quot.mk r a = q

@[reducible, macro_inline]

def Quot.indep {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (f : (a : α) → motive (Quot.mk r a)) (a : α) : PSigma motive

Auxiliary definition for Quot.rec.

Equations

• Quot.indep f a = ⟨Quot.mk r a, f a⟩

theorem Quot.indepCoherent {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (f : (a : α) → motive (Quot.mk r a)) (h : ∀ (a b : α) (p : r a b), ⋯ ▸ f a = f b) (a : α) (b : α) : r a b → Quot.indep f a = Quot.indep f b

theorem Quot.liftIndepPr1 {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (f : (a : α) → motive (Quot.mk r a)) (h : ∀ (a b : α) (p : r a b), ⋯ ▸ f a = f b) (q : Quot r) : (Quot.lift (Quot.indep f) ⋯ q).fst = q

@[reducible, inline]

abbrev Quot.rec {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (f : (a : α) → motive (Quot.mk r a)) (h : ∀ (a b : α) (p : r a b), ⋯ ▸ f a = f b) (q : Quot r) : motive q

Dependent recursion principle for Quot. This constructor can be tricky to use, so you should consider the simpler versions if they apply:

• Quot.lift, for nondependent functions
• Quot.ind, for theorems / proofs of propositions about quotients
• Quot.recOnSubsingleton, when the target type is a Subsingleton
• Quot.hrecOn, which uses HEq (f a) (f b) instead of a sound p ▸ f a = f b assummption

Equations

• Quot.rec f h q = Eq.ndrecOn ⋯ (Quot.lift (Quot.indep f) ⋯ q).snd

@[reducible, inline]

abbrev Quot.recOn {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (q : Quot r) (f : (a : α) → motive (Quot.mk r a)) (h : ∀ (a b : α) (p : r a b), ⋯ ▸ f a = f b) : motive q

Dependent recursion principle for Quot. This constructor can be tricky to use, so you should consider the simpler versions if they apply:

• Quot.lift, for nondependent functions
• Quot.ind, for theorems / proofs of propositions about quotients
• Quot.recOnSubsingleton, when the target type is a Subsingleton
• Quot.hrecOn, which uses HEq (f a) (f b) instead of a sound p ▸ f a = f b assummption

Equations

• Quot.recOn q f h = Quot.rec f h q

@[reducible, inline]

abbrev Quot.recOnSubsingleton {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} [h : ∀ (a : α), Subsingleton (motive (Quot.mk r a))] (q : Quot r) (f : (a : α) → motive (Quot.mk r a)) : motive q

Dependent induction principle for a quotient, when the target type is a Subsingleton. In this case the quotient's side condition is trivial so any function can be lifted.

Equations

• Quot.recOnSubsingleton q f = Quot.rec (fun (a : α) => f a) ⋯ q

@[reducible, inline]

abbrev Quot.hrecOn {α : Sort u} {r : α → α → Prop} {motive : Quot r → Sort v} (q : Quot r) (f : (a : α) → motive (Quot.mk r a)) (c : ∀ (a b : α), r a b → HEq (f a) (f b)) : motive q

Heterogeneous dependent recursion principle for a quotient. This may be easier to work with since it uses HEq instead of an Eq.ndrec in the hypothesis.

Equations

• Quot.hrecOn q f c = Quot.recOn q f ⋯

def Quotient {α : Sort u} (s : Setoid α) : Sort u

Quotient α s is the same as Quot α r, but it is specialized to a setoid s (that is, an equivalence relation) instead of an arbitrary relation. Prefer Quotient over Quot if your relation is actually an equivalence relation.

Equations

• Quotient s = Quot Setoid.r

@[inline]

def Quotient.mk {α : Sort u} (s : Setoid α) (a : α) : Quotient s

The canonical quotient map into a Quotient.

Equations

• Quotient.mk s a = Quot.mk Setoid.r a

def Quotient.mk' {α : Sort u} [s : Setoid α] (a : α) : Quotient s

The canonical quotient map into a Quotient. (This synthesizes the setoid by typeclass inference.)

Equations

• Quotient.mk' a = Quotient.mk s a

theorem Quotient.sound {α : Sort u} {s : Setoid α} {a : α} {b : α} : a ≈ b → Quotient.mk s a = Quotient.mk s b

The analogue of Quot.sound: If a and b are related by the equivalence relation, then they have equal equivalence classes.

@[reducible, inline]

abbrev Quotient.lift {α : Sort u} {β : Sort v} {s : Setoid α} (f : α → β) : (∀ (a b : α), a ≈ b → f a = f b) → Quotient s → β

The analogue of Quot.lift: if f : α → β respects the equivalence relation ≈, then it lifts to a function on Quotient s such that lift f h (mk a) = f a.

Equations

• Quotient.lift f = Quot.lift f

theorem Quotient.ind {α : Sort u} {s : Setoid α} {motive : Quotient s → Prop} : (∀ (a : α), motive (Quotient.mk s a)) → ∀ (q : Quotient s), motive q

The analogue of Quot.ind: every element of Quotient s is of the form Quotient.mk s a.

@[reducible, inline]

abbrev Quotient.liftOn {α : Sort u} {β : Sort v} {s : Setoid α} (q : Quotient s) (f : α → β) (c : ∀ (a b : α), a ≈ b → f a = f b) : β

The analogue of Quot.liftOn: if f : α → β respects the equivalence relation ≈, then it lifts to a function on Quotient s such that lift (mk a) f h = f a.

Equations

• q.liftOn f c = Quot.liftOn q f c

theorem Quotient.inductionOn {α : Sort u} {s : Setoid α} {motive : Quotient s → Prop} (q : Quotient s) (h : ∀ (a : α), motive (Quotient.mk s a)) : motive q

The analogue of Quot.inductionOn: every element of Quotient s is of the form Quotient.mk s a.

theorem Quotient.exists_rep {α : Sort u} {s : Setoid α} (q : Quotient s) : ∃ (a : α), Quotient.mk s a = q

@[inline]

def Quotient.rec {α : Sort u} {s : Setoid α} {motive : Quotient s → Sort v} (f : (a : α) → motive (Quotient.mk s a)) (h : ∀ (a b : α) (p : a ≈ b), ⋯ ▸ f a = f b) (q : Quotient s) : motive q

The analogue of Quot.rec for Quotient. See Quot.rec.

Equations

• Quotient.rec f h q = Quot.rec f h q

@[reducible, inline]

abbrev Quotient.recOn {α : Sort u} {s : Setoid α} {motive : Quotient s → Sort v} (q : Quotient s) (f : (a : α) → motive (Quotient.mk s a)) (h : ∀ (a b : α) (p : a ≈ b), ⋯ ▸ f a = f b) : motive q

The analogue of Quot.recOn for Quotient. See Quot.recOn.

Equations

• Quotient.recOn q f h = Quot.recOn q f h

@[reducible, inline]

abbrev Quotient.recOnSubsingleton {α : Sort u} {s : Setoid α} {motive : Quotient s → Sort v} [h : ∀ (a : α), Subsingleton (motive (Quotient.mk s a))] (q : Quotient s) (f : (a : α) → motive (Quotient.mk s a)) : motive q

The analogue of Quot.recOnSubsingleton for Quotient. See Quot.recOnSubsingleton.

Equations

• Quotient.recOnSubsingleton q f = Quot.recOnSubsingleton q f

@[reducible, inline]

abbrev Quotient.hrecOn {α : Sort u} {s : Setoid α} {motive : Quotient s → Sort v} (q : Quotient s) (f : (a : α) → motive (Quotient.mk s a)) (c : ∀ (a b : α), a ≈ b → HEq (f a) (f b)) : motive q

The analogue of Quot.hrecOn for Quotient. See Quot.hrecOn.

Equations

• Quotient.hrecOn q f c = Quot.hrecOn q f c

@[reducible, inline]

abbrev Quotient.lift₂ {α : Sort uA} {β : Sort uB} {φ : Sort uC} {s₁ : Setoid α} {s₂ : Setoid β} (f : α → β → φ) (c : ∀ (a₁ : α) (b₁ : β) (a₂ : α) (b₂ : β), a₁ ≈ a₂ → b₁ ≈ b₂ → f a₁ b₁ = f a₂ b₂) (q₁ : Quotient s₁) (q₂ : Quotient s₂) : φ

Lift a binary function to a quotient on both arguments.

Equations

• Quotient.lift₂ f c q₁ q₂ = Quotient.lift (fun (a₁ : α) => Quotient.lift (f a₁) ⋯ q₂) ⋯ q₁

@[reducible, inline]

abbrev Quotient.liftOn₂ {α : Sort uA} {β : Sort uB} {φ : Sort uC} {s₁ : Setoid α} {s₂ : Setoid β} (q₁ : Quotient s₁) (q₂ : Quotient s₂) (f : α → β → φ) (c : ∀ (a₁ : α) (b₁ : β) (a₂ : α) (b₂ : β), a₁ ≈ a₂ → b₁ ≈ b₂ → f a₁ b₁ = f a₂ b₂) : φ

Lift a binary function to a quotient on both arguments.

Equations

• q₁.liftOn₂ q₂ f c = Quotient.lift₂ f c q₁ q₂

theorem Quotient.ind₂ {α : Sort uA} {β : Sort uB} {s₁ : Setoid α} {s₂ : Setoid β} {motive : Quotient s₁ → Quotient s₂ → Prop} (h : ∀ (a : α) (b : β), motive (Quotient.mk s₁ a) (Quotient.mk s₂ b)) (q₁ : Quotient s₁) (q₂ : Quotient s₂) : motive q₁ q₂

theorem Quotient.inductionOn₂ {α : Sort uA} {β : Sort uB} {s₁ : Setoid α} {s₂ : Setoid β} {motive : Quotient s₁ → Quotient s₂ → Prop} (q₁ : Quotient s₁) (q₂ : Quotient s₂) (h : ∀ (a : α) (b : β), motive (Quotient.mk s₁ a) (Quotient.mk s₂ b)) : motive q₁ q₂

theorem Quotient.inductionOn₃ {α : Sort uA} {β : Sort uB} {φ : Sort uC} {s₁ : Setoid α} {s₂ : Setoid β} {s₃ : Setoid φ} {motive : Quotient s₁ → Quotient s₂ → Quotient s₃ → Prop} (q₁ : Quotient s₁) (q₂ : Quotient s₂) (q₃ : Quotient s₃) (h : ∀ (a : α) (b : β) (c : φ), motive (Quotient.mk s₁ a) (Quotient.mk s₂ b) (Quotient.mk s₃ c)) : motive q₁ q₂ q₃

theorem Quotient.exact {α : Sort u} {s : Setoid α} {a : α} {b : α} : Quotient.mk s a = Quotient.mk s b → a ≈ b

@[reducible, inline]

abbrev Quotient.recOnSubsingleton₂ {α : Sort uA} {β : Sort uB} {s₁ : Setoid α} {s₂ : Setoid β} {motive : Quotient s₁ → Quotient s₂ → Sort uC} [s : ∀ (a : α) (b : β), Subsingleton (motive (Quotient.mk s₁ a) (Quotient.mk s₂ b))] (q₁ : Quotient s₁) (q₂ : Quotient s₂) (g : (a : α) → (b : β) → motive (Quotient.mk s₁ a) (Quotient.mk s₂ b)) : motive q₁ q₂

Lift a binary function to a quotient on both arguments.

Equations

• Quotient.recOnSubsingleton₂ q₁ q₂ g = Quot.recOnSubsingleton q₁ fun (a : α) => Quot.recOnSubsingleton q₂ fun (a_1 : β) => g a a_1

instance instDecidableEqQuotientOfDecidableEquiv {α : Sort u} {s : Setoid α} [d : (a b : α) → Decidable (a ≈ b)] : DecidableEq (Quotient s)

Equations

• instDecidableEqQuotientOfDecidableEquiv q₁ q₂ = Quotient.recOnSubsingleton₂ q₁ q₂ fun (a₁ a₂ : α) => match d a₁ a₂ with | isTrue h₁ => isTrue ⋯ | isFalse h₂ => isFalse ⋯

Function extensionality

theorem funext {α : Sort u} {β : α → Sort v} {f : (x : α) → β x} {g : (x : α) → β x} (h : ∀ (x : α), f x = g x) : f = g

Function extensionality is the statement that if two functions take equal values every point, then the functions themselves are equal: (∀ x, f x = g x) → f = g. It is called "extensionality" because it talks about how to prove two objects are equal based on the properties of the object (compare with set extensionality, which is (∀ x, x ∈ s ↔ x ∈ t) → s = t).

This is often an axiom in dependent type theory systems, because it cannot be proved from the core logic alone. However in lean's type theory this follows from the existence of quotient types (note the Quot.sound in the proof, as well as the show line which makes use of the definitional equality Quot.lift f h (Quot.mk x) = f x).

instance instSubsingletonForall {α : Sort u} {β : α → Sort v} [∀ (a : α), Subsingleton (β a)] : Subsingleton ((a : α) → β a)

Equations

• ⋯ = ⋯

Squash

def Squash (α : Type u) : Type u

Squash α is the quotient of α by the always true relation. It is empty if α is empty, otherwise it is a singleton. (Thus it is unconditionally a Subsingleton.) It is the "universal Subsingleton" mapped from α.

It is similar to Nonempty α, which has the same properties, but unlike Nonempty this is a Type u, that is, it is "data", and the compiler represents an element of Squash α the same as α itself (as compared to Nonempty α, whose elements are represented by a dummy value).

Squash.lift will extract a value in any subsingleton β from a function on α, while Nonempty.rec can only do the same when β is a proposition.

Equations

• Squash α = Quot fun (x x : α) => True

def Squash.mk {α : Type u} (x : α) : Squash α

The canonical quotient map into Squash α.

Equations

• Squash.mk x = Quot.mk (fun (x x : α) => True) x

theorem Squash.ind {α : Type u} {motive : Squash α → Prop} (h : ∀ (a : α), motive (Squash.mk a)) (q : Squash α) : motive q

@[inline]

def Squash.lift {α : Type u_1} {β : Sort u_2} [Subsingleton β] (s : Squash α) (f : α → β) : β

If β is a subsingleton, then a function α → β lifts to Squash α → β.

Equations

• s.lift f = Quot.lift f ⋯ s

instance instSubsingletonSquash {α : Type u} : Subsingleton (Squash α)

Equations

• ⋯ = ⋯

Relations

class Antisymm {α : Sort u} (r : α → α → Prop) : Prop

Antisymm (·≤·) says that (·≤·) is antisymmetric, that is, a ≤ b → b ≤ a → a = b.

• antisymm : ∀ {a b : α}, r a b → r b a → a = b

  An antisymmetric relation (·≤·) satisfies a ≤ b → b ≤ a → a = b.

theorem Antisymm.antisymm {α : Sort u} {r : α → α → Prop} [self : Antisymm r] {a : α} {b : α} : r a b → r b a → a = b

An antisymmetric relation (·≤·) satisfies a ≤ b → b ≤ a → a = b.

Kernel reduction hints

axiom Lean.trustCompiler : True

Depends on the correctness of the Lean compiler, interpreter, and all [implemented_by ...] and [extern ...] annotations.

opaque Lean.reduceBool (b : Bool) : Bool

When the kernel tries to reduce a term Lean.reduceBool c, it will invoke the Lean interpreter to evaluate c. The kernel will not use the interpreter if c is not a constant. This feature is useful for performing proofs by reflection.

Remark: the Lean frontend allows terms of the from Lean.reduceBool t where t is a term not containing free variables. The frontend automatically declares a fresh auxiliary constant c and replaces the term with Lean.reduceBool c. The main motivation is that the code for t will be pre-compiled.

Warning: by using this feature, the Lean compiler and interpreter become part of your trusted code base. This is extra 30k lines of code. More importantly, you will probably not be able to check your development using external type checkers (e.g., Trepplein) that do not implement this feature. Keep in mind that if you are using Lean as programming language, you are already trusting the Lean compiler and interpreter. So, you are mainly losing the capability of type checking your development using external checkers.

Recall that the compiler trusts the correctness of all [implemented_by ...] and [extern ...] annotations. If an extern function is executed, then the trusted code base will also include the implementation of the associated foreign function.

opaque Lean.reduceNat (n : Nat) : Nat

Similar to Lean.reduceBool for closed Nat terms.

Remark: we do not have plans for supporting a generic reduceValue {α} (a : α) : α := a. The main issue is that it is non-trivial to convert an arbitrary runtime object back into a Lean expression. We believe Lean.reduceBool enables most interesting applications (e.g., proof by reflection).

axiom Lean.ofReduceBool (a : Bool) (b : Bool) (h : Lean.reduceBool a = b) : a = b

The axiom ofReduceBool is used to perform proofs by reflection. See reduceBool.

This axiom is usually not used directly, because it has some syntactic restrictions. Instead, the native_decide tactic can be used to prove any proposition whose decidability instance can be evaluated to true using the lean compiler / interpreter.

Warning: by using this feature, the Lean compiler and interpreter become part of your trusted code base. This is extra 30k lines of code. More importantly, you will probably not be able to check your development using external type checkers (e.g., Trepplein) that do not implement this feature. Keep in mind that if you are using Lean as programming language, you are already trusting the Lean compiler and interpreter. So, you are mainly losing the capability of type checking your development using external checkers.

axiom Lean.ofReduceNat (a : Nat) (b : Nat) (h : Lean.reduceNat a = b) : a = b

The axiom ofReduceNat is used to perform proofs by reflection. See reduceBool.

Warning: by using this feature, the Lean compiler and interpreter become part of your trusted code base. This is extra 30k lines of code. More importantly, you will probably not be able to check your development using external type checkers (e.g., Trepplein) that do not implement this feature. Keep in mind that if you are using Lean as programming language, you are already trusting the Lean compiler and interpreter. So, you are mainly losing the capability of type checking your development using external checkers.

@[simp]

theorem ge_iff_le {α : Type u} [LE α] {x : α} {y : α} : x ≥ y ↔ y ≤ x

@[simp]

theorem gt_iff_lt {α : Type u} [LT α] {x : α} {y : α} : x > y ↔ y < x

theorem le_of_eq_of_le {α : Type u} {a : α} {b : α} {c : α} [LE α] (h₁ : a = b) (h₂ : b ≤ c) : a ≤ c

theorem le_of_le_of_eq {α : Type u} {a : α} {b : α} {c : α} [LE α] (h₁ : a ≤ b) (h₂ : b = c) : a ≤ c

theorem lt_of_eq_of_lt {α : Type u} {a : α} {b : α} {c : α} [LT α] (h₁ : a = b) (h₂ : b < c) : a < c

theorem lt_of_lt_of_eq {α : Type u} {a : α} {b : α} {c : α} [LT α] (h₁ : a < b) (h₂ : b = c) : a < c

class Std.Associative {α : Sort u} (op : α → α → α) : Prop

Associative op indicates op is an associative operation, i.e. (a ∘ b) ∘ c = a ∘ (b ∘ c).

• assoc : ∀ (a b c : α), op (op a b) c = op a (op b c)

  An associative operation satisfies (a ∘ b) ∘ c = a ∘ (b ∘ c).

theorem Std.Associative.assoc {α : Sort u} {op : α → α → α} [self : Std.Associative op] (a : α) (b : α) (c : α) : op (op a b) c = op a (op b c)

An associative operation satisfies (a ∘ b) ∘ c = a ∘ (b ∘ c).

class Std.Commutative {α : Sort u} (op : α → α → α) : Prop

Commutative op says that op is a commutative operation, i.e. a ∘ b = b ∘ a.

• comm : ∀ (a b : α), op a b = op b a

  A commutative operation satisfies a ∘ b = b ∘ a.

theorem Std.Commutative.comm {α : Sort u} {op : α → α → α} [self : Std.Commutative op] (a : α) (b : α) : op a b = op b a

A commutative operation satisfies a ∘ b = b ∘ a.

class Std.IdempotentOp {α : Sort u} (op : α → α → α) : Prop

IdempotentOp op indicates op is an idempotent binary operation. i.e. a ∘ a = a.

• idempotent : ∀ (x : α), op x x = x

  An idempotent operation satisfies a ∘ a = a.

theorem Std.IdempotentOp.idempotent {α : Sort u} {op : α → α → α} [self : Std.IdempotentOp op] (x : α) : op x x = x

An idempotent operation satisfies a ∘ a = a.

class Std.LeftIdentity {α : Sort u} {β : Sort u_1} (op : α → β → β) (o : outParam α) : Prop

LeftIdentify op o indicates o is a left identity of op.

This class does not require a proof that o is an identity, and is used primarily for infering the identity using class resoluton.

class Std.LawfulLeftIdentity {α : Sort u} {β : Sort u_1} (op : α → β → β) (o : outParam α) extends Std.LeftIdentity : Prop

LawfulLeftIdentify op o indicates o is a verified left identity of op.

• left_id : ∀ (a : β), op o a = a

  Left identity o is an identity.

theorem Std.LawfulLeftIdentity.left_id {α : Sort u} {β : Sort u_1} {op : α → β → β} {o : outParam α} [self : Std.LawfulLeftIdentity op o] (a : β) : op o a = a

Left identity o is an identity.

class Std.RightIdentity {α : Sort u} {β : Sort u_1} (op : α → β → α) (o : outParam β) : Prop

RightIdentify op o indicates o is a right identity o of op.

This class does not require a proof that o is an identity, and is used primarily for infering the identity using class resoluton.

class Std.LawfulRightIdentity {α : Sort u} {β : Sort u_1} (op : α → β → α) (o : outParam β) extends Std.RightIdentity : Prop

LawfulRightIdentify op o indicates o is a verified right identity of op.

• right_id : ∀ (a : α), op a o = a

  Right identity o is an identity.

theorem Std.LawfulRightIdentity.right_id {α : Sort u} {β : Sort u_1} {op : α → β → α} {o : outParam β} [self : Std.LawfulRightIdentity op o] (a : α) : op a o = a

Right identity o is an identity.

class Std.Identity {α : Sort u} (op : α → α → α) (o : outParam α) extends Std.LeftIdentity , Std.RightIdentity : Prop

Identity op o indicates o is a left and right identity of op.

This class does not require a proof that o is an identity, and is used primarily for infering the identity using class resoluton.

class Std.LawfulIdentity {α : Sort u} (op : α → α → α) (o : outParam α) extends Std.Identity : Prop

LawfulIdentity op o indicates o is a verified left and right identity of op.

• left_id : ∀ (a : α), op o a = a

  Left identity o is an identity.

• right_id : ∀ (a : α), op a o = a

  Right identity o is an identity.

class Std.LawfulCommIdentity {α : Sort u} (op : α → α → α) (o : outParam α) [hc : Std.Commutative op] extends Std.LawfulIdentity : Prop

LawfulCommIdentity can simplify defining instances of LawfulIdentity on commutative functions by requiring only a left or right identity proof.

This class is intended for simplifying defining instances of LawfulIdentity and functions needed commutative operations with identity should just add a LawfulIdentity constraint.

instance Std.instCommutativeOr : Std.Commutative Or

Equations

• Std.instCommutativeOr = ⋯

instance Std.instCommutativeAnd : Std.Commutative And

Equations

• Std.instCommutativeAnd = ⋯

instance Std.instCommutativeIff : Std.Commutative Iff

Equations

• Std.instCommutativeIff = ⋯