Theorem festino 2103

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

Step	Hyp	Ref	Expression
1		festino.min	. 2 |- E. x ( ch /\ ps )
2		festino.maj	. . . . 5 |- A. x ( ph -> -. ps )
3	2	spi 1516	. . . 4 |- ( ph -> -. ps )
4	3	con2i 616	. . 3 |- ( ps -> -. ph )
5	4	anim2i 339	. 2 |- ( ( ch /\ ps ) -> ( ch /\ -. ph ) )
6	1, 5	eximii 1581	1 |- E. x ( ch /\ -. ph )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   A.wal 1329   E.wex 1468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-ial 1514

This theorem depends on definitions:  df-bi 116

This theorem is referenced by: (None)