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

Theorem 19.9 1036
Description: A wff may be existentially quantified with a variable not free in it. Theorem 19.9 of [Margaris] p. 89. (Contributed by FL, 24-Mar-2007.)
Hypothesis
Ref Expression
19.9.1 |- (ph -> A.xph)
Assertion
Ref Expression
19.9 |- (E.xph <-> ph)

Proof of Theorem 19.9
StepHypRef Expression
1 19.9t 1035 . . 3 |- (A.x(ph -> A.xph) -> (E.xph -> ph))
2 19.9.1 . . 3 |- (ph -> A.xph)
31, 2mpg 986 . 2 |- (E.xph -> ph)
4 19.8a 1029 . 2 |- (ph -> E.xph)
53, 4impbi 157 1 |- (E.xph <-> ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954  E.wex 980
This theorem is referenced by:  excomim 1045  19.19 1055  19.23 1063  19.23ai 1064  19.36 1078  19.44 1089  19.45 1090  19.9v 1284  exists1 1457  dfid3 2836
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-4 973  ax-5o 975  ax-6o 978
This theorem depends on definitions:  df-bi 147  df-ex 981
Copyright terms: Public domain