Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > calemos | GIF version |
Description: "Calemos", one of the syllogisms of Aristotelian logic. All 𝜑 is 𝜓 (PaM), no 𝜓 is 𝜒 (MeS), and 𝜒 exist, therefore some 𝜒 is not 𝜑 (SoP). (In Aristotelian notation, AEO-4: PaM and MeS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.) |
Ref | Expression |
---|---|
calemos.maj | ⊢ ∀𝑥(𝜑 → 𝜓) |
calemos.min | ⊢ ∀𝑥(𝜓 → ¬ 𝜒) |
calemos.e | ⊢ ∃𝑥𝜒 |
Ref | Expression |
---|---|
calemos | ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | calemos.e | . 2 ⊢ ∃𝑥𝜒 | |
2 | calemos.min | . . . . . 6 ⊢ ∀𝑥(𝜓 → ¬ 𝜒) | |
3 | 2 | spi 1524 | . . . . 5 ⊢ (𝜓 → ¬ 𝜒) |
4 | 3 | con2i 617 | . . . 4 ⊢ (𝜒 → ¬ 𝜓) |
5 | calemos.maj | . . . . 5 ⊢ ∀𝑥(𝜑 → 𝜓) | |
6 | 5 | spi 1524 | . . . 4 ⊢ (𝜑 → 𝜓) |
7 | 4, 6 | nsyl 618 | . . 3 ⊢ (𝜒 → ¬ 𝜑) |
8 | 7 | ancli 321 | . 2 ⊢ (𝜒 → (𝜒 ∧ ¬ 𝜑)) |
9 | 1, 8 | eximii 1590 | 1 ⊢ ∃𝑥(𝜒 ∧ ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∀wal 1341 ∃wex 1480 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-5 1435 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-4 1498 ax-ial 1522 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |