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

Theorem celaront 2306
Description: "Celaront", one of the syllogisms of Aristotelian logic. No is , all is , and some exist, therefore some is not . (In Aristotelian notation, EAO-1: MeP and SaM therefore SoP.) For example, given "No reptiles have fur", "All snakes are reptiles.", and "Snakes exist.", prove "Some snakes have no fur". Note the existence hypothesis. Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)
Hypotheses
Ref Expression
celaront.maj
celaront.min
celaront.e
Assertion
Ref Expression
celaront

Proof of Theorem celaront
StepHypRef Expression
1 celaront.maj . 2
2 celaront.min . 2
3 celaront.e . 2
41, 2, 3barbari 2305 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-mp 5  ax-1 6  ax-2 7  ax-3 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