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

Theorem baroco 2559
Description: "Baroco", one of the syllogisms of Aristotelian logic. All 𝜑 is 𝜓, and some 𝜒 is not 𝜓, therefore some 𝜒 is not 𝜑. (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 𝑥(𝜑𝜓)
baroco.min 𝑥(𝜒 ∧ ¬ 𝜓)
Assertion
Ref Expression
baroco 𝑥(𝜒 ∧ ¬ 𝜑)

Proof of Theorem baroco
StepHypRef Expression
1 baroco.min . 2 𝑥(𝜒 ∧ ¬ 𝜓)
2 baroco.maj . . . . 5 𝑥(𝜑𝜓)
32spi 2041 . . . 4 (𝜑𝜓)
43con3i 148 . . 3 𝜓 → ¬ 𝜑)
54anim2i 590 . 2 ((𝜒 ∧ ¬ 𝜓) → (𝜒 ∧ ¬ 𝜑))
61, 5eximii 1753 1 𝑥(𝜒 ∧ ¬ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382  wal 1472  wex 1694
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-12 2033
This theorem depends on definitions:  df-bi 195  df-an 384  df-ex 1695
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator