theorem Duper.forall_hoist_proof {α : Sort u_1} {y : α → Prop} (x : α) (f : Prop → Prop) (h : f (∀ (z : α), y z)) : f False ∨ y x = True

def Duper.mkForallHoistProof (pos : ClausePos) (premises : List Lean.Expr) (parents : List RuleM.ProofParent) (transferExprs : Array Lean.Expr) (c : Clause) : Lean.MetaM Lean.Expr

Equations

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

def Duper.mkForallAndLambda (freshVar1Ty : Lean.Expr) : Lean.MetaM (Lean.Expr × Lean.Expr)

Returns the dependent forall and lambda expressions

Equations

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

def Duper.forallHoistAtExpr (e : Lean.Expr) (pos : ClausePos) (given : Clause) (c : MClause) : RuleM.RuleM (Array ClauseStream)

Equations

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

def Duper.forallHoist (given : Clause) (c : MClause) (cNum : Nat) : RuleM.RuleM (Array ClauseStream)

Equations

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