HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem or12 217
Description: A rearrangement of disjuncts.
Assertion
Ref Expression
or12 |- ((ph \/ (ps \/ ch)) <-> (ps \/ (ph \/ ch)))

Proof of Theorem or12
StepHypRef Expression
1 bi2.04 141 . . 3 |- ((-. ps -> (-. ph -> ch)) <-> (-. ph -> (-. ps -> ch)))
2 df-or 197 . . . 4 |- ((ph \/ ch) <-> (-. ph -> ch))
32imbi2i 160 . . 3 |- ((-. ps -> (ph \/ ch)) <-> (-. ps -> (-. ph -> ch)))
4 df-or 197 . . . 4 |- ((ps \/ ch) <-> (-. ps -> ch))
54imbi2i 160 . . 3 |- ((-. ph -> (ps \/ ch)) <-> (-. ph -> (-. ps -> ch)))
61, 3, 53bitr4r 159 . 2 |- ((-. ph -> (ps \/ ch)) <-> (-. ps -> (ph \/ ch)))
7 df-or 197 . 2 |- ((ph \/ (ps \/ ch)) <-> (-. ph -> (ps \/ ch)))
8 df-or 197 . 2 |- ((ps \/ (ph \/ ch)) <-> (-. ps -> (ph \/ ch)))
96, 7, 83bitr4 158 1 |- ((ph \/ (ps \/ ch)) <-> (ps \/ (ph \/ ch)))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   \/ wo 195
This theorem is referenced by:  orass 218  or4 220  ordzsl 2366  posex 4422
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-or 197
metamath.org