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

Theorem orbi1r 1282
Description: orbi1 682 with order of disjuncts reversed. Derived from orbi1rVD 16672. (Contributed by Alan Sare, 31-Dec-2011.)
Assertion
Ref Expression
orbi1r |- ((ph <-> ps) -> ((ch \/ ph) <-> (ch \/ ps)))

Proof of Theorem orbi1r
StepHypRef Expression
1 orbi1 682 . . . 4 |- ((ph <-> ps) -> ((ph \/ ch) <-> (ps \/ ch)))
2 pm1.4 267 . . . 4 |- ((ch \/ ph) -> (ph \/ ch))
31, 2syl5bi 225 . . 3 |- ((ph <-> ps) -> ((ch \/ ph) -> (ps \/ ch)))
4 pm1.4 267 . . 3 |- ((ps \/ ch) -> (ch \/ ps))
53, 4syl6 25 . 2 |- ((ph <-> ps) -> ((ch \/ ph) -> (ch \/ ps)))
6 pm1.4 267 . . . 4 |- ((ch \/ ps) -> (ps \/ ch))
71, 6syl5bir 227 . . 3 |- ((ph <-> ps) -> ((ch \/ ps) -> (ph \/ ch)))
8 pm1.4 267 . . 3 |- ((ph \/ ch) -> (ch \/ ph))
97, 8syl6 25 . 2 |- ((ph <-> ps) -> ((ch \/ ps) -> (ch \/ ph)))
105, 9impbid 574 1 |- ((ph <-> ps) -> ((ch \/ ph) <-> (ch \/ ps)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   \/ wo 239
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242
Copyright terms: Public domain