![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fnrnfv | GIF version |
Description: The range of a function expressed as a collection of the function's values. (Contributed by NM, 20-Oct-2005.) (Proof shortened by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
fnrnfv | ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dffn5im 5603 | . . 3 ⊢ (𝐹 Fn 𝐴 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) | |
2 | 1 | rneqd 4892 | . 2 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
3 | eqid 2193 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) | |
4 | 3 | rnmpt 4911 | . 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} |
5 | 2, 4 | eqtrdi 2242 | 1 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 {cab 2179 ∃wrex 2473 ↦ cmpt 4091 ran crn 4661 Fn wfn 5250 ‘cfv 5255 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-v 2762 df-sbc 2987 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-iota 5216 df-fun 5257 df-fn 5258 df-fv 5263 |
This theorem is referenced by: fvelrnb 5605 fniinfv 5616 dffo3 5706 fniunfv 5806 fnrnov 6066 |
Copyright terms: Public domain | W3C validator |