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

Theorem pmvalg 8835
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 4035 . . 3 {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴)
2 xpexg 7750 . . . . 5 ((𝐵𝐷𝐴𝐶) → (𝐵 × 𝐴) ∈ V)
32ancoms 463 . . . 4 ((𝐴𝐶𝐵𝐷) → (𝐵 × 𝐴) ∈ V)
43pwexd 5352 . . 3 ((𝐴𝐶𝐵𝐷) → 𝒫 (𝐵 × 𝐴) ∈ V)
5 ssexg 5291 . . 3 (({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ⊆ 𝒫 (𝐵 × 𝐴) ∧ 𝒫 (𝐵 × 𝐴) ∈ V) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
61, 4, 5sylancr 598 . 2 ((𝐴𝐶𝐵𝐷) → {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V)
7 elex 3476 . . 3 (𝐴𝐶𝐴 ∈ V)
8 elex 3476 . . 3 (𝐵𝐷𝐵 ∈ V)
9 xpeq2 5684 . . . . . . 7 (𝑥 = 𝐴 → (𝑦 × 𝑥) = (𝑦 × 𝐴))
109pweqd 4580 . . . . . 6 (𝑥 = 𝐴 → 𝒫 (𝑦 × 𝑥) = 𝒫 (𝑦 × 𝐴))
1110rabeqdv 3431 . . . . 5 (𝑥 = 𝐴 → {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓})
12 xpeq1 5677 . . . . . . 7 (𝑦 = 𝐵 → (𝑦 × 𝐴) = (𝐵 × 𝐴))
1312pweqd 4580 . . . . . 6 (𝑦 = 𝐵 → 𝒫 (𝑦 × 𝐴) = 𝒫 (𝐵 × 𝐴))
1413rabeqdv 3431 . . . . 5 (𝑦 = 𝐵 → {𝑓 ∈ 𝒫 (𝑦 × 𝐴) ∣ Fun 𝑓} = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
15 df-pm 8828 . . . . 5 pm = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓})
1611, 14, 15ovmpog 7571 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V) → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
17163expia 1139 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
187, 8, 17syl2an 607 . 2 ((𝐴𝐶𝐵𝐷) → ({𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓} ∈ V → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓}))
196, 18mpd 16 1 ((𝐴𝐶𝐵𝐷) → (𝐴pm 𝐵) = {𝑓 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑓})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  {crab 3416  Vcvv 3455  wss 3906  𝒫 cpw 4563   × cxp 5661  Fun wfun 6532  (class class class)co 7412  pm cpm 8826
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-pm 8828
This theorem is referenced by:  elpmg  8841
  Copyright terms: Public domain W3C validator