Theorem mapex 8830

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 6746	. . . 4 ⊢ (𝑓:𝐴⟶𝐵 → 𝑓 ⊆ (𝐴 × 𝐵))
2	1	ss2abi 4064	. . 3 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ {𝑓 ∣ 𝑓 ⊆ (𝐴 × 𝐵)}
3		df-pw 4605	. . 3 ⊢ 𝒫 (𝐴 × 𝐵) = {𝑓 ∣ 𝑓 ⊆ (𝐴 × 𝐵)}
4	2, 3	sseqtrri 4020	. 2 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ 𝒫 (𝐴 × 𝐵)
5		xpexg 7741	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 × 𝐵) ∈ V)
6	5	pwexd 5378	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝒫 (𝐴 × 𝐵) ∈ V)
7		ssexg 5324	. 2 ⊢ (({𝑓 ∣ 𝑓:𝐴⟶𝐵} ⊆ 𝒫 (𝐴 × 𝐵) ∧ 𝒫 (𝐴 × 𝐵) ∈ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)
8	4, 6, 7	sylancr 585	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V)

Syntax hints:   → wi 4   ∧ wa 394   ∈ wcel 2104  {cab 2707  Vcvv 3472   ⊆ wss 3949  𝒫 cpw 4603   × cxp 5675  ⟶wf 6540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7729

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  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-br 5150  df-opab 5212  df-xp 5683  df-rel 5684  df-cnv 5685  df-dm 5687  df-rn 5688  df-fun 6546  df-fn 6547  df-f 6548

This theorem is referenced by:  fnmap  8831  mapvalg  8834  isghm  19132  permsetexOLD  19280  wksfval  29131  measbase  33491  measval  33492  ismeas  33493  isrnmeas  33494  sticksstones4  41273  sticksstones14  41284  sticksstones20  41290  cnfex  44016  opabresexd  46295  upwlksfval  46813