New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  calemos Unicode version

Theorem calemos 2322
 Description: "Calemos", one of the syllogisms of Aristotelian logic. All is (PaM), no is (MeS), and exist, therefore some is not (SoP). (In Aristotelian notation, AEO-4: PaM and MeS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)
Hypotheses
Ref Expression
calemos.maj
calemos.min
calemos.e
Assertion
Ref Expression
calemos

Proof of Theorem calemos
StepHypRef Expression
1 calemos.e . 2
2 calemos.min . . . . . . 7
32spi 1753 . . . . . 6
43con2i 112 . . . . 5
5 calemos.maj . . . . . 6
65spi 1753 . . . . 5
74, 6nsyl 113 . . . 4
87ancli 534 . . 3
98eximi 1576 . 2
101, 9ax-mp 8 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wa 358  wal 1540  wex 1541 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-11 1746 This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1542 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator