ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pmvalg Unicode version

Theorem pmvalg 6406
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 3106 . . 3  |-  { f  e.  ~P ( B  X.  A )  |  Fun  f }  C_  ~P ( B  X.  A
)
2 xpexg 4548 . . . . 5  |-  ( ( B  e.  D  /\  A  e.  C )  ->  ( B  X.  A
)  e.  _V )
32ancoms 264 . . . 4  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( B  X.  A
)  e.  _V )
4 pwexg 4013 . . . 4  |-  ( ( B  X.  A )  e.  _V  ->  ~P ( B  X.  A
)  e.  _V )
53, 4syl 14 . . 3  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ~P ( B  X.  A )  e.  _V )
6 ssexg 3976 . . 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 405 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  { f  e.  ~P ( B  X.  A
)  |  Fun  f }  e.  _V )
8 elex 2630 . . 3  |-  ( A  e.  C  ->  A  e.  _V )
9 elex 2630 . . 3  |-  ( B  e.  D  ->  B  e.  _V )
10 xpeq2 4451 . . . . . . 7  |-  ( x  =  A  ->  (
y  X.  x )  =  ( y  X.  A ) )
1110pweqd 3432 . . . . . 6  |-  ( x  =  A  ->  ~P ( y  X.  x
)  =  ~P (
y  X.  A ) )
12 rabeq 2611 . . . . . 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 14 . . . . 5  |-  ( x  =  A  ->  { f  e.  ~P ( y  X.  x )  |  Fun  f }  =  { f  e.  ~P ( y  X.  A
)  |  Fun  f } )
14 xpeq1 4450 . . . . . . 7  |-  ( y  =  B  ->  (
y  X.  A )  =  ( B  X.  A ) )
1514pweqd 3432 . . . . . 6  |-  ( y  =  B  ->  ~P ( y  X.  A
)  =  ~P ( B  X.  A ) )
16 rabeq 2611 . . . . . 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 14 . . . . 5  |-  ( y  =  B  ->  { f  e.  ~P ( y  X.  A )  |  Fun  f }  =  { f  e.  ~P ( B  X.  A
)  |  Fun  f } )
18 df-pm 6398 . . . . 5  |-  ^pm  =  ( x  e.  _V ,  y  e.  _V  |->  { f  e.  ~P ( y  X.  x
)  |  Fun  f } )
1913, 17, 18ovmpt2g 5771 . . . 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 1145 . . 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 283 . 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 13 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( A  ^pm  B
)  =  { f  e.  ~P ( B  X.  A )  |  Fun  f } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1289    e. wcel 1438   {crab 2363   _Vcvv 2619    C_ wss 2999   ~Pcpw 3427    X. cxp 4434   Fun wfun 5004  (class class class)co 5644    ^pm cpm 6396
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3955  ax-pow 4007  ax-pr 4034  ax-un 4258  ax-setind 4351
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-rab 2368  df-v 2621  df-sbc 2841  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-pw 3429  df-sn 3450  df-pr 3451  df-op 3453  df-uni 3652  df-br 3844  df-opab 3898  df-id 4118  df-xp 4442  df-rel 4443  df-cnv 4444  df-co 4445  df-dm 4446  df-iota 4975  df-fun 5012  df-fv 5018  df-ov 5647  df-oprab 5648  df-mpt2 5649  df-pm 6398
This theorem is referenced by:  elpmg  6411
  Copyright terms: Public domain W3C validator