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

Theorem sb8eu 1383
Description: Variable substitution in uniqueness quantifier. (This theorem can also be proved without requiring that x and y be distinct, but the proof would be longer.)
Hypothesis
Ref Expression
sb8eu.1 |- (ph -> A.yph)
Assertion
Ref Expression
sb8eu |- (E!xph <-> E!y[y / x]ph)
Distinct variable group:   x,y

Proof of Theorem sb8eu
StepHypRef Expression
1 sb8eu.1 . . . . . 6 |- (ph -> A.yph)
2 ax-17 968 . . . . . 6 |- (x = z -> A.y x = z)
31, 2hbbi 1007 . . . . 5 |- ((ph <-> x = z) -> A.y(ph <-> x = z))
43sb8 1256 . . . 4 |- (A.x(ph <-> x = z) <-> A.y[y / x](ph <-> x = z))
5 ax-17 968 . . . . . . 7 |- (y = z -> A.x y = z)
6 equequ1 1130 . . . . . . 7 |- (x = y -> (x = z <-> y = z))
75, 6sbie 1192 . . . . . 6 |- ([y / x]x = z <-> y = z)
87sblbis 1235 . . . . 5 |- ([y / x](ph <-> x = z) <-> ([y / x]ph <-> y = z))
98albii 996 . . . 4 |- (A.y[y / x](ph <-> x = z) <-> A.y([y / x]ph <-> y = z))
104, 9bitr 173 . . 3 |- (A.x(ph <-> x = z) <-> A.y([y / x]ph <-> y = z))
1110exbii 1047 . 2 |- (E.zA.x(ph <-> x = z) <-> E.zA.y([y / x]ph <-> y = z))
12 df-eu 1375 . 2 |- (E!xph <-> E.zA.x(ph <-> x = z))
13 df-eu 1375 . 2 |- (E!y[y / x]ph <-> E.zA.y([y / x]ph <-> y = z))
1411, 12, 133bitr4 183 1 |- (E!xph <-> E!y[y / x]ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 951  E.wex 977  [wsbc 1166  E!weu 1373
This theorem is referenced by:  cbveu 1384  eu1 1385
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-11o 1213
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375
Copyright terms: Public domain