def Lean.Meta.mkId (e : Lean.Expr) : Lean.MetaM Lean.Expr

Return id e

Equations

• Lean.Meta.mkId e = do let type ← Lean.Meta.inferType e let u ← Lean.Meta.getLevel type pure (Lean.mkApp2 (Lean.mkConst `id [u]) type e)

def Lean.Meta.mkExpectedTypeHint (e : Lean.Expr) (expectedType : Lean.Expr) : Lean.MetaM Lean.Expr

Given e s.t. inferType e is definitionally equal to expectedType, return term @id expectedType e.

Equations

• Lean.Meta.mkExpectedTypeHint e expectedType = do let u ← Lean.Meta.getLevel expectedType pure (Lean.mkApp2 (Lean.mkConst `id [u]) expectedType e)

def Lean.Meta.mkLetFun (x : Lean.Expr) (v : Lean.Expr) (e : Lean.Expr) : Lean.MetaM Lean.Expr

mkLetFun x v e creates the encoding for the let_fun x := v; e expression. The expression x can either be a free variable or a metavariable, and the function suitably abstracts x in e.

Equations

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

def Lean.Meta.mkEq (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a = b.

Equations

• Lean.Meta.mkEq a b = do let aType ← Lean.Meta.inferType a let u ← Lean.Meta.getLevel aType pure (Lean.mkApp3 (Lean.mkConst `Eq [u]) aType a b)

def Lean.Meta.mkHEq (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return HEq a b.

Equations

• Lean.Meta.mkHEq a b = do let aType ← Lean.Meta.inferType a let bType ← Lean.Meta.inferType b let u ← Lean.Meta.getLevel aType pure (Lean.mkApp4 (Lean.mkConst `HEq [u]) aType a bType b)

def Lean.Meta.mkEqHEq (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

If a and b have definitionally equal types, return Eq a b, otherwise return HEq a b.

Equations

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

def Lean.Meta.mkEqRefl (a : Lean.Expr) : Lean.MetaM Lean.Expr

Return a proof of a = a.

Equations

• Lean.Meta.mkEqRefl a = do let aType ← Lean.Meta.inferType a let u ← Lean.Meta.getLevel aType pure (Lean.mkApp2 (Lean.mkConst `Eq.refl [u]) aType a)

def Lean.Meta.mkHEqRefl (a : Lean.Expr) : Lean.MetaM Lean.Expr

Return a proof of HEq a a.

Equations

• Lean.Meta.mkHEqRefl a = do let aType ← Lean.Meta.inferType a let u ← Lean.Meta.getLevel aType pure (Lean.mkApp2 (Lean.mkConst `HEq.refl [u]) aType a)

def Lean.Meta.mkAbsurd (e : Lean.Expr) (hp : Lean.Expr) (hnp : Lean.Expr) : Lean.MetaM Lean.Expr

Given hp : P and nhp : Not P returns an instance of type e.

Equations

• Lean.Meta.mkAbsurd e hp hnp = do let p ← Lean.Meta.inferType hp let u ← Lean.Meta.getLevel e pure (Lean.mkApp4 (Lean.mkConst `absurd [u]) p e hp hnp)

def Lean.Meta.mkFalseElim (e : Lean.Expr) (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : False, return an instance of type e.

Equations

• Lean.Meta.mkFalseElim e h = do let u ← Lean.Meta.getLevel e pure (Lean.mkApp2 (Lean.mkConst `False.elim [u]) e h)

def Lean.Meta.mkEqSymm (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : a = b, returns a proof of b = a.

Equations

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

def Lean.Meta.mkEqTrans (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Given h₁ : a = b and h₂ : b = c returns a proof of a = c.

Equations

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

def Lean.Meta.mkEqTrans? (h₁? : Option Lean.Expr) (h₂? : Option Lean.Expr) : Lean.MetaM (Option Lean.Expr)

Similar to mkEqTrans, but arguments can be none. none is treated as a reflexivity proof.

Equations

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

def Lean.Meta.mkHEqSymm (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : HEq a b, returns a proof of HEq b a.

Equations

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

def Lean.Meta.mkHEqTrans (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Given h₁ : HEq a b, h₂ : HEq b c, returns a proof of HEq a c.

Equations

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

def Lean.Meta.mkEqOfHEq (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : HEq a b where a and b have the same type, returns a proof of Eq a b.

Equations

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

def Lean.Meta.isRefl? (e : Lean.Expr) : Option Lean.Expr

If e is @Eq.refl α a, return a.

Equations

• Lean.Meta.isRefl? e = if e.isAppOfArity `Eq.refl 2 = true then some e.appArg! else none

def Lean.Meta.congrArg? (e : Lean.Expr) : Lean.MetaM (Option (Lean.Expr × Lean.Expr × Lean.Expr))

If e is @congrArg α β a b f h, return α, f and h. Also works if e can be turned into such an application (e.g. congrFun).

Equations

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

partial def Lean.Meta.mkCongrArg (f : Lean.Expr) (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given f : α → β and h : a = b, returns a proof of f a = f b.

def Lean.Meta.mkCongrFun (h : Lean.Expr) (a : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : f = g and a : α, returns a proof of f a = g a.

Equations

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

def Lean.Meta.mkCongr (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Given h₁ : f = g and h₂ : a = b, returns a proof of f a = g b.

Equations

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

def Lean.Meta.mkAppM (constName : Lake.Name) (xs : Array Lean.Expr) : Lean.MetaM Lean.Expr

Return the application constName xs. It tries to fill the implicit arguments before the last element in xs.

Remark: mkAppM `arbitrary #[α] returns @arbitrary.{u} α without synthesizing the implicit argument occurring after α. Given a x : ([Decidable p] → Bool) × Nat, mkAppM `Prod.fst #[x] returns @Prod.fst ([Decidable p] → Bool) Nat x.

Equations

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

def Lean.Meta.mkAppM' (f : Lean.Expr) (xs : Array Lean.Expr) : Lean.MetaM Lean.Expr

Similar to mkAppM, but takes an Expr instead of a constant name.

Equations

• Lean.Meta.mkAppM' f xs = do let fType ← Lean.Meta.inferType f Lean.Meta.withAppBuilderTrace f xs (Lean.Meta.withNewMCtxDepth (Lean.Meta.mkAppMArgs f fType xs))

def Lean.Meta.mkAppOptM (constName : Lake.Name) (xs : Array (Option Lean.Expr)) : Lean.MetaM Lean.Expr

Similar to mkAppM, but it allows us to specify which arguments are provided explicitly using Option type. Example: Given Pure.pure {m : Type u → Type v} [Pure m] {α : Type u} (a : α) : m α,

mkAppOptM `Pure.pure #[m, none, none, a]

returns a Pure.pure application if the instance Pure m can be synthesized, and the universe match. Note that,

mkAppM `Pure.pure #[a]

fails because the only explicit argument (a : α) is not sufficient for inferring the remaining arguments, we would need the expected type.

Equations

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

def Lean.Meta.mkAppOptM' (f : Lean.Expr) (xs : Array (Option Lean.Expr)) : Lean.MetaM Lean.Expr

Similar to mkAppOptM, but takes an Expr instead of a constant name.

Equations

• Lean.Meta.mkAppOptM' f xs = do let fType ← Lean.Meta.inferType f Lean.Meta.withAppBuilderTrace f xs (Lean.Meta.withNewMCtxDepth (Lean.Meta.mkAppOptMAux f xs 0 #[] 0 #[] fType))

def Lean.Meta.mkEqNDRec (motive : Lean.Expr) (h1 : Lean.Expr) (h2 : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

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

def Lean.Meta.mkEqRec (motive : Lean.Expr) (h1 : Lean.Expr) (h2 : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

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

def Lean.Meta.mkEqMP (eqProof : Lean.Expr) (pr : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkEqMP eqProof pr = Lean.Meta.mkAppM `Eq.mp #[eqProof, pr]

def Lean.Meta.mkEqMPR (eqProof : Lean.Expr) (pr : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkEqMPR eqProof pr = Lean.Meta.mkAppM `Eq.mpr #[eqProof, pr]

def Lean.Meta.mkNoConfusion (target : Lean.Expr) (h : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

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

def Lean.Meta.mkPure (monad : Lean.Expr) (e : Lean.Expr) : Lean.MetaM Lean.Expr

Given a monad and e : α, makes pure e.

Equations

• Lean.Meta.mkPure monad e = Lean.Meta.mkAppOptM `Pure.pure #[some monad, none, none, some e]

partial def Lean.Meta.mkProjection (s : Lean.Expr) (fieldName : Lake.Name) : Lean.MetaM Lean.Expr

mkProjection s fieldName returns an expression for accessing field fieldName of the structure s. Remark: fieldName may be a subfield of s.

def Lean.Meta.mkListLit (type : Lean.Expr) (xs : List Lean.Expr) : Lean.MetaM Lean.Expr

Equations

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

def Lean.Meta.mkArrayLit (type : Lean.Expr) (xs : List Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkArrayLit type xs = do let u ← Lean.Meta.getDecLevel type let listLit ← Lean.Meta.mkListLit type xs pure (Lean.mkApp (Lean.mkApp (Lean.mkConst `List.toArray [u]) type) listLit)

def Lean.Meta.mkSorry (type : Lean.Expr) (synthetic : Bool) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkSorry type synthetic = do let u ← Lean.Meta.getLevel type pure (Lean.mkApp2 (Lean.mkConst `sorryAx [u]) type (Lean.toExpr synthetic))

def Lean.Meta.mkDecide (p : Lean.Expr) : Lean.MetaM Lean.Expr

Return Decidable.decide p

Equations

• Lean.Meta.mkDecide p = Lean.Meta.mkAppOptM `Decidable.decide #[some p, none]

def Lean.Meta.mkDecideProof (p : Lean.Expr) : Lean.MetaM Lean.Expr

Return a proof for p : Prop using decide p

Equations

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

def Lean.Meta.mkLt (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a < b

Equations

• Lean.Meta.mkLt a b = Lean.Meta.mkAppM `LT.lt #[a, b]

def Lean.Meta.mkLe (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a <= b

Equations

• Lean.Meta.mkLe a b = Lean.Meta.mkAppM `LE.le #[a, b]

def Lean.Meta.mkDefault (α : Lean.Expr) : Lean.MetaM Lean.Expr

Return Inhabited.default α

Equations

• Lean.Meta.mkDefault α = Lean.Meta.mkAppOptM `Inhabited.default #[some α, none]

def Lean.Meta.mkOfNonempty (α : Lean.Expr) : Lean.MetaM Lean.Expr

Return @Classical.ofNonempty α _

Equations

• Lean.Meta.mkOfNonempty α = Lean.Meta.mkAppOptM `Classical.ofNonempty #[some α, none]

def Lean.Meta.mkSyntheticSorry (type : Lean.Expr) : Lean.MetaM Lean.Expr

Return sorryAx type

Equations

• Lean.Meta.mkSyntheticSorry type = do let __do_lift ← Lean.Meta.getLevel type pure (Lean.mkApp2 (Lean.mkConst `sorryAx [__do_lift]) type (Lean.mkConst `Bool.true))

def Lean.Meta.mkFunExt (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return funext h

Equations

• Lean.Meta.mkFunExt h = Lean.Meta.mkAppM `funext #[h]

def Lean.Meta.mkPropExt (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return propext h

Equations

• Lean.Meta.mkPropExt h = Lean.Meta.mkAppM `propext #[h]

def Lean.Meta.mkLetCongr (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Return let_congr h₁ h₂

Equations

• Lean.Meta.mkLetCongr h₁ h₂ = Lean.Meta.mkAppM `let_congr #[h₁, h₂]

def Lean.Meta.mkLetValCongr (b : Lean.Expr) (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return let_val_congr b h

Equations

• Lean.Meta.mkLetValCongr b h = Lean.Meta.mkAppM `let_val_congr #[b, h]

def Lean.Meta.mkLetBodyCongr (a : Lean.Expr) (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return let_body_congr a h

Equations

• Lean.Meta.mkLetBodyCongr a h = Lean.Meta.mkAppM `let_body_congr #[a, h]

def Lean.Meta.mkOfEqTrue (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return of_eq_true h

Equations

• Lean.Meta.mkOfEqTrue h = Lean.Meta.mkAppM `of_eq_true #[h]

def Lean.Meta.mkEqTrue (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return eq_true h

Equations

• Lean.Meta.mkEqTrue h = Lean.Meta.mkAppM `eq_true #[h]

def Lean.Meta.mkEqFalse (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return eq_false h h must have type definitionally equal to ¬ p in the current reducibility setting.

Equations

• Lean.Meta.mkEqFalse h = Lean.Meta.mkAppM `eq_false #[h]

def Lean.Meta.mkEqFalse' (h : Lean.Expr) : Lean.MetaM Lean.Expr

Return eq_false' h h must have type definitionally equal to p → False in the current reducibility setting.

Equations

• Lean.Meta.mkEqFalse' h = Lean.Meta.mkAppM `eq_false' #[h]

def Lean.Meta.mkImpCongr (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkImpCongr h₁ h₂ = Lean.Meta.mkAppM `implies_congr #[h₁, h₂]

def Lean.Meta.mkImpCongrCtx (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkImpCongrCtx h₁ h₂ = Lean.Meta.mkAppM `implies_congr_ctx #[h₁, h₂]

def Lean.Meta.mkImpDepCongrCtx (h₁ : Lean.Expr) (h₂ : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkImpDepCongrCtx h₁ h₂ = Lean.Meta.mkAppM `implies_dep_congr_ctx #[h₁, h₂]

def Lean.Meta.mkForallCongr (h : Lean.Expr) : Lean.MetaM Lean.Expr

Equations

• Lean.Meta.mkForallCongr h = Lean.Meta.mkAppM `forall_congr #[h]

def Lean.Meta.isMonad? (m : Lean.Expr) : Lean.MetaM (Option Lean.Expr)

Return instance for [Monad m] if there is one

Equations

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

def Lean.Meta.mkNumeral (type : Lean.Expr) (n : Nat) : Lean.MetaM Lean.Expr

Return (n : type), a numeric literal of type type. The method fails if we don't have an instance OfNat type n

Equations

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

def Lean.Meta.mkAdd (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a + b using a heterogeneous +. This method assumes a and b have the same type.

Equations

• Lean.Meta.mkAdd a b = Lean.Meta.mkBinaryOp `HAdd `HAdd.hAdd a b

def Lean.Meta.mkSub (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a - b using a heterogeneous -. This method assumes a and b have the same type.

Equations

• Lean.Meta.mkSub a b = Lean.Meta.mkBinaryOp `HSub `HSub.hSub a b

def Lean.Meta.mkMul (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a * b using a heterogeneous *. This method assumes a and b have the same type.

Equations

• Lean.Meta.mkMul a b = Lean.Meta.mkBinaryOp `HMul `HMul.hMul a b

def Lean.Meta.mkLE (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a ≤ b. This method assumes a and b have the same type.

Equations

• Lean.Meta.mkLE a b = Lean.Meta.mkBinaryRel `LE `LE.le a b

def Lean.Meta.mkLT (a : Lean.Expr) (b : Lean.Expr) : Lean.MetaM Lean.Expr

Return a < b. This method assumes a and b have the same type.

Equations

• Lean.Meta.mkLT a b = Lean.Meta.mkBinaryRel `LT `LT.lt a b

def Lean.Meta.mkIffOfEq (h : Lean.Expr) : Lean.MetaM Lean.Expr

Given h : a = b, return a proof for a ↔ b.

Equations

• Lean.Meta.mkIffOfEq h = if h.isAppOfArity `propext 3 = true then pure h.appArg! else Lean.Meta.mkAppM `Iff.of_eq #[h]

def Lean.Meta.mkAndIntroN : Array Lean.Expr → Lean.MetaM Lean.Expr

Given proofs of P₁, …, Pₙ, returns a proof of P₁ ∧ … ∧ Pₙ. If n = 0 returns a proof of True. If n = 1 returns the proof of P₁.

Equations

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

def Lean.Meta.mkProjAndN (n : Nat) (i : Nat) (e : Lean.Expr) : Lean.Expr

Given a proof of P₁ ∧ … ∧ Pᵢ ∧ … ∧ Pₙ, return the proof of Pᵢ

Equations

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