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

Theorem mapval2 7241
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 5854 . . . 4  |-  ( g : B --> A  <->  ( g  Fn  B  /\  g  C_  ( B  X.  A
) ) )
2 ancom 450 . . . 4  |-  ( ( g  Fn  B  /\  g  C_  ( B  X.  A ) )  <->  ( g  C_  ( B  X.  A
)  /\  g  Fn  B ) )
31, 2bitri 249 . . 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 7240 . . 3  |-  ( g  e.  ( A  ^m  B )  <->  g : B
--> A )
7 elin 3538 . . . 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 selpw 3866 . . . . 5  |-  ( g  e.  ~P ( B  X.  A )  <->  g  C_  ( B  X.  A
) )
9 vex 2974 . . . . . 6  |-  g  e. 
_V
10 fneq1 5498 . . . . . 6  |-  ( f  =  g  ->  (
f  Fn  B  <->  g  Fn  B ) )
119, 10elab 3105 . . . . 5  |-  ( g  e.  { f  |  f  Fn  B }  <->  g  Fn  B )
128, 11anbi12i 697 . . . 4  |-  ( ( g  e.  ~P ( B  X.  A )  /\  g  e.  { f  |  f  Fn  B } )  <->  ( g  C_  ( B  X.  A
)  /\  g  Fn  B ) )
137, 12bitri 249 . . 3  |-  ( g  e.  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )  <-> 
( g  C_  ( B  X.  A )  /\  g  Fn  B )
)
143, 6, 133bitr4i 277 . 2  |-  ( g  e.  ( A  ^m  B )  <->  g  e.  ( ~P ( B  X.  A )  i^i  {
f  |  f  Fn  B } ) )
1514eqriv 2439 1  |-  ( A  ^m  B )  =  ( ~P ( B  X.  A )  i^i 
{ f  |  f  Fn  B } )
Colors of variables: wff setvar class
Syntax hints:    /\ wa 369    = wceq 1369    e. wcel 1756   {cab 2428   _Vcvv 2971    i^i cin 3326    C_ wss 3327   ~Pcpw 3859    X. cxp 4837    Fn wfn 5412   -->wf 5413  (class class class)co 6090    ^m cmap 7213
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4412  ax-nul 4420  ax-pow 4469  ax-pr 4530  ax-un 6371
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ne 2607  df-ral 2719  df-rex 2720  df-rab 2723  df-v 2973  df-sbc 3186  df-dif 3330  df-un 3332  df-in 3334  df-ss 3341  df-nul 3637  df-if 3791  df-pw 3861  df-sn 3877  df-pr 3879  df-op 3883  df-uni 4091  df-br 4292  df-opab 4350  df-id 4635  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-iota 5380  df-fun 5419  df-fn 5420  df-f 5421  df-fv 5425  df-ov 6093  df-oprab 6094  df-mpt2 6095  df-map 7215
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator