Theorem ecinxp 6204

Description: Restrict the relation in an equivalence class to a base set. (Contributed by Mario Carneiro, 10-Jul-2015.)

Assertion

Ref	Expression
ecinxp	|- ( ( ( R " A ) C_ A /\ B e. A ) -> [ B ] R = [ B ] ( R i^i ( A X. A ) ) )

Proof of Theorem ecinxp

Step	Hyp	Ref	Expression
1		simpr 108	. . . . . . . 8 |- ( ( ( R " A ) C_ A /\ B e. A ) -> B e. A )
2	1	snssd 3530	. . . . . . 7 |- ( ( ( R " A ) C_ A /\ B e. A ) -> { B } C_ A )
3		df-ss 2986	. . . . . . 7 |- ( { B } C_ A <-> ( { B } i^i A ) = { B } )
4	2, 3	sylib 120	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( { B } i^i A ) = { B } )
5	4	imaeq2d 4688	. . . . 5 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " ( { B } i^i A ) ) = ( R " { B } ) )
6	5	ineq1d 3166	. . . 4 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( ( R " ( { B } i^i A ) ) i^i A ) = ( ( R " { B } ) i^i A ) )
7		imass2 4721	. . . . . . 7 |- ( { B } C_ A -> ( R " { B } ) C_ ( R " A ) )
8	2, 7	syl 14	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) C_ ( R " A ) )
9		simpl 107	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " A ) C_ A )
10	8, 9	sstrd 3009	. . . . 5 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) C_ A )
11		df-ss 2986	. . . . 5 |- ( ( R " { B } ) C_ A <-> ( ( R " { B } ) i^i A ) = ( R " { B } ) )
12	10, 11	sylib 120	. . . 4 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( ( R " { B } ) i^i A ) = ( R " { B } ) )
13	6, 12	eqtr2d 2114	. . 3 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) = ( ( R " ( { B } i^i A ) ) i^i A ) )
14		imainrect 4786	. . 3 |- ( ( R i^i ( A X. A ) ) " { B } ) = ( ( R " ( { B } i^i A ) ) i^i A )
15	13, 14	syl6eqr 2131	. 2 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) = ( ( R i^i ( A X. A ) ) " { B } ) )
16		df-ec 6131	. 2 |- [ B ] R = ( R " { B } )
17		df-ec 6131	. 2 |- [ B ] ( R i^i ( A X. A ) ) = ( ( R i^i ( A X. A ) ) " { B } )
18	15, 16, 17	3eqtr4g 2138	1 |- ( ( ( R " A ) C_ A /\ B e. A ) -> [ B ] R = [ B ] ( R i^i ( A X. A ) ) )

Syntax hints:   -> wi 4   /\ wa 102   = wceq 1284   e. wcel 1433   i^i cin 2972   C_ wss 2973   {csn 3398   X. cxp 4361   "cima 4366   [cec 6127

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-rel 4370  df-cnv 4371  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-ec 6131

This theorem is referenced by:  qsinxp  6205  nqnq0pi  6628