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

Theorem pmvalg 6659
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 3241 . . 3  |-  { f  e.  ~P ( B  X.  A )  |  Fun  f }  C_  ~P ( B  X.  A
)
2 xpexg 4741 . . . . 5  |-  ( ( B  e.  D  /\  A  e.  C )  ->  ( B  X.  A
)  e.  _V )
32ancoms 268 . . . 4  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( B  X.  A
)  e.  _V )
4 pwexg 4181 . . . 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 4143 . . 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 414 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  { f  e.  ~P ( B  X.  A
)  |  Fun  f }  e.  _V )
8 elex 2749 . . 3  |-  ( A  e.  C  ->  A  e.  _V )
9 elex 2749 . . 3  |-  ( B  e.  D  ->  B  e.  _V )
10 xpeq2 4642 . . . . . . 7  |-  ( x  =  A  ->  (
y  X.  x )  =  ( y  X.  A ) )
1110pweqd 3581 . . . . . 6  |-  ( x  =  A  ->  ~P ( y  X.  x
)  =  ~P (
y  X.  A ) )
12 rabeq 2730 . . . . . 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 4641 . . . . . . 7  |-  ( y  =  B  ->  (
y  X.  A )  =  ( B  X.  A ) )
1514pweqd 3581 . . . . . 6  |-  ( y  =  B  ->  ~P ( y  X.  A
)  =  ~P ( B  X.  A ) )
16 rabeq 2730 . . . . . 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 6651 . . . . 5  |-  ^pm  =  ( x  e.  _V ,  y  e.  _V  |->  { f  e.  ~P ( y  X.  x
)  |  Fun  f } )
1913, 17, 18ovmpog 6009 . . . 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 1205 . . 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 289 . 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 104    = wceq 1353    e. wcel 2148   {crab 2459   _Vcvv 2738    C_ wss 3130   ~Pcpw 3576    X. cxp 4625   Fun wfun 5211  (class class class)co 5875    ^pm cpm 6649
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2740  df-sbc 2964  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-br 4005  df-opab 4066  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-iota 5179  df-fun 5219  df-fv 5225  df-ov 5878  df-oprab 5879  df-mpo 5880  df-pm 6651
This theorem is referenced by:  elpmg  6664
  Copyright terms: Public domain W3C validator