Theorem moeq 2939

Description: There is at most one set equal to a class. (Contributed by NM, 8-Mar-1995.)

Assertion

Ref	Expression
moeq	|- E* x x = A

Distinct variable group:   x, A

Proof of Theorem moeq

Step	Hyp	Ref	Expression
1		isset 2769	. . . 4 |- ( A e. _V <-> E. x x = A )
2		eueq 2935	. . . 4 |- ( A e. _V <-> E! x x = A )
3	1, 2	bitr3i 186	. . 3 |- ( E. x x = A <-> E! x x = A )
4	3	biimpi 120	. 2 |- ( E. x x = A -> E! x x = A )
5		df-mo 2049	. 2 |- ( E* x x = A <-> ( E. x x = A -> E! x x = A ) )
6	4, 5	mpbir 146	1 |- E* x x = A

Syntax hints:   -> wi 4   = wceq 1364   E.wex 1506   E!weu 2045   E*wmo 2046   e. wcel 2167   _Vcvv 2763

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-v 2765

This theorem is referenced by:  euxfr2dc  2949  reueq  2963  mosn  3659  sndisj  4030  disjxsn  4032  reusv1  4494  funopabeq  5295  funcnvsn  5304  fvmptg  5640  fvopab6  5661  ovmpt4g  6049  ovi3  6064  ov6g  6065  oprabex3  6195  1stconst  6288  2ndconst  6289  axaddf  7952  axmulf  7953