Mathbox for Richard Penner < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ifpxorcor Structured version   Visualization version   GIF version

Theorem ifpxorcor 36840
 Description: Corollary of commutation of biimplication. (Contributed by RP, 25-Apr-2020.)
Assertion
Ref Expression
ifpxorcor (if-(𝜑, ¬ 𝜓, 𝜓) ↔ if-(𝜓, ¬ 𝜑, 𝜑))

Proof of Theorem ifpxorcor
StepHypRef Expression
1 ifpbicor 36839 . 2 (if-(𝜑, ¬ 𝜓, ¬ ¬ 𝜓) ↔ if-(¬ 𝜓, 𝜑, ¬ 𝜑))
2 notnotb 303 . . 3 (𝜓 ↔ ¬ ¬ 𝜓)
3 ifpbi3 36831 . . 3 ((𝜓 ↔ ¬ ¬ 𝜓) → (if-(𝜑, ¬ 𝜓, 𝜓) ↔ if-(𝜑, ¬ 𝜓, ¬ ¬ 𝜓)))
42, 3ax-mp 5 . 2 (if-(𝜑, ¬ 𝜓, 𝜓) ↔ if-(𝜑, ¬ 𝜓, ¬ ¬ 𝜓))
5 ifpn 1016 . 2 (if-(𝜓, ¬ 𝜑, 𝜑) ↔ if-(¬ 𝜓, 𝜑, ¬ 𝜑))
61, 4, 53bitr4i 291 1 (if-(𝜑, ¬ 𝜓, 𝜓) ↔ if-(𝜓, ¬ 𝜑, 𝜑))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 195  if-wif 1006 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ifp 1007  df-tru 1478 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator