MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  felapton Structured version   Visualization version   GIF version

Theorem felapton 2711
Description: "Felapton", one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, all 𝜑 is 𝜒, and some 𝜑 exist, therefore some 𝜒 is not 𝜓. Instance of darapti 2709. 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.)
Hypotheses
Ref Expression
felapton.maj ∀𝑥(𝜑 → ¬ 𝜓)
felapton.min ∀𝑥(𝜑 → 𝜒)
felapton.e ∃𝑥𝜑
Assertion
Ref Expression
felapton ∃𝑥(𝜒 ∧ ¬ 𝜓)

Proof of Theorem felapton
StepHypRef Expression
1 felapton.maj . 2 ∀𝑥(𝜑 → ¬ 𝜓)
2 felapton.min . 2 ∀𝑥(𝜑 → 𝜒)
3 felapton.e . 2 ∃𝑥𝜑
41, 2, 3darapti 2709 1 ∃𝑥(𝜒 ∧ ¬ 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  fesapo  2716
  Copyright terms: Public domain W3C validator