Theorem felapton 2567

Description: "Felapton", one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, all 𝜑 is 𝜒, and some 𝜑 exist, therefore some 𝜒 is not 𝜓. (In Aristotelian notation, EAO-3: MeP and MaS therefore SoP.) For example, "No flowers are animals" and "All flowers are plants", therefore "Some plants are not animals". (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Hypotheses

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

Assertion

Ref	Expression
felapton	⊢ ∃𝑥(𝜒 ∧ ¬ 𝜓)

Proof of Theorem felapton

Step	Hyp	Ref	Expression
1		felapton.e	. 2 ⊢ ∃𝑥𝜑
2		felapton.min	. . . 4 ⊢ ∀𝑥(𝜑 → 𝜒)
3	2	spi 2042	. . 3 ⊢ (𝜑 → 𝜒)
4		felapton.maj	. . . 4 ⊢ ∀𝑥(𝜑 → ¬ 𝜓)
5	4	spi 2042	. . 3 ⊢ (𝜑 → ¬ 𝜓)
6	3, 5	jca 553	. 2 ⊢ (𝜑 → (𝜒 ∧ ¬ 𝜓))
7	1, 6	eximii 1754	1 ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383  ∀wal 1473  ∃wex 1695

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-12 2034

This theorem depends on definitions:  df-bi 196  df-an 385  df-ex 1696

This theorem is referenced by: (None)