MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pmvalg Structured version   Visualization version   GIF version

Theorem pmvalg 8814
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.
StepHypRef Expression
1 ssrab2 4033 . . 3 {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴)
2 xpexg 7729 . . . . 5 ((𝐵𝐷𝐴𝐶) → (𝐵 × 𝐴) ∈ V)
32ancoms 462 . . . 4 ((𝐴𝐶𝐵𝐷) → (𝐵 × 𝐴) ∈ V)
43pwexd 5335 . . 3 ((𝐴𝐶𝐵𝐷) → 𝒫 (𝐵 × 𝐴) ∈ V)
5 ssexg 5278 . . 3 (({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴) ∧ 𝒫 (𝐵 × 𝐴) ∈ V) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
61, 4, 5sylancr 596 . 2 ((𝐴𝐶𝐵𝐷) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
7 elex 3474 . . 3 (𝐴𝐶𝐴 ∈ V)
8 elex 3474 . . 3 (𝐵𝐷𝐵 ∈ V)
9 xpeq2 5666 . . . . . . 7 (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
109pweqd 4571 . . . . . 6 (𝑥 = 𝐴 → 𝒫 (𝑦 × 𝑥) = 𝒫 (𝑦 × 𝐴))
1110rabeqdv 3428 . . . . 5 (𝑥 = 𝐴 → {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓})
12 xpeq1 5659 . . . . . . 7 (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
1312pweqd 4571 . . . . . 6 (𝑦 = 𝐵 → 𝒫 (𝑦 × 𝐴) = 𝒫 (𝐵 × 𝐴))
1413rabeqdv 3428 . . . . 5 (𝑦 = 𝐵 → {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
15 df-pm 8806 . . . . 5 pm = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓})
1611, 14, 15ovmpog 7551 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V) → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
17163expia 1133 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
187, 8, 17syl2an 605 . 2 ((𝐴𝐶𝐵𝐷) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
196, 18mpd 15 1 ((𝐴𝐶𝐵𝐷) → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  {crab 3413  Vcvv 3453  wss 3904  𝒫 cpw 4554   × cxp 5643  Fun wfun 6511  (class class class)co 7392  pm cpm 8804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-iota 6473  df-fun 6519  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-pm 8806
This theorem is referenced by:  elpmg  8820
  Copyright terms: Public domain W3C validator