Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ifeq12da | Structured version Visualization version GIF version |
Description: Equivalence deduction for conditional operators. (Contributed by Wolf Lammen, 24-Jun-2021.) |
Ref | Expression |
---|---|
ifeq12da.1 | ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) |
ifeq12da.2 | ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐵 = 𝐷) |
Ref | Expression |
---|---|
ifeq12da | ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ifeq12da.1 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) | |
2 | 1 | ifeq1da 4487 | . . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐵)) |
3 | iftrue 4462 | . . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = 𝐶) | |
4 | iftrue 4462 | . . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐶) | |
5 | 3, 4 | eqtr4d 2781 | . . 3 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = if(𝜓, 𝐶, 𝐷)) |
6 | 2, 5 | sylan9eq 2799 | . 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷)) |
7 | ifeq12da.2 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐵 = 𝐷) | |
8 | 7 | ifeq2da 4488 | . . 3 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐷)) |
9 | iffalse 4465 | . . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = 𝐷) | |
10 | iffalse 4465 | . . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐶, 𝐷) = 𝐷) | |
11 | 9, 10 | eqtr4d 2781 | . . 3 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐷) = if(𝜓, 𝐶, 𝐷)) |
12 | 8, 11 | sylan9eq 2799 | . 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷)) |
13 | 6, 12 | pm2.61dan 809 | 1 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐵) = if(𝜓, 𝐶, 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ifcif 4456 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-un 3888 df-if 4457 |
This theorem is referenced by: ifbieq12d2 4490 copco 24087 pcohtpylem 24088 rpvmasum2 26565 prjspnfv01 40382 |
Copyright terms: Public domain | W3C validator |