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

Theorem anandi 392
Description: Distribution of conjunction over conjunction.
Assertion
Ref Expression
anandi |- ((ph /\ (ps /\ ch)) <-> ((ph /\ ps) /\ (ph /\ ch)))

Proof of Theorem anandi
StepHypRef Expression
1 anidm 331 . . 3 |- ((ph /\ ph) <-> ph)
21anbi1i 368 . 2 |- (((ph /\ ph) /\ (ps /\ ch)) <-> (ph /\ (ps /\ ch)))
3 an4 388 . 2 |- (((ph /\ ph) /\ (ps /\ ch)) <-> ((ph /\ ps) /\ (ph /\ ch)))
42, 3bitr3 153 1 |- ((ph /\ (ps /\ ch)) <-> ((ph /\ ps) /\ (ph /\ ch)))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   /\ wa 196
This theorem is referenced by:  rnlem 579  mopick2 1057  r19.29 1295  uniin 1935  ndmoprdistr 3063  oaord 3149  nnmord 3189  isfinite1 3425  distrlem1pr 3921  addcanpr 3946
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-an 198
metamath.org