Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ferio | Structured version Visualization version GIF version |
Description: "Ferio" ("Ferioque"), one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, and some 𝜒 is 𝜑, therefore some 𝜒 is not 𝜓. Instance of darii 2666. In Aristotelian notation, EIO-1: MeP and SiM therefore SoP. For example, given "No homework is fun" and "Some reading is homework", therefore "Some reading is not fun". This is essentially a logical axiom in Aristotelian logic. Example from https://en.wikipedia.org/wiki/Syllogism 2666. (Contributed by David A. Wheeler, 24-Aug-2016.) |
Ref | Expression |
---|---|
ferio.maj | ⊢ ∀𝑥(𝜑 → ¬ 𝜓) |
ferio.min | ⊢ ∃𝑥(𝜒 ∧ 𝜑) |
Ref | Expression |
---|---|
ferio | ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ferio.maj | . 2 ⊢ ∀𝑥(𝜑 → ¬ 𝜓) | |
2 | ferio.min | . 2 ⊢ ∃𝑥(𝜒 ∧ 𝜑) | |
3 | 1, 2 | darii 2666 | 1 ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∀wal 1537 ∃wex 1782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |