Theorem ssrnres 5171

Description: Subset of the range of a restriction. (Contributed by NM, 16-Jan-2006.)

Assertion

Ref	Expression
ssrnres	|- ( B C_ ran ( C |` A ) <-> ran ( C i^i ( A X. B ) ) = B )

Proof of Theorem ssrnres

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

Step	Hyp	Ref	Expression
1		inss2 3425	. . . . 5 |- ( C i^i ( A X. B ) ) C_ ( A X. B )
2		rnss 4954	. . . . 5 |- ( ( C i^i ( A X. B ) ) C_ ( A X. B ) -> ran ( C i^i ( A X. B ) ) C_ ran ( A X. B ) )
3	1, 2	ax-mp 5	. . . 4 |- ran ( C i^i ( A X. B ) ) C_ ran ( A X. B )
4		rnxpss 5160	. . . 4 |- ran ( A X. B ) C_ B
5	3, 4	sstri 3233	. . 3 |- ran ( C i^i ( A X. B ) ) C_ B
6		eqss 3239	. . 3 |- ( ran ( C i^i ( A X. B ) ) = B <-> ( ran ( C i^i ( A X. B ) ) C_ B /\ B C_ ran ( C i^i ( A X. B ) ) ) )
7	5, 6	mpbiran 946	. 2 |- ( ran ( C i^i ( A X. B ) ) = B <-> B C_ ran ( C i^i ( A X. B ) ) )
8		ssid 3244	. . . . . . . 8 |- A C_ A
9		ssv 3246	. . . . . . . 8 |- B C_ _V
10		xpss12 4826	. . . . . . . 8 |- ( ( A C_ A /\ B C_ _V ) -> ( A X. B ) C_ ( A X. _V ) )
11	8, 9, 10	mp2an 426	. . . . . . 7 |- ( A X. B ) C_ ( A X. _V )
12		sslin 3430	. . . . . . 7 |- ( ( A X. B ) C_ ( A X. _V ) -> ( C i^i ( A X. B ) ) C_ ( C i^i ( A X. _V ) ) )
13	11, 12	ax-mp 5	. . . . . 6 |- ( C i^i ( A X. B ) ) C_ ( C i^i ( A X. _V ) )
14		df-res 4731	. . . . . 6 |- ( C |` A ) = ( C i^i ( A X. _V ) )
15	13, 14	sseqtrri 3259	. . . . 5 |- ( C i^i ( A X. B ) ) C_ ( C |` A )
16		rnss 4954	. . . . 5 |- ( ( C i^i ( A X. B ) ) C_ ( C |` A ) -> ran ( C i^i ( A X. B ) ) C_ ran ( C |` A ) )
17	15, 16	ax-mp 5	. . . 4 |- ran ( C i^i ( A X. B ) ) C_ ran ( C |` A )
18		sstr 3232	. . . 4 |- ( ( B C_ ran ( C i^i ( A X. B ) ) /\ ran ( C i^i ( A X. B ) ) C_ ran ( C |` A ) ) -> B C_ ran ( C |` A ) )
19	17, 18	mpan2 425	. . 3 |- ( B C_ ran ( C i^i ( A X. B ) ) -> B C_ ran ( C |` A ) )
20		ssel 3218	. . . . . . 7 |- ( B C_ ran ( C |` A ) -> ( y e. B -> y e. ran ( C |` A ) ) )
21		vex 2802	. . . . . . . 8 |- y e. _V
22	21	elrn2 4966	. . . . . . 7 |- ( y e. ran ( C |` A ) <-> E. x <. x , y >. e. ( C |` A ) )
23	20, 22	imbitrdi 161	. . . . . 6 |- ( B C_ ran ( C |` A ) -> ( y e. B -> E. x <. x , y >. e. ( C |` A ) ) )
24	23	ancrd 326	. . . . 5 |- ( B C_ ran ( C |` A ) -> ( y e. B -> ( E. x <. x , y >. e. ( C |` A ) /\ y e. B ) ) )
25	21	elrn2 4966	. . . . . 6 |- ( y e. ran ( C i^i ( A X. B ) ) <-> E. x <. x , y >. e. ( C i^i ( A X. B ) ) )
26		elin 3387	. . . . . . . 8 |- ( <. x , y >. e. ( C i^i ( A X. B ) ) <-> ( <. x , y >. e. C /\ <. x , y >. e. ( A X. B ) ) )
27		opelxp 4749	. . . . . . . . 9 |- ( <. x , y >. e. ( A X. B ) <-> ( x e. A /\ y e. B ) )
28	27	anbi2i 457	. . . . . . . 8 |- ( ( <. x , y >. e. C /\ <. x , y >. e. ( A X. B ) ) <-> ( <. x , y >. e. C /\ ( x e. A /\ y e. B ) ) )
29	21	opelres 5010	. . . . . . . . . 10 |- ( <. x , y >. e. ( C |` A ) <-> ( <. x , y >. e. C /\ x e. A ) )
30	29	anbi1i 458	. . . . . . . . 9 |- ( ( <. x , y >. e. ( C |` A ) /\ y e. B ) <-> ( ( <. x , y >. e. C /\ x e. A ) /\ y e. B ) )
31		anass 401	. . . . . . . . 9 |- ( ( ( <. x , y >. e. C /\ x e. A ) /\ y e. B ) <-> ( <. x , y >. e. C /\ ( x e. A /\ y e. B ) ) )
32	30, 31	bitr2i 185	. . . . . . . 8 |- ( ( <. x , y >. e. C /\ ( x e. A /\ y e. B ) ) <-> ( <. x , y >. e. ( C |` A ) /\ y e. B ) )
33	26, 28, 32	3bitri 206	. . . . . . 7 |- ( <. x , y >. e. ( C i^i ( A X. B ) ) <-> ( <. x , y >. e. ( C |` A ) /\ y e. B ) )
34	33	exbii 1651	. . . . . 6 |- ( E. x <. x , y >. e. ( C i^i ( A X. B ) ) <-> E. x ( <. x , y >. e. ( C |` A ) /\ y e. B ) )
35		19.41v 1949	. . . . . 6 |- ( E. x ( <. x , y >. e. ( C |` A ) /\ y e. B ) <-> ( E. x <. x , y >. e. ( C |` A ) /\ y e. B ) )
36	25, 34, 35	3bitri 206	. . . . 5 |- ( y e. ran ( C i^i ( A X. B ) ) <-> ( E. x <. x , y >. e. ( C |` A ) /\ y e. B ) )
37	24, 36	imbitrrdi 162	. . . 4 |- ( B C_ ran ( C |` A ) -> ( y e. B -> y e. ran ( C i^i ( A X. B ) ) ) )
38	37	ssrdv 3230	. . 3 |- ( B C_ ran ( C |` A ) -> B C_ ran ( C i^i ( A X. B ) ) )
39	19, 38	impbii 126	. 2 |- ( B C_ ran ( C i^i ( A X. B ) ) <-> B C_ ran ( C |` A ) )
40	7, 39	bitr2i 185	1 |- ( B C_ ran ( C |` A ) <-> ran ( C i^i ( A X. B ) ) = B )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1395   E.wex 1538   e. wcel 2200   _Vcvv 2799   i^i cin 3196   C_ wss 3197   <.cop 3669   X. cxp 4717   ran crn 4720   |` cres 4721

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727  df-dm 4729  df-rn 4730  df-res 4731

This theorem is referenced by:  rninxp  5172