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

Theorem ordir 453
Description: Distributive law for disjunction.
Assertion
Ref Expression
ordir |- (((ph /\ ps) \/ ch) <-> ((ph \/ ch) /\ (ps \/ ch)))

Proof of Theorem ordir
StepHypRef Expression
1 ordi 452 . 2 |- ((ch \/ (ph /\ ps)) <-> ((ch \/ ph) /\ (ch \/ ps)))
2 orcom 209 . 2 |- (((ph /\ ps) \/ ch) <-> (ch \/ (ph /\ ps)))
3 orcom 209 . . 3 |- ((ph \/ ch) <-> (ch \/ ph))
4 orcom 209 . . 3 |- ((ps \/ ch) <-> (ch \/ ps))
53, 4anbi12i 369 . 2 |- (((ph \/ ch) /\ (ps \/ ch)) <-> ((ch \/ ph) /\ (ch \/ ps)))
61, 2, 53bitr4 158 1 |- (((ph /\ ps) \/ ch) <-> ((ph \/ ch) /\ (ps \/ ch)))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   \/ wo 195   /\ wa 196
This theorem is referenced by:  orddi 458  mapdom2 3389  elnn0z 4574
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  df-an 198
metamath.org