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

Theorem mapsnf1o2 6908
Description: Explicit bijection between a set and its singleton functions. (Contributed by Stefan O'Rear, 21-Mar-2015.)
Hypotheses
Ref Expression
mapsncnv.s  |-  S  =  { X }
mapsncnv.b  |-  B  e. 
_V
mapsncnv.x  |-  X  e. 
_V
mapsncnv.f  |-  F  =  ( x  e.  ( B  ^m  S ) 
|->  ( x `  X
) )
Assertion
Ref Expression
mapsnf1o2  |-  F :
( B  ^m  S
)
-1-1-onto-> B
Distinct variable groups:    x, B    x, S
Allowed substitution hints:    F( x)    X( x)

Proof of Theorem mapsnf1o2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 vex 2806 . . . 4  |-  x  e. 
_V
2 mapsncnv.x . . . 4  |-  X  e. 
_V
31, 2fvex 5668 . . 3  |-  ( x `
 X )  e. 
_V
4 mapsncnv.f . . 3  |-  F  =  ( x  e.  ( B  ^m  S ) 
|->  ( x `  X
) )
53, 4fnmpti 5468 . 2  |-  F  Fn  ( B  ^m  S )
6 mapsncnv.s . . . . 5  |-  S  =  { X }
72snex 4281 . . . . 5  |-  { X }  e.  _V
86, 7eqeltri 2304 . . . 4  |-  S  e. 
_V
9 vex 2806 . . . . 5  |-  y  e. 
_V
109snex 4281 . . . 4  |-  { y }  e.  _V
118, 10xpex 4848 . . 3  |-  ( S  X.  { y } )  e.  _V
12 mapsncnv.b . . . 4  |-  B  e. 
_V
136, 12, 2, 4mapsncnv 6907 . . 3  |-  `' F  =  ( y  e.  B  |->  ( S  X.  { y } ) )
1411, 13fnmpti 5468 . 2  |-  `' F  Fn  B
15 dff1o4 5600 . 2  |-  ( F : ( B  ^m  S ) -1-1-onto-> B  <->  ( F  Fn  ( B  ^m  S )  /\  `' F  Fn  B ) )
165, 14, 15mpbir2an 951 1  |-  F :
( B  ^m  S
)
-1-1-onto-> B
Colors of variables: wff set class
Syntax hints:    = wceq 1398    e. wcel 2202   _Vcvv 2803   {csn 3673    |-> cmpt 4155    X. cxp 4729   `'ccnv 4730    Fn wfn 5328   -1-1-onto->wf1o 5332   ` cfv 5333  (class class class)co 6028    ^m cmap 6860
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-map 6862
This theorem is referenced by:  mapsnf1o3  6909
  Copyright terms: Public domain W3C validator