![]() |
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 785 | . 2 ⊢ (DECID 𝜑 → (𝜑 ∨ ¬ 𝜑)) | |
2 | iftrue 3418 | . . . . 5 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
3 | ifsbdc.1 | . . . . 5 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐶 = 𝐷) |
5 | iftrue 3418 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐷) | |
6 | 4, 5 | eqtr4d 2130 | . . 3 ⊢ (𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
7 | iffalse 3421 | . . . . 5 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
8 | ifsbdc.2 | . . . . 5 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) | |
9 | 7, 8 | syl 14 | . . . 4 ⊢ (¬ 𝜑 → 𝐶 = 𝐸) |
10 | iffalse 3421 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐸) | |
11 | 9, 10 | eqtr4d 2130 | . . 3 ⊢ (¬ 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
12 | 6, 11 | jaoi 674 | . 2 ⊢ ((𝜑 ∨ ¬ 𝜑) → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
13 | 1, 12 | syl 14 | 1 ⊢ (DECID 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 667 DECID wdc 783 = wceq 1296 ifcif 3413 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in2 583 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-11 1449 ax-4 1452 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 |
This theorem depends on definitions: df-bi 116 df-dc 784 df-nf 1402 df-sb 1700 df-clab 2082 df-cleq 2088 df-clel 2091 df-if 3414 |
This theorem is referenced by: fvifdc 5362 |
Copyright terms: Public domain | W3C validator |