Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ifnot | Structured version Visualization version GIF version |
Description: Negating the first argument swaps the last two arguments of a conditional operator. (Contributed by NM, 21-Jun-2007.) |
Ref | Expression |
---|---|
ifnot | ⊢ if(¬ 𝜑, 𝐴, 𝐵) = if(𝜑, 𝐵, 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | notnot 135 | . . . 4 ⊢ (𝜑 → ¬ ¬ 𝜑) | |
2 | 1 | iffalsed 4047 | . . 3 ⊢ (𝜑 → if(¬ 𝜑, 𝐴, 𝐵) = 𝐵) |
3 | iftrue 4042 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐵, 𝐴) = 𝐵) | |
4 | 2, 3 | eqtr4d 2647 | . 2 ⊢ (𝜑 → if(¬ 𝜑, 𝐴, 𝐵) = if(𝜑, 𝐵, 𝐴)) |
5 | iftrue 4042 | . . 3 ⊢ (¬ 𝜑 → if(¬ 𝜑, 𝐴, 𝐵) = 𝐴) | |
6 | iffalse 4045 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐵, 𝐴) = 𝐴) | |
7 | 5, 6 | eqtr4d 2647 | . 2 ⊢ (¬ 𝜑 → if(¬ 𝜑, 𝐴, 𝐵) = if(𝜑, 𝐵, 𝐴)) |
8 | 4, 7 | pm2.61i 175 | 1 ⊢ if(¬ 𝜑, 𝐴, 𝐵) = if(𝜑, 𝐵, 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1475 ifcif 4036 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-if 4037 |
This theorem is referenced by: suppsnop 7196 2resupmax 11893 sadadd2lem2 15010 maducoeval2 20265 tmsxpsval2 22154 itg2uba 23316 lgsneg 24846 lgsdilem 24849 sgnneg 29929 bj-xpimasn 32135 itgaddnclem2 32639 ftc1anclem5 32659 |
Copyright terms: Public domain | W3C validator |