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

Theorem darapti 2057
Description: "Darapti", one of the syllogisms of Aristotelian logic. All  ph is  ps, all  ph is  ch, and some  ph exist, therefore some  ch is  ps. (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  |-  A. x
( ph  ->  ps )
darapti.min  |-  A. x
( ph  ->  ch )
darapti.e  |-  E. x ph
Assertion
Ref Expression
darapti  |-  E. x
( ch  /\  ps )

Proof of Theorem darapti
StepHypRef Expression
1 darapti.e . 2  |-  E. x ph
2 darapti.min . . . 4  |-  A. x
( ph  ->  ch )
32spi 1470 . . 3  |-  ( ph  ->  ch )
4 darapti.maj . . . 4  |-  A. x
( ph  ->  ps )
54spi 1470 . . 3  |-  ( ph  ->  ps )
63, 5jca 300 . 2  |-  ( ph  ->  ( ch  /\  ps ) )
71, 6eximii 1534 1  |-  E. x
( ch  /\  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102   A.wal 1283   E.wex 1422
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1377  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-4 1441  ax-ial 1468
This theorem depends on definitions:  df-bi 115
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator