Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ifcomnan Structured version   Visualization version   GIF version

Theorem ifcomnan 4281
 Description: Commute the conditions in two nested conditionals if both conditions are not simultaneously true. (Contributed by SO, 15-Jul-2018.)
Assertion
Ref Expression
ifcomnan (¬ (𝜑𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)))

Proof of Theorem ifcomnan
StepHypRef Expression
1 pm3.13 523 . 2 (¬ (𝜑𝜓) → (¬ 𝜑 ∨ ¬ 𝜓))
2 iffalse 4239 . . . 4 𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, 𝐶))
3 iffalse 4239 . . . . 5 𝜑 → if(𝜑, 𝐴, 𝐶) = 𝐶)
43ifeq2d 4249 . . . 4 𝜑 → if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)) = if(𝜓, 𝐵, 𝐶))
52, 4eqtr4d 2797 . . 3 𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)))
6 iffalse 4239 . . . . 5 𝜓 → if(𝜓, 𝐵, 𝐶) = 𝐶)
76ifeq2d 4249 . . . 4 𝜓 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜑, 𝐴, 𝐶))
8 iffalse 4239 . . . 4 𝜓 → if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)) = if(𝜑, 𝐴, 𝐶))
97, 8eqtr4d 2797 . . 3 𝜓 → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)))
105, 9jaoi 393 . 2 ((¬ 𝜑 ∨ ¬ 𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)))
111, 10syl 17 1 (¬ (𝜑𝜓) → if(𝜑, 𝐴, if(𝜓, 𝐵, 𝐶)) = if(𝜓, 𝐵, if(𝜑, 𝐴, 𝐶)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 382   ∧ wa 383   = wceq 1632  ifcif 4230 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-rab 3059  df-v 3342  df-un 3720  df-if 4231 This theorem is referenced by:  mdetunilem6  20645
 Copyright terms: Public domain W3C validator