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

Theorem mapfoss 6947
Description: The value of the set exponentiation  ( B  ^m  A ) is a superset of the set of all functions from  A onto  B. (Contributed by AV, 7-Aug-2024.)
Assertion
Ref Expression
mapfoss  |-  { f  |  f : A -onto-> B }  C_  ( B  ^m  A )
Distinct variable groups:    A, f    B, f

Proof of Theorem mapfoss
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 vex 2824 . . . 4  |-  m  e. 
_V
2 foeq1 5611 . . . 4  |-  ( f  =  m  ->  (
f : A -onto-> B  <->  m : A -onto-> B ) )
31, 2elab 2970 . . 3  |-  ( m  e.  { f  |  f : A -onto-> B } 
<->  m : A -onto-> B
)
4 fof 5615 . . . 4  |-  ( m : A -onto-> B  ->  m : A --> B )
5 forn 5618 . . . . . 6  |-  ( m : A -onto-> B  ->  ran  m  =  B )
61rnex 5050 . . . . . 6  |-  ran  m  e.  _V
75, 6eqeltrrdi 2330 . . . . 5  |-  ( m : A -onto-> B  ->  B  e.  _V )
8 dmfex 5582 . . . . . 6  |-  ( ( m  e.  _V  /\  m : A --> B )  ->  A  e.  _V )
91, 4, 8sylancr 418 . . . . 5  |-  ( m : A -onto-> B  ->  A  e.  _V )
107, 9elmapd 6936 . . . 4  |-  ( m : A -onto-> B  -> 
( m  e.  ( B  ^m  A )  <-> 
m : A --> B ) )
114, 10mpbird 167 . . 3  |-  ( m : A -onto-> B  ->  m  e.  ( B  ^m  A ) )
123, 11sylbi 121 . 2  |-  ( m  e.  { f  |  f : A -onto-> B }  ->  m  e.  ( B  ^m  A ) )
1312ssriv 3252 1  |-  { f  |  f : A -onto-> B }  C_  ( B  ^m  A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    e. wcel 2209   {cab 2224   _Vcvv 2821    C_ wss 3220   ran crn 4775   -->wf 5373   -onto->wfo 5375  (class class class)co 6085    ^m cmap 6922
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator