Theorem reu7 3401

Description: Restricted uniqueness using implicit substitution. (Contributed by NM, 24-Oct-2006.)

Hypothesis

Ref	Expression
rmo4.1	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
reu7	|- ( E! x e. A ph <-> ( E. x e. A ph /\ E. x e. A A. y e. A ( ps -> x = y ) ) )

Distinct variable groups:   x, y, A   ph, y   ps, x

Allowed substitution hints:   ph( x)   ps( y)

Proof of Theorem reu7

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		reu3 3396	. 2 |- ( E! x e. A ph <-> ( E. x e. A ph /\ E. z e. A A. x e. A ( ph -> x = z ) ) )
2		rmo4.1	. . . . . . 7 |- ( x = y -> ( ph <-> ps ) )
3		equequ1 1952	. . . . . . . 8 |- ( x = y -> ( x = z <-> y = z ) )
4		equcom 1945	. . . . . . . 8 |- ( y = z <-> z = y )
5	3, 4	syl6bb 276	. . . . . . 7 |- ( x = y -> ( x = z <-> z = y ) )
6	2, 5	imbi12d 334	. . . . . 6 |- ( x = y -> ( ( ph -> x = z ) <-> ( ps -> z = y ) ) )
7	6	cbvralv 3171	. . . . 5 |- ( A. x e. A ( ph -> x = z ) <-> A. y e. A ( ps -> z = y ) )
8	7	rexbii 3041	. . . 4 |- ( E. z e. A A. x e. A ( ph -> x = z ) <-> E. z e. A A. y e. A ( ps -> z = y ) )
9		equequ1 1952	. . . . . . 7 |- ( z = x -> ( z = y <-> x = y ) )
10	9	imbi2d 330	. . . . . 6 |- ( z = x -> ( ( ps -> z = y ) <-> ( ps -> x = y ) ) )
11	10	ralbidv 2986	. . . . 5 |- ( z = x -> ( A. y e. A ( ps -> z = y ) <-> A. y e. A ( ps -> x = y ) ) )
12	11	cbvrexv 3172	. . . 4 |- ( E. z e. A A. y e. A ( ps -> z = y ) <-> E. x e. A A. y e. A ( ps -> x = y ) )
13	8, 12	bitri 264	. . 3 |- ( E. z e. A A. x e. A ( ph -> x = z ) <-> E. x e. A A. y e. A ( ps -> x = y ) )
14	13	anbi2i 730	. 2 |- ( ( E. x e. A ph /\ E. z e. A A. x e. A ( ph -> x = z ) ) <-> ( E. x e. A ph /\ E. x e. A A. y e. A ( ps -> x = y ) ) )
15	1, 14	bitri 264	1 |- ( E! x e. A ph <-> ( E. x e. A ph /\ E. x e. A A. y e. A ( ps -> x = y ) ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   A.wral 2912   E.wrex 2913   E!wreu 2914

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920

This theorem is referenced by:  cshwrepswhash1  15809