Theorem: Smt.Reconstruct.Builtin.cnfItePos2 (Smt/Reconstruct/Builtin/Lemmas.lean)

State before:
c a b : Prop
h : Decidable c
⊢ (¬if c then a else b) ∨ c ∨ b
Tactic:
apply orImplies
State after:
case a
c a b : Prop
h : Decidable c
⊢ (¬¬if c then a else b) → c ∨ b

State before:
case a
c a b : Prop
h : Decidable c
⊢ (¬¬if c then a else b) → c ∨ b
Tactic:
intro hite
State after:
case a
c a b : Prop
h : Decidable c
hite : ¬¬if c then a else b
⊢ c ∨ b

State before:
case a
c a b : Prop
h : Decidable c
hite : ¬¬if c then a else b
⊢ c ∨ b
Tactic:
have hite' := notNotElim hite
State after:
case a
c a b : Prop
h : Decidable c
hite : ¬¬if c then a else b
hite' : if c then a else b
⊢ c ∨ b

State before:
case a
c a b : Prop
h : Decidable c
hite : ¬¬if c then a else b
hite' : if c then a else b
⊢ c ∨ b
Tactic:
match h with
| isFalse _ => exact Or.inr hite'
| isTrue hc => exact Or.inl hc
State after:
no goals

State before:
c a b : Prop
h : Decidable c
h✝ : ¬c
hite : ¬¬if c then a else b
hite' : if c then a else b
⊢ c ∨ b
Tactic:
exact Or.inr hite'
State after:
no goals

State before:
c a b : Prop
h : Decidable c
hc : c
hite : ¬¬if c then a else b
hite' : if c then a else b
⊢ c ∨ b
Tactic:
exact Or.inl hc
State after:
no goals