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

Theorem a4w1 930
Description: Infer existence from a substitution instance.
Hypotheses
Ref Expression
a4w1.1 |- (x = y -> (ph <-> ps))
a4w1.2 |- ps
Assertion
Ref Expression
a4w1 |- E.xph
Distinct variable group(s):   ps,x

Proof of Theorem a4w1
StepHypRef Expression
1 a4w1.2 . 2 |- ps
2 a4w1.1 . . . 4 |- (x = y -> (ph <-> ps))
32biimprd 136 . . 3 |- (x = y -> (ps -> ph))
43a4w 929 . 2 |- (ps -> E.xph)
51, 4ax-mp 6 1 |- E.xph
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  E.wex 678   = weq 797
This theorem is referenced by:  eirrv 3449
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-6 675  ax-gen 677  ax-9 799  ax-17 925
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org