Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elmapfun | Structured version Visualization version GIF version |
Description: A mapping is always a function. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Stefan O'Rear, 5-May-2015.) |
Ref | Expression |
---|---|
elmapfun | ⊢ (𝐴 ∈ (𝐵 ↑m 𝐶) → Fun 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elmapi 8430 | . 2 ⊢ (𝐴 ∈ (𝐵 ↑m 𝐶) → 𝐴:𝐶⟶𝐵) | |
2 | 1 | ffund 6520 | 1 ⊢ (𝐴 ∈ (𝐵 ↑m 𝐶) → Fun 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2114 Fun wfun 6351 (class class class)co 7158 ↑m cmap 8408 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-1st 7691 df-2nd 7692 df-map 8410 |
This theorem is referenced by: fsfnn0gsumfsffz 19105 ltbwe 20255 frlmbas 20901 islindf4 20984 mbfmfun 31514 eulerpartgbij 31632 uncf 34873 pwfi2f1o 39703 hoicvr 42837 ovnovollem1 42945 ovnovollem2 42946 domnmsuppn0 44424 rmsuppss 44425 mndpsuppss 44426 scmsuppss 44427 lincext2 44517 |
Copyright terms: Public domain | W3C validator |