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

Theorem hbeu1 1394
Description: Bound-variable hypothesis builder for uniqueness.
Assertion
Ref Expression
hbeu1 |- (E!xph -> A.xE!xph)

Proof of Theorem hbeu1
StepHypRef Expression
1 hba1 1009 . . 3 |- (A.x(ph <-> x = y) -> A.xA.x(ph <-> x = y))
21hbex 1012 . 2 |- (E.yA.x(ph <-> x = y) -> A.xE.yA.x(ph <-> x = y))
3 df-eu 1388 . 2 |- (E!xph <-> E.yA.x(ph <-> x = y))
43albii 1005 . 2 |- (A.xE!xph <-> A.xE.yA.x(ph <-> x = y))
52, 3, 43imtr4 219 1 |- (E!xph -> A.xE!xph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 958  E.wex 984  E!weu 1386
This theorem is referenced by:  hbmo1 1412  moaneu 1436  eupicka 1441  2eu8 1463  hbreu1 1775  dffun7 3554  fneu 3606  fv3 3747  tz6.12c 3754  aceq5lem5 4751
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 966  ax-gen 967  ax-4 977  ax-5o 979  ax-6o 982
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 985  df-eu 1388
Copyright terms: Public domain