Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > qexmid | Structured version Visualization version Unicode version |
Description: Quantified excluded middle (see exmid 431). Also known as the drinker paradox (if is interpreted as " drinks", then this theorem tells that there exists a person such that, if this person drinks, then everyone drinks). Exercise 9.2a of Boolos, p. 111, Computability and Logic. (Contributed by NM, 10-Dec-2000.) |
Ref | Expression |
---|---|
qexmid |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.8a 2052 | . 2 | |
2 | 1 | 19.35ri 1807 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 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-ex 1705 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |