Theorem qexmid 2232

Description: Quantified excluded middle (see exmid 908). 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.)

Assertion

Ref	Expression
qexmid	⊢ ∃𝑥(𝜑 → ∀𝑥𝜑)

Proof of Theorem qexmid

Step	Hyp	Ref	Expression
1		19.8a 2220	. 2 ⊢ (∀𝑥𝜑 → ∃𝑥∀𝑥𝜑)
2	1	19.35ri 1912	1 ⊢ ∃𝑥(𝜑 → ∀𝑥𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-12 2216

This proof depends on definitions:  df-bi 210  df-ex 1813

This theorem is used by: (None)