Theorem baroco 2133

Description: "Baroco", one of the syllogisms of Aristotelian logic. All ph is ps, and some ch is not ps, therefore some ch is not ph. (In Aristotelian notation, AOO-2: PaM and SoM therefore SoP.) For example, "All informative things are useful", "Some websites are not useful", therefore "Some websites are not informative." (Contributed by David A. Wheeler, 28-Aug-2016.)

Hypotheses

Ref	Expression
baroco.maj	|- A. x ( ph -> ps )
baroco.min	|- E. x ( ch /\ -. ps )

Assertion

Ref	Expression
baroco	|- E. x ( ch /\ -. ph )

Proof of Theorem baroco

Step	Hyp	Ref	Expression
1		baroco.min	. 2 |- E. x ( ch /\ -. ps )
2		baroco.maj	. . . . 5 |- A. x ( ph -> ps )
3	2	spi 1536	. . . 4 |- ( ph -> ps )
4	3	con3i 632	. . 3 |- ( -. ps -> -. ph )
5	4	anim2i 342	. 2 |- ( ( ch /\ -. ps ) -> ( ch /\ -. ph ) )
6	1, 5	eximii 1602	1 |- E. x ( ch /\ -. ph )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   A.wal 1351   E.wex 1492

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-4 1510  ax-ial 1534

This theorem depends on definitions:  df-bi 117

This theorem is referenced by: (None)