Theorem pmvalg 6906

Description: The value of the partial mapping operation. (𝐴 ↑_pm 𝐵) is the set of all partial functions that map from 𝐵 to 𝐴. (Contributed by NM, 15-Nov-2007.) (Revised by Mario Carneiro, 8-Sep-2013.)

Assertion

Ref	Expression
pmvalg	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ↑pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

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

Proof of Theorem pmvalg

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

Step	Hyp	Ref	Expression
1		ssrab2 3327	. . 3 ⊢ {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴)
2		xpexg 4869	. . . . 5 ⊢ ((𝐵 ∈ 𝐷 ∧ 𝐴 ∈ 𝐶) → (𝐵 × 𝐴) ∈ V)
3	2	ancoms 268	. . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐵 × 𝐴) ∈ V)
4		pwexg 4298	. . . 4 ⊢ ((𝐵 × 𝐴) ∈ V → 𝒫 (𝐵 × 𝐴) ∈ V)
5	3, 4	syl 14	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 𝒫 (𝐵 × 𝐴) ∈ V)
6		ssexg 4254	. . 3 ⊢ (({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴) ∧ 𝒫 (𝐵 × 𝐴) ∈ V) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
7	1, 5, 6	sylancr 414	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
8		elex 2827	. . 3 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ V)
9		elex 2827	. . 3 ⊢ (𝐵 ∈ 𝐷 → 𝐵 ∈ V)
10		xpeq2 4769	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
11	10	pweqd 3679	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝒫 (𝑦 × 𝑥) = 𝒫 (𝑦 × 𝐴))
12		rabeq 2807	. . . . . 6 ⊢ (𝒫 (𝑦 × 𝑥) = 𝒫 (𝑦 × 𝐴) → {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓})
13	11, 12	syl 14	. . . . 5 ⊢ (𝑥 = 𝐴 → {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓})
14		xpeq1 4768	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
15	14	pweqd 3679	. . . . . 6 ⊢ (𝑦 = 𝐵 → 𝒫 (𝑦 × 𝐴) = 𝒫 (𝐵 × 𝐴))
16		rabeq 2807	. . . . . 6 ⊢ (𝒫 (𝑦 × 𝐴) = 𝒫 (𝐵 × 𝐴) → {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
17	15, 16	syl 14	. . . . 5 ⊢ (𝑦 = 𝐵 → {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
18		df-pm 6898	. . . . 5 ⊢ ↑pm = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓})
19	13, 17, 18	ovmpog 6196	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V) → (𝐴 ↑pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
20	19	3expia 1232	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴 ↑pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
21	8, 9, 20	syl2an 289	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴 ↑pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
22	7, 21	mpd 13	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ↑pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205  {crab 2526  Vcvv 2815   ⊆ wss 3214  𝒫 cpw 3674   × cxp 4752  Fun wfun 5351  (class class class)co 6058   ↑_pm cpm 6896

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pm 6898

This theorem is referenced by:  elpmg  6911