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

Theorem sylcom 51
Description: Syllogism inference with commutation of antecedents.
Hypotheses
Ref Expression
sylcom.1 |- (ph -> (ps -> ch))
sylcom.2 |- (ps -> (ch -> th))
Assertion
Ref Expression
sylcom |- (ph -> (ps -> th))

Proof of Theorem sylcom
StepHypRef Expression
1 sylcom.1 . . . 4 |- (ph -> (ps -> ch))
21com12 13 . . 3 |- (ps -> (ph -> ch))
3 sylcom.2 . . 3 |- (ps -> (ch -> th))
42, 3syld 27 . 2 |- (ps -> (ph -> th))
54com12 13 1 |- (ph -> (ps -> th))
Colors of variables: wff set class
Syntax hints:   -> wi 2
This theorem is referenced by:  syli 52  abianfp 3000  unblem3 3433  isfinite2 3437  nsmallpq 3877  uzwo 4605  nnwoOLD 4608  chcmh 5148  h1datom 5483  pjjs 5585
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6
metamath.org