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

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

Proof of Theorem cesare
StepHypRef Expression
1 cesare.maj . . . 4
21spi 1775 . . 3
3 cesare.min . . . 4
43spi 1775 . . 3
52, 4nsyl3 114 . 2
65ax-gen 1570 1
Colors of variables: wff set class
Syntax hints:  -.wn 3  ->wi 4  A.wal 1564
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1570  ax-4 1581  ax-5 1644  ax-6 1685  ax-7 1705  ax-12 1768
This theorem depends on definitions:  df-bi 179  df-ex 1566
  Copyright terms: Public domain W3C validator