Theorem ifeq12da 4518

Description: Equivalence deduction for conditional operators. (Contributed by Wolf Lammen, 24-Jun-2021.)

Hypotheses

Ref	Expression
ifeq12da.1	⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶)
ifeq12da.2	⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐵 = 𝐷)

Assertion

Ref	Expression
ifeq12da	⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))

Proof of Theorem ifeq12da

Step	Hyp	Ref	Expression
1		ifeq12da.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶)
2	1	ifeq1da 4516	. . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐵))
3		iftrue 4490	. . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = 𝐶)
4		iftrue 4490	. . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐶)
5	3, 4	eqtr4d 2801	. . 3 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = if(𝜓, 𝐶, 𝐷))
6	2, 5	sylan9eq 2818	. 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))
7		ifeq12da.2	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐵 = 𝐷)
8	7	ifeq2da 4517	. . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐷))
9		iffalse 4493	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = 𝐷)
10		iffalse 4493	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐷)
11	9, 10	eqtr4d 2801	. . 3 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = if(𝜓, 𝐶, 𝐷))
12	8, 11	sylan9eq 2818	. 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))
13	6, 12	pm2.61dan 825	1 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569  ifcif 4484

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3455  df-un 4153  df-if 4485

This theorem is used by:  ifbieq12d2  4519  psdmvr  22502  copco  25351  pcohtpylem  25352  rpvmasum2  27851  mplmulmvr  34224