Table of ContentsTable of Contents User Sandbox < Previous   Next >
Related theorems
Unicode version

Theorem and4com 10433
Description: /\ associativity.
Assertion
Ref Expression
and4com |- ((ph /\ (ps /\ ch /\ th)) <-> ((ph /\ ps /\ ch) /\ th))

Proof of Theorem and4com
StepHypRef Expression
1 pm3.2 283 . . . 4 |- ((ph /\ ps /\ ch) -> (th -> ((ph /\ ps /\ ch) /\ th)))
213exp 832 . . 3 |- (ph -> (ps -> (ch -> (th -> ((ph /\ ps /\ ch) /\ th)))))
323imp2 848 . 2 |- ((ph /\ (ps /\ ch /\ th)) -> ((ph /\ ps /\ ch) /\ th))
4 pm3.2 283 . . . 4 |- (ph -> ((ps /\ ch /\ th) -> (ph /\ (ps /\ ch /\ th))))
543expd 850 . . 3 |- (ph -> (ps -> (ch -> (th -> (ph /\ (ps /\ ch /\ th))))))
653imp1 846 . 2 |- (((ph /\ ps /\ ch) /\ th) -> (ph /\ (ps /\ ch /\ th)))
73, 6impbi 157 1 |- ((ph /\ (ps /\ ch /\ th)) <-> ((ph /\ ps /\ ch) /\ th))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   /\ w3a 775
This theorem is referenced by:  eeeeanv 10436
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 147  df-an 225  df-3an 777
Copyright terms: Public domain