Theorem mapex 8414

Description: The class of all functions mapping one set to another is a set. Remark after Definition 10.24 of [Kunen] p. 31. (Contributed by Raph Levien, 4-Dec-2003.)

Assertion

Ref	Expression
mapex	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

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

Proof of Theorem mapex

Step	Hyp	Ref	Expression
1		fssxp 6536	. . . 4 ⊢ (𝑓:𝐴⟶𝐵 → 𝑓 ⊆ (𝐴 × 𝐵))
2	1	ss2abi 4045	. . 3 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ {𝑓 ∣ 𝑓 ⊆ (𝐴 × 𝐵)}
3		df-pw 4543	. . 3 ⊢ 𝒫 (𝐴 × 𝐵) = {𝑓 ∣ 𝑓 ⊆ (𝐴 × 𝐵)}
4	2, 3	sseqtrri 4006	. 2 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ 𝒫 (𝐴 × 𝐵)
5		xpexg 7475	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V)
6	5	pwexd 5282	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝒫 (𝐴 × 𝐵) ∈ V)
7		ssexg 5229	. 2 ⊢ (({𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)
8	4, 6, 7	sylancr 589	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)

Syntax hints:   → wi 4   ∧ wa 398   ∈ wcel 2114  {cab 2801  Vcvv 3496   ⊆ wss 3938  𝒫 cpw 4541   × cxp 5555  ⟶wf 6353

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-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  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-br 5069  df-opab 5131  df-xp 5563  df-rel 5564  df-cnv 5565  df-dm 5567  df-rn 5568  df-fun 6359  df-fn 6360  df-f 6361

This theorem is referenced by:  fnmap  8415  mapvalg  8418  isghm  18360  permsetex  18500  wksfval  27393  measbase  31458  measval  31459  ismeas  31460  isrnmeas  31461  cnfex  41292  opabresexd  43493  upwlksfval  44017