| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ifbi | 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 | anbi2 467 | . . . 4 ⊢ ((𝜑 ↔ 𝜓) → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜓))) | |
| 2 | notbi 672 | . . . . 5 ⊢ ((𝜑 ↔ 𝜓) → (¬ 𝜑 ↔ ¬ 𝜓)) | |
| 3 | 2 | anbi2d 464 | . . . 4 ⊢ ((𝜑 ↔ 𝜓) → ((𝑥 ∈ 𝐵 ∧ ¬ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝜓))) |
| 4 | 1, 3 | orbi12d 801 | . . 3 ⊢ ((𝜑 ↔ 𝜓) → (((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜓) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜓)))) |
| 5 | 4 | abbidv 2352 | . 2 ⊢ ((𝜑 ↔ 𝜓) → {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑))} = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜓) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜓))}) |
| 6 | df-if 3620 | . 2 ⊢ if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜑))} | |
| 7 | df-if 3620 | . 2 ⊢ if(𝜓, 𝐴, 𝐵) = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜓) ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝜓))} | |
| 8 | 5, 6, 7 | 3eqtr4g 2290 | 1 ⊢ ((𝜑 ↔ 𝜓) → if(𝜑, 𝐴, 𝐵) = if(𝜓, 𝐴, 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 = wceq 1398 ∈ wcel 2203 {cab 2218 ifcif 3619 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-if 3620 |
| This theorem is referenced by: ifbid 3643 ifbieq2i 3645 ifnebibdc 3667 fodjuomni 7439 fodjumkv 7450 nninfwlpoimlemg 7465 1tonninf 10799 lgsdi 15897 nninfsellemqall 16780 nninfomni 16784 |
| Copyright terms: Public domain | W3C validator |