Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > baroco | Structured version Visualization version Unicode version |
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.) |
Ref | Expression |
---|---|
baroco.maj | |
baroco.min |
Ref | Expression |
---|---|
baroco |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | baroco.min | . 2 | |
2 | baroco.maj | . . . . 5 | |
3 | 2 | spi 2054 | . . . 4 |
4 | 3 | con3i 150 | . . 3 |
5 | 4 | anim2i 593 | . 2 |
6 | 1, 5 | eximii 1764 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wa 384 wal 1481 wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-12 2047 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |