Theorem relmptopab 6291

Description: Any function to sets of ordered pairs produces a relation on function value unconditionally. (Contributed by Mario Carneiro, 7-Aug-2014.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)

Hypothesis

Ref	Expression
relmptopab.1	|- F = ( x e. A |-> { <. y , z >. | ph } )

Assertion

Ref	Expression
relmptopab	|- Rel ( F ` B )

Distinct variable group:   x, A

Allowed substitution hints:   ph( x, y, z)   A( y, z)   B( x, y, z)   F( x, y, z)

Proof of Theorem relmptopab

Dummy variable r is distinct from all other variables.

Step	Hyp	Ref	Expression
1		relmptopab.1	. . . . . . . 8 |- F = ( x e. A |-> { <. y , z >. | ph } )
2	1	funmpt2 5416	. . . . . . 7 |- Fun F
3		funrel 5394	. . . . . . 7 |- ( Fun F -> Rel F )
4	2, 3	ax-mp 5	. . . . . 6 |- Rel F
5		relelfvdm 5727	. . . . . 6 |- ( ( Rel F /\ r e. ( F ` B ) ) -> B e. dom F )
6	4, 5	mpan 428	. . . . 5 |- ( r e. ( F ` B ) -> B e. dom F )
7		relopab 4906	. . . . . . 7 |- Rel { <. y , z >. | ph }
8		df-rel 4781	. . . . . . 7 |- ( Rel { <. y , z >. | ph } <-> { <. y , z >. | ph } C_ ( _V X. _V ) )
9	7, 8	mpbi 145	. . . . . 6 |- { <. y , z >. | ph } C_ ( _V X. _V )
10	9	rgenw 2605	. . . . 5 |- A. x e. A { <. y , z >. | ph } C_ ( _V X. _V )
11	1	fvmptssdm 5790	. . . . 5 |- ( ( B e. dom F /\ A. x e. A { <. y , z >. | ph } C_ ( _V X. _V ) ) -> ( F ` B ) C_ ( _V X. _V ) )
12	6, 10, 11	sylancl 417	. . . 4 |- ( r e. ( F ` B ) -> ( F ` B ) C_ ( _V X. _V ) )
13		ssel 3242	. . . 4 |- ( ( F ` B ) C_ ( _V X. _V ) -> ( r e. ( F ` B ) -> r e. ( _V X. _V ) ) )
14	12, 13	mpcom 36	. . 3 |- ( r e. ( F ` B ) -> r e. ( _V X. _V ) )
15	14	ssriv 3252	. 2 |- ( F ` B ) C_ ( _V X. _V )
16		df-rel 4781	. 2 |- ( Rel ( F ` B ) <-> ( F ` B ) C_ ( _V X. _V ) )
17	15, 16	mpbir 146	1 |- Rel ( F ` B )

This proof depends on syntax axioms:   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   C_ wss 3220   {copab 4191   |-> cmpt 4192   X. cxp 4772   dom cdm 4774   Rel wrel 4779   Fun wfun 5371   ` cfv 5377

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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fv 5385

This theorem is used by:  reldvdsr  14398  lmrel  15292  relwlk  16588  reltrls  16623  releupth  16685