Theorem: Smt.Reconstruct.Prop.cnfImpliesNeg1 (Smt/Reconstruct/Prop/Lemmas.lean)

State before:
⊢ ∀ {p q : Prop}, (p → q) ∨ p
Tactic:
intros p q
State after:
p q : Prop
⊢ (p → q) ∨ p

State before:
p q : Prop
⊢ (p → q) ∨ p
Tactic:
apply orComm
State after:
case a
p q : Prop
⊢ p ∨ (p → q)

State before:
case a
p q : Prop
⊢ p ∨ (p → q)
Tactic:
apply orImplies
State after:
case a.a
p q : Prop
⊢ ¬p → p → q

State before:
case a.a
p q : Prop
⊢ ¬p → p → q
Tactic:
exact flip absurd
State after:
no goals