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

Theorem ordi 607
Description: Distributive law for disjunction. Theorem *4.41 of [WhiteheadRussell] p. 119.
Assertion
Ref Expression
ordi |- ((ph \/ (ps /\ ch)) <-> ((ph \/ ps) /\ (ph \/ ch)))

Proof of Theorem ordi
StepHypRef Expression
1 pm3.26 326 . . . 4 |- ((ps /\ ch) -> ps)
21orim2i 345 . . 3 |- ((ph \/ (ps /\ ch)) -> (ph \/ ps))
3 pm3.27 330 . . . 4 |- ((ps /\ ch) -> ch)
43orim2i 345 . . 3 |- ((ph \/ (ps /\ ch)) -> (ph \/ ch))
52, 4jca 295 . 2 |- ((ph \/ (ps /\ ch)) -> ((ph \/ ps) /\ (ph \/ ch)))
6 df-or 231 . . . 4 |- ((ph \/ ps) <-> (-. ph -> ps))
7 pm3.43i 294 . . . . 5 |- ((-. ph -> ps) -> ((-. ph -> ch) -> (-. ph -> (ps /\ ch))))
8 df-or 231 . . . . 5 |- ((ph \/ ch) <-> (-. ph -> ch))
9 df-or 231 . . . . 5 |- ((ph \/ (ps /\ ch)) <-> (-. ph -> (ps /\ ch)))
107, 8, 93imtr4g 564 . . . 4 |- ((-. ph -> ps) -> ((ph \/ ch) -> (ph \/ (ps /\ ch))))
116, 10sylbi 206 . . 3 |- ((ph \/ ps) -> ((ph \/ ch) -> (ph \/ (ps /\ ch))))
1211imp 357 . 2 |- (((ph \/ ps) /\ (ph \/ ch)) -> (ph \/ (ps /\ ch)))
135, 12impbii 164 1 |- ((ph \/ (ps /\ ch)) <-> ((ph \/ ps) /\ (ph \/ ch)))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 153   \/ wo 229   /\ wa 230
This theorem is referenced by:  ordir 608  jcab 609  andi 615  orddi 617  orbidi 755  undi 2303  undif4 2377
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 154  df-or 231  df-an 232
Copyright terms: Public domain