Theorem fvmptss2 5708

Description: A mapping always evaluates to a subset of the substituted expression in the mapping, even if this is a proper class, or we are out of the domain. (Contributed by Mario Carneiro, 13-Feb-2015.) (Revised by Mario Carneiro, 3-Jul-2019.)

Hypotheses

Ref	Expression
fvmptss2.1	|- ( x = D -> B = C )
fvmptss2.2	|- F = ( x e. A |-> B )

Assertion

Ref	Expression
fvmptss2	|- ( F ` D ) C_ C

Distinct variable groups:   x, A   x, C   x, D

Allowed substitution hints:   B( x)   F( x)

Proof of Theorem fvmptss2

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvss 5640	. 2 |- ( A. y ( D F y -> y C_ C ) -> ( F ` D ) C_ C )
2		fvmptss2.2	. . . . . 6 |- F = ( x e. A |-> B )
3	2	funmpt2 5356	. . . . 5 |- Fun F
4		funrel 5334	. . . . 5 |- ( Fun F -> Rel F )
5	3, 4	ax-mp 5	. . . 4 |- Rel F
6	5	brrelex1i 4761	. . 3 |- ( D F y -> D e. _V )
7		nfcv 2372	. . . 4 |- F/_ x D
8		nfmpt1 4176	. . . . . . 7 |- F/_ x ( x e. A |-> B )
9	2, 8	nfcxfr 2369	. . . . . 6 |- F/_ x F
10		nfcv 2372	. . . . . 6 |- F/_ x y
11	7, 9, 10	nfbr 4129	. . . . 5 |- F/ x D F y
12		nfv 1574	. . . . 5 |- F/ x y C_ C
13	11, 12	nfim 1618	. . . 4 |- F/ x ( D F y -> y C_ C )
14		breq1 4085	. . . . 5 |- ( x = D -> ( x F y <-> D F y ) )
15		fvmptss2.1	. . . . . 6 |- ( x = D -> B = C )
16	15	sseq2d 3254	. . . . 5 |- ( x = D -> ( y C_ B <-> y C_ C ) )
17	14, 16	imbi12d 234	. . . 4 |- ( x = D -> ( ( x F y -> y C_ B ) <-> ( D F y -> y C_ C ) ) )
18		df-br 4083	. . . . 5 |- ( x F y <-> <. x , y >. e. F )
19		opabid 4343	. . . . . . 7 |- ( <. x , y >. e. { <. x , y >. | ( x e. A /\ y = B ) } <-> ( x e. A /\ y = B ) )
20		eqimss 3278	. . . . . . . 8 |- ( y = B -> y C_ B )
21	20	adantl 277	. . . . . . 7 |- ( ( x e. A /\ y = B ) -> y C_ B )
22	19, 21	sylbi 121	. . . . . 6 |- ( <. x , y >. e. { <. x , y >. | ( x e. A /\ y = B ) } -> y C_ B )
23		df-mpt 4146	. . . . . . 7 |- ( x e. A |-> B ) = { <. x , y >. | ( x e. A /\ y = B ) }
24	2, 23	eqtri 2250	. . . . . 6 |- F = { <. x , y >. | ( x e. A /\ y = B ) }
25	22, 24	eleq2s 2324	. . . . 5 |- ( <. x , y >. e. F -> y C_ B )
26	18, 25	sylbi 121	. . . 4 |- ( x F y -> y C_ B )
27	7, 13, 17, 26	vtoclgf 2859	. . 3 |- ( D e. _V -> ( D F y -> y C_ C ) )
28	6, 27	mpcom 36	. 2 |- ( D F y -> y C_ C )
29	1, 28	mpg 1497	1 |- ( F ` D ) C_ C

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200   _Vcvv 2799   C_ wss 3197   <.cop 3669   class class class wbr 4082   {copab 4143   |-> cmpt 4144   Rel wrel 4723   Fun wfun 5311   ` cfv 5317

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 4201  ax-pow 4257  ax-pr 4292

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-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-iota 5277  df-fun 5319  df-fv 5325

This theorem is referenced by:  mptfvex  5719