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

Theorem nsyl2 103
Description: A negated syllogism inference.
Hypotheses
Ref Expression
nsyl2.1 |- (ph -> -. ps)
nsyl2.2 |- (-. ch -> ps)
Assertion
Ref Expression
nsyl2 |- (ph -> ch)

Proof of Theorem nsyl2
StepHypRef Expression
1 nsyl2.1 . 2 |- (ph -> -. ps)
2 nsyl2.2 . . 3 |- (-. ch -> ps)
32con1i 88 . 2 |- (-. ps -> ch)
41, 3syl 12 1 |- (ph -> ch)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  tfi 2244  peano5 2394  setind 3492  rankel 3524  r1pwcl 3530  alephnbtwn 3674
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org