Theorem erinxp 6883

Description: A restricted equivalence relation is an equivalence relation. (Contributed by Mario Carneiro, 10-Jul-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
erinxp.r	|- ( ph -> R Er A )
erinxp.a	|- ( ph -> B C_ A )

Assertion

Ref	Expression
erinxp	|- ( ph -> ( R i^i ( B X. B ) ) Er B )

Proof of Theorem erinxp

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		inss2 3452	. . . 4 |- ( R i^i ( B X. B ) ) C_ ( B X. B )
2		relxp 4884	. . . 4 |- Rel ( B X. B )
3		relss 4862	. . . 4 |- ( ( R i^i ( B X. B ) ) C_ ( B X. B ) -> ( Rel ( B X. B ) -> Rel ( R i^i ( B X. B ) ) ) )
4	1, 2, 3	mp2 16	. . 3 |- Rel ( R i^i ( B X. B ) )
5	4	a1i 9	. 2 |- ( ph -> Rel ( R i^i ( B X. B ) ) )
6		simpr 110	. . . . 5 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> x ( R i^i ( B X. B ) ) y )
7		brinxp2 4842	. . . . 5 |- ( x ( R i^i ( B X. B ) ) y <-> ( x e. B /\ y e. B /\ x R y ) )
8	6, 7	sylib 122	. . . 4 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> ( x e. B /\ y e. B /\ x R y ) )
9	8	simp2d 1041	. . 3 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> y e. B )
10	8	simp1d 1040	. . 3 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> x e. B )
11		erinxp.r	. . . . 5 |- ( ph -> R Er A )
12	11	adantr 276	. . . 4 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> R Er A )
13	8	simp3d 1042	. . . 4 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> x R y )
14	12, 13	ersym 6819	. . 3 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> y R x )
15		brinxp2 4842	. . 3 |- ( y ( R i^i ( B X. B ) ) x <-> ( y e. B /\ x e. B /\ y R x ) )
16	9, 10, 14, 15	syl3anbrc 1212	. 2 |- ( ( ph /\ x ( R i^i ( B X. B ) ) y ) -> y ( R i^i ( B X. B ) ) x )
17	10	adantrr 483	. . 3 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> x e. B )
18		simprr 537	. . . . 5 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> y ( R i^i ( B X. B ) ) z )
19		brinxp2 4842	. . . . 5 |- ( y ( R i^i ( B X. B ) ) z <-> ( y e. B /\ z e. B /\ y R z ) )
20	18, 19	sylib 122	. . . 4 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> ( y e. B /\ z e. B /\ y R z ) )
21	20	simp2d 1041	. . 3 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> z e. B )
22	11	adantr 276	. . . 4 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> R Er A )
23	13	adantrr 483	. . . 4 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> x R y )
24	20	simp3d 1042	. . . 4 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> y R z )
25	22, 23, 24	ertrd 6823	. . 3 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> x R z )
26		brinxp2 4842	. . 3 |- ( x ( R i^i ( B X. B ) ) z <-> ( x e. B /\ z e. B /\ x R z ) )
27	17, 21, 25, 26	syl3anbrc 1212	. 2 |- ( ( ph /\ ( x ( R i^i ( B X. B ) ) y /\ y ( R i^i ( B X. B ) ) z ) ) -> x ( R i^i ( B X. B ) ) z )
28	11	adantr 276	. . . . . 6 |- ( ( ph /\ x e. B ) -> R Er A )
29		erinxp.a	. . . . . . 7 |- ( ph -> B C_ A )
30	29	sselda 3248	. . . . . 6 |- ( ( ph /\ x e. B ) -> x e. A )
31	28, 30	erref 6827	. . . . 5 |- ( ( ph /\ x e. B ) -> x R x )
32	31	ex 115	. . . 4 |- ( ph -> ( x e. B -> x R x ) )
33	32	pm4.71rd 398	. . 3 |- ( ph -> ( x e. B <-> ( x R x /\ x e. B ) ) )
34		brin 4183	. . . 4 |- ( x ( R i^i ( B X. B ) ) x <-> ( x R x /\ x ( B X. B ) x ) )
35		brxp 4805	. . . . . 6 |- ( x ( B X. B ) x <-> ( x e. B /\ x e. B ) )
36		anidm 400	. . . . . 6 |- ( ( x e. B /\ x e. B ) <-> x e. B )
37	35, 36	bitri 184	. . . . 5 |- ( x ( B X. B ) x <-> x e. B )
38	37	anbi2i 461	. . . 4 |- ( ( x R x /\ x ( B X. B ) x ) <-> ( x R x /\ x e. B ) )
39	34, 38	bitri 184	. . 3 |- ( x ( R i^i ( B X. B ) ) x <-> ( x R x /\ x e. B ) )
40	33, 39	bitr4di 198	. 2 |- ( ph -> ( x e. B <-> x ( R i^i ( B X. B ) ) x ) )
41	5, 16, 27, 40	iserd 6833	1 |- ( ph -> ( R i^i ( B X. B ) ) Er B )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   e. wcel 2209   i^i cin 3219   C_ wss 3220   class class class wbr 4130   X. cxp 4772   Rel wrel 4779   Er wer 6804

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-er 6807

This theorem is used by: (None)