| 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 4492 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 2 | ifsb.1 | . . . 4 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐴 → 𝐶 = 𝐷) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) |
| 4 | iftrue 4492 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐷) | |
| 5 | 3, 4 | eqtr4d 2800 | . 2 ⊢ (𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| 6 | iffalse 4495 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 7 | ifsb.2 | . . . 4 ⊢ (if(𝜑, 𝐴, 𝐵) = 𝐵 → 𝐶 = 𝐸) | |
| 8 | 6, 7 | syl 18 | . . 3 ⊢ (¬ 𝜑 → 𝐶 = 𝐸) |
| 9 | iffalse 4495 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐷, 𝐸) = 𝐸) | |
| 10 | 8, 9 | eqtr4d 2800 | . 2 ⊢ (¬ 𝜑 → 𝐶 = if(𝜑, 𝐷, 𝐸)) |
| 11 | 5, 10 | pm2.61i 184 | 1 ⊢ 𝐶 = if(𝜑, 𝐷, 𝐸) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1569 ifcif 4486 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-if 4487 |
| This theorem is used by: fvif 6897 iffv 6898 ovif 7510 ovif2 7511 ifov 7513 xmulneg1 13301 efrlim 27145 lgsneg 27496 lgsdilem 27499 rpvmasum2 27687 |
| Copyright terms: Public domain | W3C validator |