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

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

Proof of Theorem hbeu1
StepHypRef Expression
1 hba1 698 . . 3 |- (A.x(ph <-> x = y) -> A.xA.x(ph <-> x = y))
21hbex 701 . 2 |- (E.yA.x(ph <-> x = y) -> A.xE.yA.x(ph <-> x = y))
3 df-eu 1009 . 2 |- (E!xph <-> E.yA.x(ph <-> x = y))
43bial 695 . 2 |- (A.xE!xph <-> A.xE.yA.x(ph <-> x = y))
52, 3, 43imtr4 192 1 |- (E!xph -> A.xE!xph)
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672  E.wex 678   = weq 797  E!weu 1007
This theorem is referenced by:  hbmo1 1032  hbreu1 1307  dffun7 2688  fneu 2728  fv3 2839  tz6.12c 2846  aceq5lem5 3562
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-7 676  ax-gen 677
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-eu 1009
metamath.org