| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifcomnan | Structured version Visualization version GIF version | ||
| Description: Commute the conditions in two nested conditionals if both conditions are not simultaneously true. (Contributed by SO, 15-Jul-2018.) |
| Ref | Expression |
|---|---|
| ifcomnan | ⊢ (¬ (𝜑 ∧ 𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm3.13 1010 | . 2 ⊢ (¬ (𝜑 ∧ 𝜓) → (¬ 𝜑 ∨ ¬ 𝜓)) | |
| 2 | iffalse 4496 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, 𝐶)) | |
| 3 | iffalse 4496 | . . . . 5 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐶) = 𝐶) | |
| 4 | 3 | ifeq2d 4508 | . . . 4 ⊢ (¬ 𝜑 → if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)) = if(𝜓, 𝐵, 𝐶)) |
| 5 | 2, 4 | eqtr4d 2801 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶))) |
| 6 | iffalse 4496 | . . . . 5 ⊢ (¬ 𝜓 → if(𝜓, 𝐵, 𝐶) = 𝐶) | |
| 7 | 6 | ifeq2d 4508 | . . . 4 ⊢ (¬ 𝜓 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜑, 𝐴, 𝐶)) |
| 8 | iffalse 4496 | . . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)) = if(𝜑, 𝐴, 𝐶)) | |
| 9 | 7, 8 | eqtr4d 2801 | . . 3 ⊢ (¬ 𝜓 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶))) |
| 10 | 5, 9 | jaoi 870 | . 2 ⊢ ((¬ 𝜑 ∨ ¬ 𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶))) |
| 11 | 1, 10 | syl 18 | 1 ⊢ (¬ (𝜑 ∧ 𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ifcif 4487 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-un 3910 df-if 4488 |
| This theorem is referenced by: mdetunilem6 22774 |
| Copyright terms: Public domain | W3C validator |