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

Theorem andir 457
Description: Distributive law for conjunction.
Assertion
Ref Expression
andir |- (((ph \/ ps) /\ ch) <-> ((ph /\ ch) \/ (ps /\ ch)))

Proof of Theorem andir
StepHypRef Expression
1 andi 456 . 2 |- ((ch /\ (ph \/ ps)) <-> ((ch /\ ph) \/ (ch /\ ps)))
2 ancom 333 . 2 |- (((ph \/ ps) /\ ch) <-> (ch /\ (ph \/ ps)))
3 ancom 333 . . 3 |- ((ph /\ ch) <-> (ch /\ ph))
4 ancom 333 . . 3 |- ((ps /\ ch) <-> (ch /\ ps))
53, 4orbi12i 216 . 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:  anddi 459  biass 511  caselem 561  iunxun 2035  xpundir 2462  nnmcan 3190
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