Theorem cleqf 1167

Description: Establish equality between classes, requiring only that x not be 'free' in A and B (but not necessarily absent from them).

Hypotheses

Ref	Expression
cleqf.1	|- (y e. A -> A.x y e. A)
cleqf.2	|- (y e. B -> A.x y e. B)

Assertion

Ref	Expression
cleqf	|- (A = B <-> A.x(x e. A <-> x e. B))

Distinct variable group(s):   y,A   y,B   x,y

Proof of Theorem cleqf

Step	Hyp	Ref	Expression
1		dfcleq 1098	. 2 |- (A = B <-> A.y(y e. A <-> y e. B))
2		ax-17 925	. . 3 |- ((x e. A <-> x e. B) -> A.y(x e. A <-> x e. B))
3		cleqf.1	. . . 4 |- (y e. A -> A.x y e. A)
4		cleqf.2	. . . 4 |- (y e. B -> A.x y e. B)
5	3, 4	hbbi 705	. . 3 |- ((y e. A <-> y e. B) -> A.x(y e. A <-> y e. B))
6		eleq1 1149	. . . 4 |- (x = y -> (x e. A <-> y e. A))
7		eleq1 1149	. . . 4 |- (x = y -> (x e. B <-> y e. B))
8	6, 7	bibi12d 477	. . 3 |- (x = y -> ((x e. A <-> x e. B) <-> (y e. A <-> y e. B)))
9	2, 5, 8	cbval 848	. 2 |- (A.x(x e. A <-> x e. B) <-> A.y(y e. A <-> y e. B))
10	1, 9	bitr4 154	1 |- (A = B <-> A.x(x e. A <-> x e. B))

Syntax hints:   -> wi 2   <-> wb 127  A.wal 672   = weq 797   = wceq 1091   e. wcel 1092

This theorem is referenced by:  cleqab 1174  cleq2ab 1179  cbvab 1423  n0f 1713

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-12 802  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-cleq 1097  df-clel 1099

metamath.org