ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  calemes Structured version   Unicode version

Theorem calemes 2013
Description: "Calemes", one of the syllogisms of Aristotelian logic. All is , and no is , therefore no is . (In Aristotelian notation, AEE-4: PaM and MeS therefore SeP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)
Hypotheses
Ref Expression
calemes.maj
calemes.min
Assertion
Ref Expression
calemes

Proof of Theorem calemes
StepHypRef Expression
1 calemes.min . . . . 5
21spi 1426 . . . 4
32con2i 557 . . 3
4 calemes.maj . . . 4
54spi 1426 . . 3
63, 5nsyl 558 . 2
76ax-gen 1335 1
Colors of variables: wff set class
Syntax hints:   wn 3   wi 4  wal 1240
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-in1 544  ax-in2 545  ax-gen 1335  ax-4 1397
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator