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

Theorem eu1 1390
Description: An alternate way to express uniqueness used by some authors. Exercise 2(b) of [Margaris] p. 110.
Hypothesis
Ref Expression
eu1.1 |- (ph -> A.yph)
Assertion
Ref Expression
eu1 |- (E!xph <-> E.x(ph /\ A.y([y / x]ph -> x = y)))
Distinct variable group:   x,y

Proof of Theorem eu1
StepHypRef Expression
1 hbs1 1330 . . 3 |- ([y / x]ph -> A.x[y / x]ph)
21euf 1382 . 2 |- (E!y[y / x]ph <-> E.xA.y([y / x]ph <-> y = x))
3 eu1.1 . . 3 |- (ph -> A.yph)
43sb8eu 1388 . 2 |- (E!xph <-> E!y[y / x]ph)
5 equcom 1127 . . . . . . 7 |- (x = y <-> y = x)
65imbi2i 185 . . . . . 6 |- (([y / x]ph -> x = y) <-> ([y / x]ph -> y = x))
76albii 997 . . . . 5 |- (A.y([y / x]ph -> x = y) <-> A.y([y / x]ph -> y = x))
83sb6rf 1258 . . . . 5 |- (ph <-> A.y(y = x -> [y / x]ph))
97, 8anbi12i 482 . . . 4 |- ((A.y([y / x]ph -> x = y) /\ ph) <-> (A.y([y / x]ph -> y = x) /\ A.y(y = x -> [y / x]ph)))
10 ancom 435 . . . 4 |- ((ph /\ A.y([y / x]ph -> x = y)) <-> (A.y([y / x]ph -> x = y) /\ ph))
11 albi 1105 . . . 4 |- (A.y([y / x]ph <-> y = x) <-> (A.y([y / x]ph -> y = x) /\ A.y(y = x -> [y / x]ph)))
129, 10, 113bitr4 183 . . 3 |- ((ph /\ A.y([y / x]ph -> x = y)) <-> A.y([y / x]ph <-> y = x))
1312exbii 1049 . 2 |- (E.x(ph /\ A.y([y / x]ph -> x = y)) <-> E.xA.y([y / x]ph <-> y = x))
142, 4, 133bitr4 183 1 |- (E!xph <-> E.x(ph /\ A.y([y / x]ph -> x = y)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 952   = wceq 954  E.wex 978  [wsbc 1168  E!weu 1378
This theorem is referenced by:  euex 1392  eu2 1394  kmlem15 4759
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380
Copyright terms: Public domain