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

Theorem euf 1777
Description: A version of the existential uniqueness definition with a hypothesis instead of a distinct variable condition.
Hypothesis
Ref Expression
euf.1 |- (ph -> A.yph)
Assertion
Ref Expression
euf |- (E!xph <-> E.yA.x(ph <-> x = y))
Distinct variable group:   x,y

Proof of Theorem euf
StepHypRef Expression
1 df-eu 1775 . 2 |- (E!xph <-> E.zA.x(ph <-> x = z))
2 euf.1 . . . . 5 |- (ph -> A.yph)
3 ax-17 1317 . . . . 5 |- (x = z -> A.y x = z)
42, 3hbbi 1357 . . . 4 |- ((ph <-> x = z) -> A.y(ph <-> x = z))
54hbal 1352 . . 3 |- (A.x(ph <-> x = z) -> A.yA.x(ph <-> x = z))
6 ax-17 1317 . . 3 |- (A.x(ph <-> x = y) -> A.zA.x(ph <-> x = y))
7 equequ2 1495 . . . . 5 |- (z = y -> (x = z <-> x = y))
87bibi2d 680 . . . 4 |- (z = y -> ((ph <-> x = z) <-> (ph <-> x = y)))
98albidv 1656 . . 3 |- (z = y -> (A.x(ph <-> x = z) <-> A.x(ph <-> x = y)))
105, 6, 9cbvex 1529 . 2 |- (E.zA.x(ph <-> x = z) <-> E.yA.x(ph <-> x = y))
111, 10bitri 190 1 |- (E!xph <-> E.yA.x(ph <-> x = y))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163  A.wal 1296   = wceq 1298  E.wex 1326  E!weu 1771
This theorem is referenced by:  eu1 1786  eumo0 1790
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327  df-eu 1775
Copyright terms: Public domain