Theorem festino 2132

Description: "Festino", one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, and some 𝜒 is 𝜓, therefore some 𝜒 is not 𝜑. (In Aristotelian notation, EIO-2: PeM and SiM therefore SoP.) (Contributed by David A. Wheeler, 25-Nov-2016.)

Hypotheses

Ref	Expression
festino.maj	⊢ ∀𝑥(𝜑 → ¬ 𝜓)
festino.min	⊢ ∃𝑥(𝜒 ∧ 𝜓)

Assertion

Ref	Expression
festino	⊢ ∃𝑥(𝜒 ∧ ¬ 𝜑)

Proof of Theorem festino

Step	Hyp	Ref	Expression
1		festino.min	. 2 ⊢ ∃𝑥(𝜒 ∧ 𝜓)
2		festino.maj	. . . . 5 ⊢ ∀𝑥(𝜑 → ¬ 𝜓)
3	2	spi 1536	. . . 4 ⊢ (𝜑 → ¬ 𝜓)
4	3	con2i 627	. . 3 ⊢ (𝜓 → ¬ 𝜑)
5	4	anim2i 342	. 2 ⊢ ((𝜒 ∧ 𝜓) → (𝜒 ∧ ¬ 𝜑))
6	1, 5	eximii 1602	1 ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  ∀wal 1351  ∃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)