MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  datisi Unicode version

Theorem datisi 2363
Description: "Datisi", one of the syllogisms of Aristotelian logic. All  ph is  ps, and some  ph is  ch, therefore some  ch is  ps. (In Aristotelian notation, AII-3: MaP and MiS therefore SiP.) (Contributed by David A. Wheeler, 28-Aug-2016.)
Hypotheses
Ref Expression
datisi.maj  |-  A. x
( ph  ->  ps )
datisi.min  |-  E. x
( ph  /\  ch )
Assertion
Ref Expression
datisi  |-  E. x
( ch  /\  ps )

Proof of Theorem datisi
StepHypRef Expression
1 datisi.min . 2  |-  E. x
( ph  /\  ch )
2 simpr 448 . . 3  |-  ( (
ph  /\  ch )  ->  ch )
3 datisi.maj . . . . 5  |-  A. x
( ph  ->  ps )
43spi 1765 . . . 4  |-  ( ph  ->  ps )
54adantr 452 . . 3  |-  ( (
ph  /\  ch )  ->  ps )
62, 5jca 519 . 2  |-  ( (
ph  /\  ch )  ->  ( ch  /\  ps ) )
71, 6eximii 1584 1  |-  E. x
( ch  /\  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359   A.wal 1546   E.wex 1547
This theorem is referenced by:  ferison  2365
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-11 1757
This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1548
  Copyright terms: Public domain W3C validator