| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ifeq2dadc | GIF version | ||
| Description: Conditional equality. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| ifeq2da.1 | ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐴 = 𝐵) |
| ifeq2dadc.dc | ⊢ (𝜑 → DECID 𝜓) |
| Ref | Expression |
|---|---|
| ifeq2dadc | ⊢ (𝜑 → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝜓) | |
| 2 | 1 | iftrued 3582 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐶, 𝐴) = 𝐶) |
| 3 | 1 | iftrued 3582 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐶, 𝐵) = 𝐶) |
| 4 | 2, 3 | eqtr4d 2242 | . 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| 5 | ifeq2da.1 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐴 = 𝐵) | |
| 6 | 5 | ifeq2d 3594 | . 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| 7 | ifeq2dadc.dc | . . 3 ⊢ (𝜑 → DECID 𝜓) | |
| 8 | exmiddc 838 | . . 3 ⊢ (DECID 𝜓 → (𝜓 ∨ ¬ 𝜓)) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → (𝜓 ∨ ¬ 𝜓)) |
| 10 | 4, 6, 9 | mpjaodan 800 | 1 ⊢ (𝜑 → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ 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-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 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-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-rab 2494 df-v 2775 df-un 3174 df-if 3576 |
| This theorem is referenced by: subgmulg 13599 |
| Copyright terms: Public domain | W3C validator |