Theorem reu8 2731

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

Hypothesis

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

Assertion

Ref	Expression
reu8	|- (E!x e. A ph <-> E.x e. A (ph /\ 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 reu8

Step	Hyp	Ref	Expression
1		rmo4.1	. . 3 |- (x = y -> (ph <-> ps))
2	1	cbvreuv 2529	. 2 |- (E!x e. A ph <-> E!y e. A ps)
3		reu6 2724	. 2 |- (E!y e. A ps <-> E.x e. A A.y e. A (ps <-> y = x))
4		dfbi2 368	. . . . 5 |- ((ps <-> y = x) <-> ((ps -> y = x) /\ (y = x -> ps)))
5	4	ralbii 2324	. . . 4 |- (A.y e. A (ps <-> y = x) <-> A.y e. A ((ps -> y = x) /\ (y = x -> ps)))
6		ancom 253	. . . . . 6 |- ((ph /\ A.y e. A (ps -> x = y)) <-> (A.y e. A (ps -> x = y) /\ ph))
7		equcom 1590	. . . . . . . . . 10 |- (x = y <-> y = x)
8	7	imbi2i 215	. . . . . . . . 9 |- ((ps -> x = y) <-> (ps -> y = x))
9	8	ralbii 2324	. . . . . . . 8 |- (A.y e. A (ps -> x = y) <-> A.y e. A (ps -> y = x))
10	9	a1i 9	. . . . . . 7 |- (x e. A -> (A.y e. A (ps -> x = y) <-> A.y e. A (ps -> y = x)))
11		biimt 230	. . . . . . . 8 |- (x e. A -> (ph <-> (x e. A -> ph)))
12		df-ral 2305	. . . . . . . . 9 |- (A.y e. A (y = x -> ps) <-> A.y(y e. A -> (y = x -> ps)))
13		bi2.04 237	. . . . . . . . . 10 |- ((y e. A -> (y = x -> ps)) <-> (y = x -> (y e. A -> ps)))
14	13	albii 1356	. . . . . . . . 9 |- (A.y(y e. A -> (y = x -> ps)) <-> A.y(y = x -> (y e. A -> ps)))
15		vex 2554	. . . . . . . . . 10 |- x e. _V
16		eleq1 2097	. . . . . . . . . . . . 13 |- (x = y -> (x e. A <-> y e. A))
17	16, 1	imbi12d 223	. . . . . . . . . . . 12 |- (x = y -> ((x e. A -> ph) <-> (y e. A -> ps)))
18	17	bicomd 129	. . . . . . . . . . 11 |- (x = y -> ((y e. A -> ps) <-> (x e. A -> ph)))
19	18	equcoms 1591	. . . . . . . . . 10 |- (y = x -> ((y e. A -> ps) <-> (x e. A -> ph)))
20	15, 19	ceqsalv 2578	. . . . . . . . 9 |- (A.y(y = x -> (y e. A -> ps)) <-> (x e. A -> ph))
21	12, 14, 20	3bitrri 196	. . . . . . . 8 |- ((x e. A -> ph) <-> A.y e. A (y = x -> ps))
22	11, 21	syl6bb 185	. . . . . . 7 |- (x e. A -> (ph <-> A.y e. A (y = x -> ps)))
23	10, 22	anbi12d 442	. . . . . 6 |- (x e. A -> ((A.y e. A (ps -> x = y) /\ ph) <-> (A.y e. A (ps -> y = x) /\ A.y e. A (y = x -> ps))))
24	6, 23	syl5bb 181	. . . . 5 |- (x e. A -> ((ph /\ A.y e. A (ps -> x = y)) <-> (A.y e. A (ps -> y = x) /\ A.y e. A (y = x -> ps))))
25		r19.26 2435	. . . . 5 |- (A.y e. A ((ps -> y = x) /\ (y = x -> ps)) <-> (A.y e. A (ps -> y = x) /\ A.y e. A (y = x -> ps)))
26	24, 25	syl6rbbr 188	. . . 4 |- (x e. A -> (A.y e. A ((ps -> y = x) /\ (y = x -> ps)) <-> (ph /\ A.y e. A (ps -> x = y))))
27	5, 26	syl5bb 181	. . 3 |- (x e. A -> (A.y e. A (ps <-> y = x) <-> (ph /\ A.y e. A (ps -> x = y))))
28	27	rexbiia 2333	. 2 |- (E.x e. A A.y e. A (ps <-> y = x) <-> E.x e. A (ph /\ A.y e. A (ps -> x = y)))
29	2, 3, 28	3bitri 195	1 |- (E!x e. A ph <-> E.x e. A (ph /\ A.y e. A (ps -> x = y)))

Syntax hints:   -> wi 4   /\ wa 97   <-> wb 98  A.wal 1240   e. wcel 1390  A.wral 2300  E.wrex 2301  E!wreu 2302

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019

This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-eu 1900  df-clab 2024  df-cleq 2030  df-clel 2033  df-ral 2305  df-rex 2306  df-reu 2307  df-v 2553

This theorem is referenced by: (None)