Theorem ecinxp 7822

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 477	. . . . . . . 8 |- ( ( ( R " A ) C_ A /\ B e. A ) -> B e. A )
2	1	snssd 4340	. . . . . . 7 |- ( ( ( R " A ) C_ A /\ B e. A ) -> { B } C_ A )
3		df-ss 3588	. . . . . . 7 |- ( { B } C_ A <-> ( { B } i^i A ) = { B } )
4	2, 3	sylib 208	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( { B } i^i A ) = { B } )
5	4	imaeq2d 5466	. . . . 5 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " ( { B } i^i A ) ) = ( R " { B } ) )
6	5	ineq1d 3813	. . . 4 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( ( R " ( { B } i^i A ) ) i^i A ) = ( ( R " { B } ) i^i A ) )
7		imass2 5501	. . . . . . 7 |- ( { B } C_ A -> ( R " { B } ) C_ ( R " A ) )
8	2, 7	syl 17	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) C_ ( R " A ) )
9		simpl 473	. . . . . 6 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " A ) C_ A )
10	8, 9	sstrd 3613	. . . . 5 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) C_ A )
11		df-ss 3588	. . . . 5 |- ( ( R " { B } ) C_ A <-> ( ( R " { B } ) i^i A ) = ( R " { B } ) )
12	10, 11	sylib 208	. . . 4 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( ( R " { B } ) i^i A ) = ( R " { B } ) )
13	6, 12	eqtr2d 2657	. . 3 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) = ( ( R " ( { B } i^i A ) ) i^i A ) )
14		imainrect 5575	. . 3 |- ( ( R i^i ( A X. A ) ) " { B } ) = ( ( R " ( { B } i^i A ) ) i^i A )
15	13, 14	syl6eqr 2674	. 2 |- ( ( ( R " A ) C_ A /\ B e. A ) -> ( R " { B } ) = ( ( R i^i ( A X. A ) ) " { B } ) )
16		df-ec 7744	. 2 |- [ B ] R = ( R " { B } )
17		df-ec 7744	. 2 |- [ B ] ( R i^i ( A X. A ) ) = ( ( R i^i ( A X. A ) ) " { B } )
18	15, 16, 17	3eqtr4g 2681	1 |- ( ( ( R " A ) C_ A /\ B e. A ) -> [ B ] R = [ B ] ( R i^i ( A X. A ) ) )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   i^i cin 3573   C_ wss 3574   {csn 4177   X. cxp 5112   "cima 5117   [cec 7740

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  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  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-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ec 7744

This theorem is referenced by:  qsinxp  7823  qusin  16204  pi1addval  22848  pi1grplem  22849