![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mapfset | Structured version Visualization version GIF version |
Description: If 𝐵 is a set, the value of the set exponentiation (𝐵 ↑m 𝐴) is the class of all functions from 𝐴 to 𝐵. Generalisation of mapvalg 8830 (which does not require ax-rep 5286) to arbitrary domains. Note that the class {𝑓 ∣ 𝑓:𝐴⟶𝐵} can only contain set-functions, as opposed to arbitrary class-functions. When 𝐴 is a proper class, there can be no set-functions on it, so the above class is empty (see also fsetdmprc0 8849), hence a set. In this case, both sides of the equality in this theorem are the empty set. (Contributed by AV, 8-Aug-2024.) |
Ref | Expression |
---|---|
mapfset | ⊢ (𝐵 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴⟶𝐵} = (𝐵 ↑m 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3479 | . . . 4 ⊢ 𝑚 ∈ V | |
2 | feq1 6699 | . . . 4 ⊢ (𝑓 = 𝑚 → (𝑓:𝐴⟶𝐵 ↔ 𝑚:𝐴⟶𝐵)) | |
3 | 1, 2 | elab 3669 | . . 3 ⊢ (𝑚 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↔ 𝑚:𝐴⟶𝐵) |
4 | simpr 486 | . . . . . . 7 ⊢ ((𝑚:𝐴⟶𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ 𝑉) | |
5 | dmfex 7898 | . . . . . . . . 9 ⊢ ((𝑚 ∈ V ∧ 𝑚:𝐴⟶𝐵) → 𝐴 ∈ V) | |
6 | 1, 5 | mpan 689 | . . . . . . . 8 ⊢ (𝑚:𝐴⟶𝐵 → 𝐴 ∈ V) |
7 | 6 | adantr 482 | . . . . . . 7 ⊢ ((𝑚:𝐴⟶𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) |
8 | 4, 7 | elmapd 8834 | . . . . . 6 ⊢ ((𝑚:𝐴⟶𝐵 ∧ 𝐵 ∈ 𝑉) → (𝑚 ∈ (𝐵 ↑m 𝐴) ↔ 𝑚:𝐴⟶𝐵)) |
9 | 8 | exbiri 810 | . . . . 5 ⊢ (𝑚:𝐴⟶𝐵 → (𝐵 ∈ 𝑉 → (𝑚:𝐴⟶𝐵 → 𝑚 ∈ (𝐵 ↑m 𝐴)))) |
10 | 9 | pm2.43b 55 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (𝑚:𝐴⟶𝐵 → 𝑚 ∈ (𝐵 ↑m 𝐴))) |
11 | elmapi 8843 | . . . 4 ⊢ (𝑚 ∈ (𝐵 ↑m 𝐴) → 𝑚:𝐴⟶𝐵) | |
12 | 10, 11 | impbid1 224 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (𝑚:𝐴⟶𝐵 ↔ 𝑚 ∈ (𝐵 ↑m 𝐴))) |
13 | 3, 12 | bitrid 283 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝑚 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↔ 𝑚 ∈ (𝐵 ↑m 𝐴))) |
14 | 13 | eqrdv 2731 | 1 ⊢ (𝐵 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴⟶𝐵} = (𝐵 ↑m 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 {cab 2710 Vcvv 3475 ⟶wf 6540 (class class class)co 7409 ↑m cmap 8820 |
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-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 |
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-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-map 8822 |
This theorem is referenced by: mapssfset 8845 fsetex 8850 |
Copyright terms: Public domain | W3C validator |