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

Theorem pmvalg 7421
Description: The value of the partial mapping operation.  ( A  ^pm  B ) is the set of all partial functions that map from  B to  A. (Contributed by NM, 15-Nov-2007.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
pmvalg  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A  ^pm  B
)  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } )
Distinct variable groups:    A, f    B, f
Allowed substitution hints:    C( f)    D( f)

Proof of Theorem pmvalg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrab2 3578 . . 3  |-  { f  e.  ~P ( B  X.  A )  |  Fun  f }  C_  ~P ( B  X.  A
)
2 xpexg 6702 . . . . 5  |-  ( ( B  e.  D  /\  A  e.  C )  ->  ( B  X.  A
)  e.  _V )
32ancoms 453 . . . 4  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( B  X.  A
)  e.  _V )
4 pwexg 4624 . . . 4  |-  ( ( B  X.  A )  e.  _V  ->  ~P ( B  X.  A
)  e.  _V )
53, 4syl 16 . . 3  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ~P ( B  X.  A )  e.  _V )
6 ssexg 4586 . . 3  |-  ( ( { f  e.  ~P ( B  X.  A
)  |  Fun  f }  C_  ~P ( B  X.  A )  /\  ~P ( B  X.  A
)  e.  _V )  ->  { f  e.  ~P ( B  X.  A
)  |  Fun  f }  e.  _V )
71, 5, 6sylancr 663 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  { f  e.  ~P ( B  X.  A
)  |  Fun  f }  e.  _V )
8 elex 3115 . . 3  |-  ( A  e.  C  ->  A  e.  _V )
9 elex 3115 . . 3  |-  ( B  e.  D  ->  B  e.  _V )
10 xpeq2 5007 . . . . . . 7  |-  ( x  =  A  ->  (
y  X.  x )  =  ( y  X.  A ) )
1110pweqd 4008 . . . . . 6  |-  ( x  =  A  ->  ~P ( y  X.  x
)  =  ~P (
y  X.  A ) )
12 rabeq 3100 . . . . . 6  |-  ( ~P ( y  X.  x
)  =  ~P (
y  X.  A )  ->  { f  e. 
~P ( y  X.  x )  |  Fun  f }  =  {
f  e.  ~P (
y  X.  A )  |  Fun  f } )
1311, 12syl 16 . . . . 5  |-  ( x  =  A  ->  { f  e.  ~P ( y  X.  x )  |  Fun  f }  =  { f  e.  ~P ( y  X.  A
)  |  Fun  f } )
14 xpeq1 5006 . . . . . . 7  |-  ( y  =  B  ->  (
y  X.  A )  =  ( B  X.  A ) )
1514pweqd 4008 . . . . . 6  |-  ( y  =  B  ->  ~P ( y  X.  A
)  =  ~P ( B  X.  A ) )
16 rabeq 3100 . . . . . 6  |-  ( ~P ( y  X.  A
)  =  ~P ( B  X.  A )  ->  { f  e.  ~P ( y  X.  A
)  |  Fun  f }  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } )
1715, 16syl 16 . . . . 5  |-  ( y  =  B  ->  { f  e.  ~P ( y  X.  A )  |  Fun  f }  =  { f  e.  ~P ( B  X.  A
)  |  Fun  f } )
18 df-pm 7413 . . . . 5  |-  ^pm  =  ( x  e.  _V ,  y  e.  _V  |->  { f  e.  ~P ( y  X.  x
)  |  Fun  f } )
1913, 17, 18ovmpt2g 6412 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V  /\  {
f  e.  ~P ( B  X.  A )  |  Fun  f }  e.  _V )  ->  ( A 
^pm  B )  =  { f  e.  ~P ( B  X.  A
)  |  Fun  f } )
20193expia 1193 . . 3  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { f  e. 
~P ( B  X.  A )  |  Fun  f }  e.  _V  ->  ( A  ^pm  B
)  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } ) )
218, 9, 20syl2an 477 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( { f  e. 
~P ( B  X.  A )  |  Fun  f }  e.  _V  ->  ( A  ^pm  B
)  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } ) )
227, 21mpd 15 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A  ^pm  B
)  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1374    e. wcel 1762   {crab 2811   _Vcvv 3106    C_ wss 3469   ~Pcpw 4003    X. cxp 4990   Fun wfun 5573  (class class class)co 6275    ^pm cpm 7411
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-id 4788  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-iota 5542  df-fun 5581  df-fv 5587  df-ov 6278  df-oprab 6279  df-mpt2 6280  df-pm 7413
This theorem is referenced by:  elpmg  7424
  Copyright terms: Public domain W3C validator