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

Theorem darapti 2318
 Description: "Darapti", one of the syllogisms of Aristotelian logic. All is , all is , and some exist, therefore some is . (In Aristotelian notation, AAI-3: MaP and MaS therefore SiP.) For example, "All squares are rectangles" and "All squares are rhombuses", therefore "Some rhombuses are rectangles". (Contributed by David A. Wheeler, 28-Aug-2016.)
Hypotheses
Ref Expression
darapti.maj
darapti.min
darapti.e
Assertion
Ref Expression
darapti

Proof of Theorem darapti
StepHypRef Expression
1 darapti.e . 2
2 darapti.min . . . . 5
32spi 1753 . . . 4
4 darapti.maj . . . . 5
54spi 1753 . . . 4
63, 5jca 518 . . 3
76eximi 1576 . 2
81, 7ax-mp 8 1
 Colors of variables: wff setvar class Syntax hints:   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