Theorem relfvssunirn 5711

Description: The result of a function value is always a subset of the union of the range, even if it is invalid and thus empty. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Revised by Mario Carneiro, 24-May-2019.)

Assertion

Ref	Expression
relfvssunirn	|- ( Rel F -> ( F ` A ) C_ U. ran F )

Proof of Theorem relfvssunirn

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		relelrn 5018	. . . . 5 |- ( ( Rel F /\ A F x ) -> x e. ran F )
2	1	ex 115	. . . 4 |- ( Rel F -> ( A F x -> x e. ran F ) )
3		elssuni 3963	. . . 4 |- ( x e. ran F -> x C_ U. ran F )
4	2, 3	syl6 33	. . 3 |- ( Rel F -> ( A F x -> x C_ U. ran F ) )
5	4	alrimiv 1927	. 2 |- ( Rel F -> A. x ( A F x -> x C_ U. ran F ) )
6		fvss 5709	. 2 |- ( A. x ( A F x -> x C_ U. ran F ) -> ( F ` A ) C_ U. ran F )
7	5, 6	syl 14	1 |- ( Rel F -> ( F ` A ) C_ U. ran F )

This proof depends on syntax axioms:   -> wi 4   A.wal 1400   e. wcel 2209   C_ wss 3220   U.cuni 3935   class class class wbr 4130   ran crn 4775   Rel wrel 4779   ` 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-v 2823  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-xp 4780  df-rel 4781  df-cnv 4782  df-dm 4784  df-rn 4785  df-iota 5337  df-fv 5385

This theorem is used by:  relrnfvex  5713