HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem qexmid 796
Description: Quantified "excluded middle". Exercise 9.2a of Boolos, p. 111, Computability and Logic.
Assertion
Ref Expression
qexmid |- E.x(ph -> A.xph)

Proof of Theorem qexmid
StepHypRef Expression
1 19.8a 712 . 2 |- (A.xph -> E.xA.xph)
2119.35ri 756 1 |- E.x(ph -> A.xph)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672  E.wex 678
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-gen 677
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org