![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ifsb | Structured version Visualization version GIF version |
Description: Distribute a function over an if-clause. (Contributed by Mario Carneiro, 14-Aug-2013.) |
Ref | Expression |
---|---|
ifsb.1 | ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) |
ifsb.2 | ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
ifsb | ⊢ 𝐶 = if(𝜑, 𝐷, 𝐸) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iftrue 4478 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
2 | ifsb.1 | . . . 4 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) |
4 | iftrue 4478 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐷) | |
5 | 3, 4 | eqtr4d 2779 | . 2 ⊢ (𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
6 | iffalse 4481 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
7 | ifsb.2 | . . . 4 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (¬ 𝜑 → 𝐶 = 𝐸) |
9 | iffalse 4481 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐸) | |
10 | 8, 9 | eqtr4d 2779 | . 2 ⊢ (¬ 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
11 | 5, 10 | pm2.61i 182 | 1 ⊢ 𝐶 = if(𝜑, 𝐷, 𝐸) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ifcif 4472 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ex 1781 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-if 4473 |
This theorem is referenced by: fvif 6835 iffv 6836 ovif 7426 ovif2 7427 ifov 7429 xmulneg1 13096 efrlim 26217 lgsneg 26567 lgsdilem 26570 rpvmasum2 26758 |
Copyright terms: Public domain | W3C validator |