Theorem moeq 3001

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 2828	. . . 4 |- ( A e. _V <-> E. x x = A )
2		eueq 2997	. . . 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 2090	. 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 1402   E.wex 1545   E!weu 2086   E*wmo 2087   e. wcel 2209   _Vcvv 2821

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-v 2823

This theorem is referenced by:  euxfr2dc  3011  reueq  3025  mosn  3744  sndisj  4124  disjxsn  4126  reusv1  4602  funopabeq  5411  funcnvsn  5424  fvmptg  5778  fvopab6  5799  ovmpt4g  6204  ovi3  6219  ov6g  6220  oprabex3  6355  1stconst  6450  2ndconst  6451  axaddf  8228  axmulf  8229