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

Theorem darii 2353
Description: "Darii", one of the syllogisms of Aristotelian logic. All  ph is  ps, and some  ch is  ph, therefore some  ch is  ps. (In Aristotelian notation, AII-1: MaP and SiM therefore SiP.) For example, given "All rabbits have fur" and "Some pets are rabbits", therefore "Some pets have fur". Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 24-Aug-2016.)
Hypotheses
Ref Expression
darii.maj  |-  A. x
( ph  ->  ps )
darii.min  |-  E. x
( ch  /\  ph )
Assertion
Ref Expression
darii  |-  E. x
( ch  /\  ps )

Proof of Theorem darii
StepHypRef Expression
1 darii.min . 2  |-  E. x
( ch  /\  ph )
2 darii.maj . . . 4  |-  A. x
( ph  ->  ps )
32spi 1765 . . 3  |-  ( ph  ->  ps )
43anim2i 553 . 2  |-  ( ( ch  /\  ph )  ->  ( ch  /\  ps ) )
51, 4eximii 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:  ferio  2354
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