Theorem mapvalg 8769

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 7880	. . 3 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴 ∈ 𝐶) → {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V)
2	1	ancoms 458	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V)
3		elex 3458	. . 3 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ V)
4		elex 3458	. . 3 ⊢ (𝐵 ∈ 𝐷 → 𝐵 ∈ V)
5		feq3 6639	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑓:𝑦⟶𝑥 ↔ 𝑓:𝑦⟶𝐴))
6	5	abbidv 2799	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑓 ∣ 𝑓:𝑦⟶𝑥} = {𝑓 ∣ 𝑓:𝑦⟶𝐴})
7		feq2 6638	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑓:𝑦⟶𝐴 ↔ 𝑓:𝐵⟶𝐴))
8	7	abbidv 2799	. . . . 5 ⊢ (𝑦 = 𝐵 → {𝑓 ∣ 𝑓:𝑦⟶𝐴} = {𝑓 ∣ 𝑓:𝐵⟶𝐴})
9		df-map 8761	. . . . 5 ⊢ ↑m = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∣ 𝑓:𝑦⟶𝑥})
10	6, 8, 9	ovmpog 7514	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ {𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V) → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴})
11	10	3expia 1121	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ({𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴}))
12	3, 4, 11	syl2an 596	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝑓 ∣ 𝑓:𝐵⟶𝐴} ∈ V → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴}))
13	2, 12	mpd 15	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ↑m 𝐵) = {𝑓 ∣ 𝑓:𝐵⟶𝐴})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  {cab 2711  Vcvv 3437  ⟶wf 6485  (class class class)co 7355   ↑_m cmap 8759

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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-map 8761

This theorem is referenced by:  mapval  8771  elmapg  8772  ixpconstg  8840  hashf1lem2  14370  efmndbasabf  18788  symgbasfi  19299  birthdaylem1  26908  birthdaylem2  26909  cnfex  45189