Theorem axrep2 2663

Description: Axiom of Replacement expressed with the fewest number of different variables and without any restrictions on ph.

Assertion

Ref	Expression
axrep2	|- E.x(E.yA.z(ph -> z = y) -> A.z(z e. x <-> E.x(x e. y /\ A.yph)))

Distinct variable group:   x,y,z

Proof of Theorem axrep2

Step	Hyp	Ref	Expression
1		hbe1 990	. . . . 5 |- (E.wA.z(A.yph -> z = w) -> A.wE.wA.z(A.yph -> z = w))
2		ax-17 1190	. . . . 5 |- (A.z(z e. x <-> E.x(x e. y /\ A.yph)) -> A.wA.z(z e. x <-> E.x(x e. y /\ A.yph)))
3	1, 2	hbim 983	. . . 4 |- ((E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))) -> A.w(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))))
4	3	hbex 982	. . 3 |- (E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))) -> A.wE.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))))
5		elequ2 1124	. . . . . . . . 9 |- (w = y -> (x e. w <-> x e. y))
6	5	anbi1d 615	. . . . . . . 8 |- (w = y -> ((x e. w /\ A.yph) <-> (x e. y /\ A.yph)))
7	6	exbidv 1261	. . . . . . 7 |- (w = y -> (E.x(x e. w /\ A.yph) <-> E.x(x e. y /\ A.yph)))
8	7	bibi2d 616	. . . . . 6 |- (w = y -> ((z e. x <-> E.x(x e. w /\ A.yph)) <-> (z e. x <-> E.x(x e. y /\ A.yph))))
9	8	albidv 1260	. . . . 5 |- (w = y -> (A.z(z e. x <-> E.x(x e. w /\ A.yph)) <-> A.z(z e. x <-> E.x(x e. y /\ A.yph))))
10	9	imbi2d 610	. . . 4 |- (w = y -> ((E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. w /\ A.yph))) <-> (E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph)))))
11	10	exbidv 1261	. . 3 |- (w = y -> (E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. w /\ A.yph))) <-> E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph)))))
12		axrep1 2662	. . 3 |- E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. w /\ A.yph)))
13	4, 11, 12	chvar 1150	. 2 |- E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph)))
14		ax-4 951	. . . . . . . 8 |- (A.yph -> ph)
15	14	imim1i 16	. . . . . . 7 |- ((ph -> z = y) -> (A.yph -> z = y))
16	15	19.20i 968	. . . . . 6 |- (A.z(ph -> z = y) -> A.z(A.yph -> z = y))
17	16	19.22i 1016	. . . . 5 |- (E.yA.z(ph -> z = y) -> E.yA.z(A.yph -> z = y))
18		ax-17 1190	. . . . . 6 |- (A.z(A.yph -> z = y) -> A.wA.z(A.yph -> z = y))
19		hba1 979	. . . . . . . 8 |- (A.yph -> A.yA.yph)
20		ax-17 1190	. . . . . . . 8 |- (z = w -> A.y z = w)
21	19, 20	hbim 983	. . . . . . 7 |- ((A.yph -> z = w) -> A.y(A.yph -> z = w))
22	21	hbal 981	. . . . . 6 |- (A.z(A.yph -> z = w) -> A.yA.z(A.yph -> z = w))
23		equequ2 1122	. . . . . . . 8 |- (y = w -> (z = y <-> z = w))
24	23	imbi2d 610	. . . . . . 7 |- (y = w -> ((A.yph -> z = y) <-> (A.yph -> z = w)))
25	24	albidv 1260	. . . . . 6 |- (y = w -> (A.z(A.yph -> z = y) <-> A.z(A.yph -> z = w)))
26	18, 22, 25	cbvex 1149	. . . . 5 |- (E.yA.z(A.yph -> z = y) <-> E.wA.z(A.yph -> z = w))
27	17, 26	sylib 198	. . . 4 |- (E.yA.z(ph -> z = y) -> E.wA.z(A.yph -> z = w))
28	27	imim1i 16	. . 3 |- ((E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))) -> (E.yA.z(ph -> z = y) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))))
29	28	19.22i 1016	. 2 |- (E.x(E.wA.z(A.yph -> z = w) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))) -> E.x(E.yA.z(ph -> z = y) -> A.z(z e. x <-> E.x(x e. y /\ A.yph))))
30	13, 29	ax-mp 7	1 |- E.x(E.yA.z(ph -> z = y) -> A.z(z e. x <-> E.x(x e. y /\ A.yph)))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 950  E.wex 956   = wceq 1099   e. wcel 1105

This theorem is referenced by:  axrep3 2664  axrepndlem1 4867

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-12 1104  ax-14 1108  ax-17 1190  ax-rep 2661

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 957

Copyright terms: Public domain