Theorem reuxfr2d 4891

Description: Transfer existential uniqueness from a variable x to another variable y contained in expression A. (Contributed by NM, 16-Jan-2012.) (Revised by NM, 16-Jun-2017.)

Hypotheses

Ref	Expression
reuxfr2d.1	|- ( ( ph /\ y e. B ) -> A e. B )
reuxfr2d.2	|- ( ( ph /\ x e. B ) -> E* y e. B x = A )

Assertion

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

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

Allowed substitution hints:   ps( y)   A( y)

Proof of Theorem reuxfr2d

Step	Hyp	Ref	Expression
1		reuxfr2d.2	. . . . . . 7 |- ( ( ph /\ x e. B ) -> E* y e. B x = A )
2		rmoan 3406	. . . . . . 7 |- ( E* y e. B x = A -> E* y e. B ( ps /\ x = A ) )
3	1, 2	syl 17	. . . . . 6 |- ( ( ph /\ x e. B ) -> E* y e. B ( ps /\ x = A ) )
4		ancom 466	. . . . . . 7 |- ( ( ps /\ x = A ) <-> ( x = A /\ ps ) )
5	4	rmobii 3133	. . . . . 6 |- ( E* y e. B ( ps /\ x = A ) <-> E* y e. B ( x = A /\ ps ) )
6	3, 5	sylib 208	. . . . 5 |- ( ( ph /\ x e. B ) -> E* y e. B ( x = A /\ ps ) )
7	6	ralrimiva 2966	. . . 4 |- ( ph -> A. x e. B E* y e. B ( x = A /\ ps ) )
8		2reuswap 3410	. . . 4 |- ( A. x e. B E* y e. B ( x = A /\ ps ) -> ( E! x e. B E. y e. B ( x = A /\ ps ) -> E! y e. B E. x e. B ( x = A /\ ps ) ) )
9	7, 8	syl 17	. . 3 |- ( ph -> ( E! x e. B E. y e. B ( x = A /\ ps ) -> E! y e. B E. x e. B ( x = A /\ ps ) ) )
10		df-rmo 2920	. . . . . 6 |- ( E* x e. B ( x = A /\ ps ) <-> E* x ( x e. B /\ ( x = A /\ ps ) ) )
11	10	ralbii 2980	. . . . 5 |- ( A. y e. B E* x e. B ( x = A /\ ps ) <-> A. y e. B E* x ( x e. B /\ ( x = A /\ ps ) ) )
12		2reuswap 3410	. . . . 5 |- ( A. y e. B E* x e. B ( x = A /\ ps ) -> ( E! y e. B E. x e. B ( x = A /\ ps ) -> E! x e. B E. y e. B ( x = A /\ ps ) ) )
13	11, 12	sylbir 225	. . . 4 |- ( A. y e. B E* x ( x e. B /\ ( x = A /\ ps ) ) -> ( E! y e. B E. x e. B ( x = A /\ ps ) -> E! x e. B E. y e. B ( x = A /\ ps ) ) )
14		moeq 3382	. . . . . . 7 |- E* x x = A
15	14	moani 2525	. . . . . 6 |- E* x ( ( x e. B /\ ps ) /\ x = A )
16		ancom 466	. . . . . . . 8 |- ( ( ( x e. B /\ ps ) /\ x = A ) <-> ( x = A /\ ( x e. B /\ ps ) ) )
17		an12 838	. . . . . . . 8 |- ( ( x = A /\ ( x e. B /\ ps ) ) <-> ( x e. B /\ ( x = A /\ ps ) ) )
18	16, 17	bitri 264	. . . . . . 7 |- ( ( ( x e. B /\ ps ) /\ x = A ) <-> ( x e. B /\ ( x = A /\ ps ) ) )
19	18	mobii 2493	. . . . . 6 |- ( E* x ( ( x e. B /\ ps ) /\ x = A ) <-> E* x ( x e. B /\ ( x = A /\ ps ) ) )
20	15, 19	mpbi 220	. . . . 5 |- E* x ( x e. B /\ ( x = A /\ ps ) )
21	20	a1i 11	. . . 4 |- ( y e. B -> E* x ( x e. B /\ ( x = A /\ ps ) ) )
22	13, 21	mprg 2926	. . 3 |- ( E! y e. B E. x e. B ( x = A /\ ps ) -> E! x e. B E. y e. B ( x = A /\ ps ) )
23	9, 22	impbid1 215	. 2 |- ( ph -> ( E! x e. B E. y e. B ( x = A /\ ps ) <-> E! y e. B E. x e. B ( x = A /\ ps ) ) )
24		reuxfr2d.1	. . . 4 |- ( ( ph /\ y e. B ) -> A e. B )
25		biidd 252	. . . . 5 |- ( x = A -> ( ps <-> ps ) )
26	25	ceqsrexv 3336	. . . 4 |- ( A e. B -> ( E. x e. B ( x = A /\ ps ) <-> ps ) )
27	24, 26	syl 17	. . 3 |- ( ( ph /\ y e. B ) -> ( E. x e. B ( x = A /\ ps ) <-> ps ) )
28	27	reubidva 3125	. 2 |- ( ph -> ( E! y e. B E. x e. B ( x = A /\ ps ) <-> E! y e. B ps ) )
29	23, 28	bitrd 268	1 |- ( ph -> ( E! x e. B E. y e. B ( x = A /\ ps ) <-> E! y e. B ps ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   E*wmo 2471   A.wral 2912   E.wrex 2913   E!wreu 2914   E*wrmo 2915

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-clab 2609  df-cleq 2615  df-clel 2618  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-v 3202

This theorem is referenced by:  reuxfr2  4892  reuxfrd  4893