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

def Duper.mkExistsHoistProof (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.existsHoistAtExpr (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.existsHoist (given : Clause) (c : MClause) (cNum : Nat) : RuleM.RuleM (Array ClauseStream)

Equations

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