Theorem axsep2 4101

Description: A less restrictive version of the Separation Scheme ax-sep 4100, 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 4100 with no additional set theory axioms. (Contributed by NM, 10-Dec-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)

Assertion

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

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

Allowed substitution hints:   ph( x, z)

Proof of Theorem axsep2

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2230	. . . . . . 7 |- ( w = z -> ( x e. w <-> x e. z ) )
2	1	anbi1d 461	. . . . . 6 |- ( w = z -> ( ( x e. w /\ ( x e. z /\ ph ) ) <-> ( x e. z /\ ( x e. z /\ ph ) ) ) )
3		anabs5 563	. . . . . 6 |- ( ( x e. z /\ ( x e. z /\ ph ) ) <-> ( x e. z /\ ph ) )
4	2, 3	bitrdi 195	. . . . 5 |- ( w = z -> ( ( x e. w /\ ( x e. z /\ ph ) ) <-> ( x e. z /\ ph ) ) )
5	4	bibi2d 231	. . . 4 |- ( w = z -> ( ( x e. y <-> ( x e. w /\ ( x e. z /\ ph ) ) ) <-> ( x e. y <-> ( x e. z /\ ph ) ) ) )
6	5	albidv 1812	. . 3 |- ( w = z -> ( A. x ( x e. y <-> ( x e. w /\ ( x e. z /\ ph ) ) ) <-> A. x ( x e. y <-> ( x e. z /\ ph ) ) ) )
7	6	exbidv 1813	. 2 |- ( w = z -> ( E. y A. x ( x e. y <-> ( x e. w /\ ( x e. z /\ ph ) ) ) <-> E. y A. x ( x e. y <-> ( x e. z /\ ph ) ) ) )
8		ax-sep 4100	. 2 |- E. y A. x ( x e. y <-> ( x e. w /\ ( x e. z /\ ph ) ) )
9	7, 8	chvarv 1925	1 |- E. y A. x ( x e. y <-> ( x e. z /\ ph ) )

Syntax hints:   /\ wa 103   <-> wb 104   A.wal 1341   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-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-ext 2147  ax-sep 4100

This theorem depends on definitions:  df-bi 116  df-nf 1449  df-cleq 2158  df-clel 2161

This theorem is referenced by: (None)