Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fnex | Structured version Visualization version GIF version |
Description: If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of resfunexg 6981. See fnexALT 7655 for alternate proof. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Ref | Expression |
---|---|
fnex | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnrel 6457 | . 2 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹) | |
2 | df-fn 6361 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
3 | eleq1a 2911 | . . . . . 6 ⊢ (𝐴 ∈ 𝐵 → (dom 𝐹 = 𝐴 → dom 𝐹 ∈ 𝐵)) | |
4 | 3 | impcom 410 | . . . . 5 ⊢ ((dom 𝐹 = 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵) |
5 | resfunexg 6981 | . . . . 5 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) | |
6 | 4, 5 | sylan2 594 | . . . 4 ⊢ ((Fun 𝐹 ∧ (dom 𝐹 = 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐹 ↾ dom 𝐹) ∈ V) |
7 | 6 | anassrs 470 | . . 3 ⊢ (((Fun 𝐹 ∧ dom 𝐹 = 𝐴) ∧ 𝐴 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) |
8 | 2, 7 | sylanb 583 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) |
9 | resdm 5900 | . . . 4 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) | |
10 | 9 | eleq1d 2900 | . . 3 ⊢ (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ∈ V ↔ 𝐹 ∈ V)) |
11 | 10 | biimpa 479 | . 2 ⊢ ((Rel 𝐹 ∧ (𝐹 ↾ dom 𝐹) ∈ V) → 𝐹 ∈ V) |
12 | 1, 8, 11 | syl2an2r 683 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 Vcvv 3497 dom cdm 5558 ↾ cres 5560 Rel wrel 5563 Fun wfun 6352 Fn wfn 6353 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 |
This theorem is referenced by: fnexd 6984 funex 6985 fex 6992 offval 7419 ofrfval 7420 suppvalfn 7840 suppfnss 7858 fnsuppeq0 7861 wfrlem15 7972 fndmeng 8590 fdmfifsupp 8846 cfsmolem 9695 axcc2lem 9861 unirnfdomd 9992 prdsbas2 16745 prdsplusgval 16749 prdsmulrval 16751 prdsleval 16753 prdsdsval 16754 prdsvscaval 16755 xpscf 16841 brssc 17087 sscpwex 17088 ssclem 17092 isssc 17093 rescval2 17101 reschom 17103 rescabs 17106 isfuncd 17138 dprdw 19135 prdsmgp 19363 dsmmbas2 20884 dsmmelbas 20886 ptval 22181 elptr 22184 prdstopn 22239 qtoptop 22311 imastopn 22331 fnpreimac 30419 suppss3 30463 ofcfval 31361 dya2iocuni 31545 trpredex 33080 stoweidlem27 42319 stoweidlem59 42351 omeiunle 42806 preimafvelsetpreimafv 43555 fundcmpsurinjlem2 43566 |
Copyright terms: Public domain | W3C validator |