Theorem reuhypd 4387

Description: A theorem useful for eliminating restricted existential uniqueness hypotheses. (Contributed by NM, 16-Jan-2012.)

Hypotheses

Ref	Expression
reuhypd.1	|- ( ( ph /\ x e. C ) -> B e. C )
reuhypd.2	|- ( ( ph /\ x e. C /\ y e. C ) -> ( x = A <-> y = B ) )

Assertion

Ref	Expression
reuhypd	|- ( ( ph /\ x e. C ) -> E! y e. C x = A )

Distinct variable groups:   ph, y   y, B   y, C   x, y

Allowed substitution hints:   ph( x)   A( x, y)   B( x)   C( x)

Proof of Theorem reuhypd

Step	Hyp	Ref	Expression
1		reuhypd.1	. . . . 5 |- ( ( ph /\ x e. C ) -> B e. C )
2		elex 2692	. . . . 5 |- ( B e. C -> B e. _V )
3	1, 2	syl 14	. . . 4 |- ( ( ph /\ x e. C ) -> B e. _V )
4		eueq 2850	. . . 4 |- ( B e. _V <-> E! y y = B )
5	3, 4	sylib 121	. . 3 |- ( ( ph /\ x e. C ) -> E! y y = B )
6		eleq1 2200	. . . . . . 7 |- ( y = B -> ( y e. C <-> B e. C ) )
7	1, 6	syl5ibrcom 156	. . . . . 6 |- ( ( ph /\ x e. C ) -> ( y = B -> y e. C ) )
8	7	pm4.71rd 391	. . . . 5 |- ( ( ph /\ x e. C ) -> ( y = B <-> ( y e. C /\ y = B ) ) )
9		reuhypd.2	. . . . . . 7 |- ( ( ph /\ x e. C /\ y e. C ) -> ( x = A <-> y = B ) )
10	9	3expa 1181	. . . . . 6 |- ( ( ( ph /\ x e. C ) /\ y e. C ) -> ( x = A <-> y = B ) )
11	10	pm5.32da 447	. . . . 5 |- ( ( ph /\ x e. C ) -> ( ( y e. C /\ x = A ) <-> ( y e. C /\ y = B ) ) )
12	8, 11	bitr4d 190	. . . 4 |- ( ( ph /\ x e. C ) -> ( y = B <-> ( y e. C /\ x = A ) ) )
13	12	eubidv 2005	. . 3 |- ( ( ph /\ x e. C ) -> ( E! y y = B <-> E! y ( y e. C /\ x = A ) ) )
14	5, 13	mpbid 146	. 2 |- ( ( ph /\ x e. C ) -> E! y ( y e. C /\ x = A ) )
15		df-reu 2421	. 2 |- ( E! y e. C x = A <-> E! y ( y e. C /\ x = A ) )
16	14, 15	sylibr 133	1 |- ( ( ph /\ x e. C ) -> E! y e. C x = A )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   /\ w3a 962   = wceq 1331   e. wcel 1480   E!weu 1997   E!wreu 2416   _Vcvv 2681

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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-reu 2421  df-v 2683

This theorem is referenced by:  reuhyp  4388