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

Theorem cesare 2569
Description: "Cesare", one of the syllogisms of Aristotelian logic. No  ph is  ps, and all  ch is  ps, therefore no  ch is  ph. (In Aristotelian notation, EAE-2: PeM and SaM therefore SeP.) Related to celarent 2564. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 13-Nov-2016.)
Hypotheses
Ref Expression
cesare.maj  |-  A. x
( ph  ->  -.  ps )
cesare.min  |-  A. x
( ch  ->  ps )
Assertion
Ref Expression
cesare  |-  A. x
( ch  ->  -.  ph )

Proof of Theorem cesare
StepHypRef Expression
1 cesare.maj . . . 4  |-  A. x
( ph  ->  -.  ps )
21spi 2054 . . 3  |-  ( ph  ->  -.  ps )
3 cesare.min . . . 4  |-  A. x
( ch  ->  ps )
43spi 2054 . . 3  |-  ( ch 
->  ps )
52, 4nsyl3 133 . 2  |-  ( ch 
->  -.  ph )
65ax-gen 1722 1  |-  A. x
( ch  ->  -.  ph )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-12 2047
This theorem depends on definitions:  df-bi 197  df-ex 1705
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator