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

Theorem an1s 372
Description: Deduction rearranging conjuncts.
Hypothesis
Ref Expression
an1s.1 |- ((ph /\ (ps /\ ch)) -> th)
Assertion
Ref Expression
an1s |- ((ps /\ (ph /\ ch)) -> th)

Proof of Theorem an1s
StepHypRef Expression
1 an12 370 . 2 |- ((ps /\ (ph /\ ch)) <-> (ph /\ (ps /\ ch)))
2 an1s.1 . 2 |- ((ph /\ (ps /\ ch)) -> th)
31, 2sylbi 174 1 |- ((ps /\ (ph /\ ch)) -> th)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196
This theorem is referenced by:  oecl 3140  oaass 3163  oen0 3165  ac5b 3574  distrlem4pr 3924  prlem934b 3932  ltexprlem4 3939  uzind2 4604  spansnmul 5469
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