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

Theorem festino 2048
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 . . . . 5  |-  A. x
( ph  ->  -.  ps )
32spi 1470 . . . 4  |-  ( ph  ->  -.  ps )
43con2i 590 . . 3  |-  ( ps 
->  -.  ph )
54anim2i 334 . 2  |-  ( ( ch  /\  ps )  ->  ( ch  /\  -.  ph ) )
61, 5eximii 1534 1  |-  E. x
( ch  /\  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> 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-in1 577  ax-in2 578  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