Theorem cleljust 2142

Description: When the class variables of set theory are replaced with setvar variables, this theorem of predicate calculus is the result. This theorem provides part of the justification for the consistency of that definition, which "overloads" the setvar variables in wel 2137 with the class variables in wcel 2136. (Contributed by NM, 28-Jan-2004.)

Assertion

Ref	Expression
cleljust	|- ( x e. y <-> E. z ( z = x /\ z e. y ) )

Distinct variable groups:   x, z   y, z

Proof of Theorem cleljust

Step	Hyp	Ref	Expression
1		ax-17 1514	. . 3 |- ( x e. y -> A. z x e. y )
2		elequ1 2140	. . 3 |- ( z = x -> ( z e. y <-> x e. y ) )
3	1, 2	equsex 1716	. 2 |- ( E. z ( z = x /\ z e. y ) <-> x e. y )
4	3	bicomi 131	1 |- ( x e. y <-> E. z ( z = x /\ z e. y ) )

Syntax hints:   /\ wa 103   <-> wb 104   E.wex 1480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-13 2138

This theorem depends on definitions:  df-bi 116

This theorem is referenced by: (None)