| 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 1064 | . 2 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓))) | |
| 2 | iftrue 4492 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 3 | iftrue 4492 | . . . . 5 ⊢ (𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐴) | |
| 4 | 3 | eqcomd 2768 | . . . 4 ⊢ (𝜓 → 𝐴 = if(𝜓, 𝐴, 𝐵)) |
| 5 | 2, 4 | sylan9eq 2817 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| 6 | iffalse 4495 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 7 | iffalse 4495 | . . . . 5 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐵) | |
| 8 | 7 | eqcomd 2768 | . . . 4 ⊢ (¬ 𝜓 → 𝐵 = if(𝜓, 𝐴, 𝐵)) |
| 9 | 6, 8 | sylan9eq 2817 | . . 3 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| 10 | 5, 9 | jaoi 870 | . 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 400 ∨ wo 860 = wceq 1569 ifcif 4486 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-if 4487 |
| This theorem is used by: ifbid 4510 ifbieq2i 4512 prodeq1i 15977 psdmvr 22343 gsummoncoe1 22479 scmatscm 22681 mulmarep1gsum1 22741 madugsum 22811 mp2pm2mplem4 22977 dchrhash 27446 lgsdi 27509 rpvmasum2 27687 ifnebib 32906 ififcom 32907 itgeq12i 36746 bj-projval 37660 matunitlindflem2 38296 itg2gt0cn 38354 dedths 39764 dfafv2 47897 |
| Copyright terms: Public domain | W3C validator |