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

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

Proof of Theorem anandir
StepHypRef Expression
1 anidm 331 . . 3 |- ((ch /\ ch) <-> ch)
21anbi2i 367 . 2 |- (((ph /\ ps) /\ (ch /\ ch)) <-> ((ph /\ ps) /\ ch))
3 an4 388 . 2 |- (((ph /\ ps) /\ (ch /\ ch)) <-> ((ph /\ ch) /\ (ps /\ ch)))
42, 3bitr3 153 1 |- (((ph /\ ps) /\ ch) <-> ((ph /\ ch) /\ (ps /\ ch)))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   /\ wa 196
This theorem is referenced by:  rnlem 579  fununi 2705  imadif 2714  axrecex 4079  nnleltp1t 4448  5oalem3 5546  5oalem5 5548
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