Theorem axsep2 2672

Description: A less restrictive version of the Separation Scheme axsep 2670, where variables x and z can both appear free in the wff ph, which can therefore be thought of as ph(x, z). This version was derived from the more restrictive ax-sep 2671 with no additional set theory axioms.

Assertion

Ref	Expression
axsep2	|- E.yA.x(x e. y <-> (x e. z /\ ph))

Distinct variable groups:   x,y,z   ph,y

Proof of Theorem axsep2

Step	Hyp	Ref	Expression
1		a9e 1112	. 2 |- E.w w = z
2		ax-sep 2671	. . . 4 |- E.yA.x(x e. y <-> (x e. w /\ (x e. z /\ ph)))
3		elequ2 1124	. . . . . . . . . . 11 |- (w = z -> (x e. w <-> x e. z))
4	3	biimprd 154	. . . . . . . . . 10 |- (w = z -> (x e. z -> x e. w))
5	4	pm4.71rd 637	. . . . . . . . 9 |- (w = z -> (x e. z <-> (x e. w /\ x e. z)))
6	5	anbi1d 615	. . . . . . . 8 |- (w = z -> ((x e. z /\ ph) <-> ((x e. w /\ x e. z) /\ ph)))
7		anass 439	. . . . . . . 8 |- (((x e. w /\ x e. z) /\ ph) <-> (x e. w /\ (x e. z /\ ph)))
8	6, 7	syl6bb 534	. . . . . . 7 |- (w = z -> ((x e. z /\ ph) <-> (x e. w /\ (x e. z /\ ph))))
9	8	bibi2d 616	. . . . . 6 |- (w = z -> ((x e. y <-> (x e. z /\ ph)) <-> (x e. y <-> (x e. w /\ (x e. z /\ ph)))))
10	9	albidv 1260	. . . . 5 |- (w = z -> (A.x(x e. y <-> (x e. z /\ ph)) <-> A.x(x e. y <-> (x e. w /\ (x e. z /\ ph)))))
11	10	exbidv 1261	. . . 4 |- (w = z -> (E.yA.x(x e. y <-> (x e. z /\ ph)) <-> E.yA.x(x e. y <-> (x e. w /\ (x e. z /\ ph)))))
12	2, 11	mpbiri 194	. . 3 |- (w = z -> E.yA.x(x e. y <-> (x e. z /\ ph)))
13	12	19.23aiv 1277	. 2 |- (E.w w = z -> E.yA.x(x e. y <-> (x e. z /\ ph)))
14	1, 13	ax-mp 7	1 |- E.yA.x(x e. y <-> (x e. z /\ ph))

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

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-gen 955  ax-8 1101  ax-9 1102  ax-12 1104  ax-14 1108  ax-17 1190  ax-sep 2671

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

Copyright terms: Public domain