Theorem ifeq12da 4563

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 4561	. . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐵))
3		iftrue 4536	. . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = 𝐶)
4		iftrue 4536	. . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐶)
5	3, 4	eqtr4d 2770	. . 3 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = if(𝜓, 𝐶, 𝐷))
6	2, 5	sylan9eq 2787	. 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))
7		ifeq12da.2	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐵 = 𝐷)
8	7	ifeq2da 4562	. . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐷))
9		iffalse 4539	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = 𝐷)
10		iffalse 4539	. . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐷)
11	9, 10	eqtr4d 2770	. . 3 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = if(𝜓, 𝐶, 𝐷))
12	8, 11	sylan9eq 2787	. 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))
13	6, 12	pm2.61dan 811	1 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   = wceq 1533  ifcif 4530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2705  df-cleq 2719  df-clel 2805  df-rab 3429  df-v 3473  df-un 3952  df-if 4531

This theorem is referenced by:  ifbieq12d2  4564  copco  24963  pcohtpylem  24964  rpvmasum2  27463  prjspnfv01  42051

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »