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 1046 | . 2 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓))) | |
2 | iftrue 4462 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
3 | iftrue 4462 | . . . . 5 ⊢ (𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐴) | |
4 | 3 | eqcomd 2744 | . . . 4 ⊢ (𝜓 → 𝐴 = if(𝜓, 𝐴, 𝐵)) |
5 | 2, 4 | sylan9eq 2799 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
6 | iffalse 4465 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
7 | iffalse 4465 | . . . . 5 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐵) = 𝐵) | |
8 | 7 | eqcomd 2744 | . . . 4 ⊢ (¬ 𝜓 → 𝐵 = if(𝜓, 𝐴, 𝐵)) |
9 | 6, 8 | sylan9eq 2799 | . . 3 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
10 | 5, 9 | jaoi 853 | . 2 ⊢ (((𝜑 ∧ 𝜓) ∨ (¬ 𝜑 ∧ ¬ 𝜓)) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
11 | 1, 10 | sylbi 216 | 1 ⊢ ((𝜑 ↔ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 = 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-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-if 4457 |
This theorem is referenced by: ifbid 4479 ifbieq2i 4481 gsummoncoe1 21385 scmatscm 21570 mulmarep1gsum1 21630 madugsum 21700 mp2pm2mplem4 21866 dchrhash 26324 lgsdi 26387 rpvmasum2 26565 bj-projval 35113 matunitlindflem2 35701 itg2gt0cn 35759 dedths 36903 dfafv2 44511 |
Copyright terms: Public domain | W3C validator |