Theorem mapvalg 8773

Description: The value of set exponentiation. (𝐴 ↑_m 𝐵) is the set of all functions that map from 𝐵 to 𝐴. Definition 10.24 of [Kunen] p. 24. (Contributed by NM, 8-Dec-2003.) (Revised by Mario Carneiro, 8-Sep-2013.)

Assertion

Ref	Expression
mapvalg	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴})

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Allowed substitution hints:   𝐶(𝑓)   𝐷(𝑓)

Proof of Theorem mapvalg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapex 7881	. . 3 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴 ∈ 𝐶) → {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V)
2	1	ancoms 459	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V)
3		elex 3452	. . 3 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ V)
4		elex 3452	. . 3 ⊢ (𝐵 ∈ 𝐷 → 𝐵 ∈ V)
5		feq3 6635	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑓:𝑦⟶𝑥 ↔ 𝑓:𝑦⟶𝐴))
6	5	abbidv 2805	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑓 ∣ 𝑓:𝑦⟶𝑥} = {𝑓 ∣ 𝑓:𝑦⟶𝐴})
7		feq2 6634	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑓:𝑦⟶𝐴 ↔ 𝑓:𝐵⟶𝐴))
8	7	abbidv 2805	. . . . 5 ⊢ (𝑦 = 𝐵 → {𝑓 ∣ 𝑓:𝑦⟶𝐴} = {𝑓 ∣ 𝑓:𝐵⟶𝐴})
9		df-map 8765	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
10	6, 8, 9	ovmpog 7515	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V) → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴})
11	10	3expia 1127	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ({𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴}))
12	3, 4, 11	syl2an 602	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴}))
13	2, 12	mpd 15	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴})

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {cab 2717  Vcvv 3431  ⟶wf 6481  (class class class)co 7356   ↑_m cmap 8763

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8765

This theorem is referenced by:  mapval  8775  elmapg  8776  ixpconstg  8844  hashf1lem2  14409  efmndbasabf  18831  symgbasfi  19345  birthdaylem1  26933  birthdaylem2  26934  cnfex  45476