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 6479. See fnexALT 7132 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 5989 | . . 3 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹) | |
2 | 1 | adantr 481 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → Rel 𝐹) |
3 | df-fn 5891 | . . 3 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
4 | eleq1a 2696 | . . . . . 6 ⊢ (𝐴 ∈ 𝐵 → (dom 𝐹 = 𝐴 → dom 𝐹 ∈ 𝐵)) | |
5 | 4 | impcom 446 | . . . . 5 ⊢ ((dom 𝐹 = 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵) |
6 | resfunexg 6479 | . . . . 5 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) | |
7 | 5, 6 | sylan2 491 | . . . 4 ⊢ ((Fun 𝐹 ∧ (dom 𝐹 = 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐹 ↾ dom 𝐹) ∈ V) |
8 | 7 | anassrs 680 | . . 3 ⊢ (((Fun 𝐹 ∧ dom 𝐹 = 𝐴) ∧ 𝐴 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) |
9 | 3, 8 | sylanb 489 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 ↾ dom 𝐹) ∈ V) |
10 | resdm 5441 | . . . 4 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) | |
11 | 10 | eleq1d 2686 | . . 3 ⊢ (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ∈ V ↔ 𝐹 ∈ V)) |
12 | 11 | biimpa 501 | . 2 ⊢ ((Rel 𝐹 ∧ (𝐹 ↾ dom 𝐹) ∈ V) → 𝐹 ∈ V) |
13 | 2, 9, 12 | syl2anc 693 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 dom cdm 5114 ↾ cres 5116 Rel wrel 5119 Fun wfun 5882 Fn wfn 5883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 |
This theorem is referenced by: funex 6482 fex 6490 offval 6904 ofrfval 6905 suppvalfn 7302 suppfnss 7320 fnsuppeq0 7323 wfrlem15 7429 fndmeng 8034 fdmfifsupp 8285 cfsmolem 9092 axcc2lem 9258 unirnfdomd 9389 prdsbas2 16129 prdsplusgval 16133 prdsmulrval 16135 prdsleval 16137 prdsdsval 16138 prdsvscaval 16139 brssc 16474 sscpwex 16475 ssclem 16479 isssc 16480 rescval2 16488 reschom 16490 rescabs 16493 isfuncd 16525 dprdw 18409 prdsmgp 18610 dsmmbas2 20081 dsmmelbas 20083 ptval 21373 elptr 21376 prdstopn 21431 qtoptop 21503 imastopn 21523 suppss3 29502 ofcfval 30160 dya2iocuni 30345 trpredex 31737 fnexd 39323 stoweidlem27 40244 stoweidlem59 40276 omeiunle 40731 |
Copyright terms: Public domain | W3C validator |