Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fnfvrnss | Structured version Visualization version GIF version |
Description: An upper bound for range determined by function values. (Contributed by NM, 8-Oct-2004.) |
Ref | Expression |
---|---|
fnfvrnss | ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → ran 𝐹 ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffnfv 6876 | . 2 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵)) | |
2 | frn 6514 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵) | |
3 | 1, 2 | sylbir 237 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → ran 𝐹 ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2110 ∀wral 3138 ⊆ wss 3935 ran crn 5550 Fn wfn 6344 ⟶wf 6345 ‘cfv 6349 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-fv 6357 |
This theorem is referenced by: ffvresb 6882 dffi3 8889 infxpenlem 9433 alephsing 9692 seqexw 13379 srgfcl 19259 mplind 20276 1stckgenlem 22155 psmetxrge0 22917 plyreres 24866 aannenlem1 24911 subuhgr 27062 subupgr 27063 subumgr 27064 subusgr 27065 rmulccn 31166 esumfsup 31324 sxbrsigalem3 31525 sitgf 31600 ctbssinf 34681 dihf11lem 38396 hdmaprnN 38994 hgmaprnN 39031 ntrrn 40465 mnurndlem1 40610 volicoff 42274 dirkercncflem2 42383 fourierdlem15 42401 fourierdlem42 42428 |
Copyright terms: Public domain | W3C validator |