Theorem elimif 4526

Description: Elimination of a conditional operator contained in a wff 𝜓. (Contributed by NM, 15-Feb-2005.) (Proof shortened by NM, 25-Apr-2019.)

Hypotheses

Ref	Expression
elimif.1	⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → (𝜓 ↔ 𝜒))
elimif.2	⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → (𝜓 ↔ 𝜃))

Assertion

Ref	Expression
elimif	⊢ (𝜓 ↔ ((𝜑 ∧ 𝜒) ∨ (¬ 𝜑 ∧ 𝜃)))

Proof of Theorem elimif

Step	Hyp	Ref	Expression
1		iftrue 4494	. . 3 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴)
2		elimif.1	. . 3 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → (𝜓 ↔ 𝜒))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
4		iffalse 4497	. . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵)
5		elimif.2	. . 3 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → (𝜓 ↔ 𝜃))
6	4, 5	syl 17	. 2 ⊢ (¬ 𝜑 → (𝜓 ↔ 𝜃))
7	3, 6	cases 1042	1 ⊢ (𝜓 ↔ ((𝜑 ∧ 𝜒) ∨ (¬ 𝜑 ∧ 𝜃)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540  ifcif 4488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-if 4489

This theorem is referenced by:  eqif  4530  elif  4532  ifel  4533  ftc1anclem5  37691  clsk1indlem2  44031