| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifbi | Structured version Visualization version GIF version | ||
| Description: Equivalence theorem for conditional operators. (Contributed by Raph Levien, 15-Jan-2004.) |
| Ref | Expression |
|---|---|
| ifbi | ⊢ ((𝜑 ↔ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfbi3 1065 | . 2 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓))) | |
| 2 | iftrue 4487 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 3 | iftrue 4487 | . . . . 5 ⊢ (𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐴) | |
| 4 | 3 | eqcomd 2766 | . . . 4 ⊢ (𝜓 → 𝐴 = if(𝜓, 𝐴, 𝐵)) |
| 5 | 2, 4 | sylan9eq 2815 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| 6 | iffalse 4490 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 7 | iffalse 4490 | . . . . 5 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐵) | |
| 8 | 7 | eqcomd 2766 | . . . 4 ⊢ (¬ 𝜓 → 𝐵 = if(𝜓, 𝐴, 𝐵)) |
| 9 | 6, 8 | sylan9eq 2815 | . . 3 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| 10 | 5, 9 | jaoi 871 | . 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓)) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| 11 | 1, 10 | sylbi 220 | 1 ⊢ ((𝜑 ↔ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ifcif 4481 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-if 4482 |
| This theorem is used by: ifbid 4505 ifbieq2i 4507 prodeq1i 16052 psdmvr 22451 gsummoncoe1 22587 scmatscm 22789 mulmarep1gsum1 22849 madugsum 22919 matunitlindflem2 22956 mp2pm2mplem4 23088 dchrhash 27561 lgsdi 27624 rpvmasum2 27802 ifnebib 33078 ififcom 33079 itgeq12i 36917 bj-projval 37831 itg2gt0cn 38513 dedths 39939 dfafv2 48124 |
| Copyright terms: Public domain | W3C validator |