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

Theorem mapval2 6813
Description: Alternate expression for the value of set exponentiation. (Contributed by NM, 3-Nov-2007.)
Hypotheses
Ref Expression
elmap.1  |-  A  e. 
_V
elmap.2  |-  B  e. 
_V
Assertion
Ref Expression
mapval2  |-  ( A  ^m  B )  =  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )
Distinct variable group:    B, f
Allowed substitution hint:    A( f)

Proof of Theorem mapval2
Dummy variable  g is distinct from all other variables.
StepHypRef Expression
1 dff2 5688 . . . 4  |-  ( g : B --> A  <->  ( g  Fn  B  /\  g  C_  ( B  X.  A
) ) )
2 ancom 437 . . . 4  |-  ( ( g  Fn  B  /\  g  C_  ( B  X.  A ) )  <->  ( g  C_  ( B  X.  A
)  /\  g  Fn  B ) )
31, 2bitri 240 . . 3  |-  ( g : B --> A  <->  ( g  C_  ( B  X.  A
)  /\  g  Fn  B ) )
4 elmap.1 . . . 4  |-  A  e. 
_V
5 elmap.2 . . . 4  |-  B  e. 
_V
64, 5elmap 6812 . . 3  |-  ( g  e.  ( A  ^m  B )  <->  g : B
--> A )
7 elin 3371 . . . 4  |-  ( g  e.  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )  <-> 
( g  e.  ~P ( B  X.  A
)  /\  g  e.  { f  |  f  Fn  B } ) )
8 vex 2804 . . . . . 6  |-  g  e. 
_V
98elpw 3644 . . . . 5  |-  ( g  e.  ~P ( B  X.  A )  <->  g  C_  ( B  X.  A
) )
10 fneq1 5349 . . . . . 6  |-  ( f  =  g  ->  (
f  Fn  B  <->  g  Fn  B ) )
118, 10elab 2927 . . . . 5  |-  ( g  e.  { f  |  f  Fn  B }  <->  g  Fn  B )
129, 11anbi12i 678 . . . 4  |-  ( ( g  e.  ~P ( B  X.  A )  /\  g  e.  { f  |  f  Fn  B } )  <->  ( g  C_  ( B  X.  A
)  /\  g  Fn  B ) )
137, 12bitri 240 . . 3  |-  ( g  e.  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )  <-> 
( g  C_  ( B  X.  A )  /\  g  Fn  B )
)
143, 6, 133bitr4i 268 . 2  |-  ( g  e.  ( A  ^m  B )  <->  g  e.  ( ~P ( B  X.  A )  i^i  {
f  |  f  Fn  B } ) )
1514eqriv 2293 1  |-  ( A  ^m  B )  =  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )
Colors of variables: wff set class
Syntax hints:    /\ wa 358    = wceq 1632    e. wcel 1696   {cab 2282   _Vcvv 2801    i^i cin 3164    C_ wss 3165   ~Pcpw 3638    X. cxp 4703    Fn wfn 5266   -->wf 5267  (class class class)co 5874    ^m cmap 6788
This theorem is referenced by:  selsubf  26093  selsubf3  26094
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-map 6790
  Copyright terms: Public domain W3C validator