| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ifsbdc | GIF version | ||
| Description: Distribute a function over an if-clause. (Contributed by Jim Kingdon, 1-Jan-2022.) |
| Ref | Expression |
|---|---|
| ifsbdc.1 | ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) |
| ifsbdc.2 | ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) |
| Ref | Expression |
|---|---|
| ifsbdc | ⊢ (DECID 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | exmiddc 838 | . 2 ⊢ (DECID 𝜑 → (𝜑 ∨ ¬ 𝜑)) | |
| 2 | iftrue 3580 | . . . . 5 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 3 | ifsbdc.1 | . . . . 5 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) | |
| 4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐶 = 𝐷) |
| 5 | iftrue 3580 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐷) | |
| 6 | 4, 5 | eqtr4d 2242 | . . 3 ⊢ (𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| 7 | iffalse 3583 | . . . . 5 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 8 | ifsbdc.2 | . . . . 5 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) | |
| 9 | 7, 8 | syl 14 | . . . 4 ⊢ (¬ 𝜑 → 𝐶 = 𝐸) |
| 10 | iffalse 3583 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐸) | |
| 11 | 9, 10 | eqtr4d 2242 | . . 3 ⊢ (¬ 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| 12 | 6, 11 | jaoi 718 | . 2 ⊢ ((𝜑 ∨ ¬ 𝜑) → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| 13 | 1, 12 | syl 14 | 1 ⊢ (DECID 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∨ wo 710 DECID wdc 836 = wceq 1373 ifcif 3575 |
| 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-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-11 1530 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-if 3576 |
| This theorem is referenced by: fvifdc 5611 lgsneg 15576 lgsdilem 15579 |
| Copyright terms: Public domain | W3C validator |