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

Theorem or32 549
Description: A rearrangement of disjuncts. (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
or32 (((𝜑𝜓) ∨ 𝜒) ↔ ((𝜑𝜒) ∨ 𝜓))

Proof of Theorem or32
StepHypRef Expression
1 orass 546 . 2 (((𝜑𝜓) ∨ 𝜒) ↔ (𝜑 ∨ (𝜓𝜒)))
2 or12 545 . 2 ((𝜑 ∨ (𝜓𝜒)) ↔ (𝜓 ∨ (𝜑𝜒)))
3 orcom 402 . 2 ((𝜓 ∨ (𝜑𝜒)) ↔ ((𝜑𝜒) ∨ 𝜓))
41, 2, 33bitri 286 1 (((𝜑𝜓) ∨ 𝜒) ↔ ((𝜑𝜒) ∨ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wo 383
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 197  df-or 385
This theorem is referenced by:  sspsstri  3687  somo  5029  ordtri3OLD  5719  psslinpr  9797  xrnepnf  11896  xrinfmss  12083  tosso  16957  lineunray  31893  or32dd  33525
  Copyright terms: Public domain W3C validator