MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  com35 Structured version   Unicode version

Theorem com35 90
Description: Commutation of antecedents. Swap 3rd and 5th. (Contributed by Jeff Hankins, 28-Jun-2009.)
Hypothesis
Ref Expression
com5.1  |-  ( ph  ->  ( ps  ->  ( ch  ->  ( th  ->  ( ta  ->  et )
) ) ) )
Assertion
Ref Expression
com35  |-  ( ph  ->  ( ps  ->  ( ta  ->  ( th  ->  ( ch  ->  et )
) ) ) )

Proof of Theorem com35
StepHypRef Expression
1 com5.1 . . . 4  |-  ( ph  ->  ( ps  ->  ( ch  ->  ( th  ->  ( ta  ->  et )
) ) ) )
21com34 83 . . 3  |-  ( ph  ->  ( ps  ->  ( th  ->  ( ch  ->  ( ta  ->  et )
) ) ) )
32com45 89 . 2  |-  ( ph  ->  ( ps  ->  ( th  ->  ( ta  ->  ( ch  ->  et )
) ) ) )
43com34 83 1  |-  ( ph  ->  ( ps  ->  ( ta  ->  ( th  ->  ( ch  ->  et )
) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7
This theorem is referenced by:  swrdswrdlem  12665  bcthlem5  21744  3v3e3cycl1  24620  4cycl4v4e  24642  4cycl4dv4e  24644  nocvxminlem  29425  ad5ant125  32977
  Copyright terms: Public domain W3C validator