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

Theorem festino 2261
Description: "Festino", one of the syllogisms of Aristotelian logic. No  ph is  ps, and some  ch is  ps, therefore some  ch is not  ph. (In Aristotelian notation, EIO-2: PeM and SiM therefore SoP.) (Contributed by David A. Wheeler, 25-Nov-2016.)
Hypotheses
Ref Expression
festino.maj  |-  A. x
( ph  ->  -.  ps )
festino.min  |-  E. x
( ch  /\  ps )
Assertion
Ref Expression
festino  |-  E. x
( ch  /\  -.  ph )

Proof of Theorem festino
StepHypRef Expression
1 festino.min . 2  |-  E. x
( ch  /\  ps )
2 festino.maj . . . . . 6  |-  A. x
( ph  ->  -.  ps )
32spi 1750 . . . . 5  |-  ( ph  ->  -.  ps )
43con2i 112 . . . 4  |-  ( ps 
->  -.  ph )
54anim2i 552 . . 3  |-  ( ( ch  /\  ps )  ->  ( ch  /\  -.  ph ) )
65eximi 1566 . 2  |-  ( E. x ( ch  /\  ps )  ->  E. x
( ch  /\  -.  ph ) )
71, 6ax-mp 8 1  |-  E. x
( ch  /\  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358   A.wal 1530   E.wex 1531
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-11 1727
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1532
  Copyright terms: Public domain W3C validator