![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dmfex | Structured version Visualization version GIF version |
Description: If a mapping is a set, its domain is a set. (Contributed by NM, 27-Aug-2006.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Ref | Expression |
---|---|
dmfex | ⊢ ((𝐹 ∈ 𝐶 ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fdm 6678 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
2 | dmexg 7841 | . . . 4 ⊢ (𝐹 ∈ 𝐶 → dom 𝐹 ∈ V) | |
3 | eleq1 2822 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (dom 𝐹 ∈ V ↔ 𝐴 ∈ V)) | |
4 | 2, 3 | imbitrid 243 | . . 3 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∈ 𝐶 → 𝐴 ∈ V)) |
5 | 1, 4 | syl 17 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ∈ 𝐶 → 𝐴 ∈ V)) |
6 | 5 | impcom 409 | 1 ⊢ ((𝐹 ∈ 𝐶 ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3444 dom cdm 5634 ⟶wf 6493 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5257 ax-nul 5264 ax-pr 5385 ax-un 7673 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-rab 3407 df-v 3446 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-br 5107 df-opab 5169 df-cnv 5642 df-dm 5644 df-rn 5645 df-fn 6500 df-f 6501 |
This theorem is referenced by: wemoiso 7907 mapfset 8791 mapfoss 8793 fopwdom 9027 fowdom 9512 wdomfil 10002 fin23lem17 10279 fin23lem32 10285 fin23lem39 10291 enfin1ai 10325 fin1a2lem7 10347 symgbasmap 19163 lindfmm 21249 kelac1 41433 |
Copyright terms: Public domain | W3C validator |