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

Theorem mapsnen 6985
Description: Set exponentiation to a singleton exponent is equinumerous to its base. Exercise 4.43 of [Mendelson] p. 255. (Contributed by NM, 17-Dec-2003.) (Revised by Mario Carneiro, 15-Nov-2014.)
Hypotheses
Ref Expression
mapsnen.1  |-  A  e. 
_V
mapsnen.2  |-  B  e. 
_V
Assertion
Ref Expression
mapsnen  |-  ( A  ^m  { B }
)  ~~  A

Proof of Theorem mapsnen
Dummy variables  y  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnmap 6823 . . 3  |-  ^m  Fn  ( _V  X.  _V )
2 mapsnen.1 . . 3  |-  A  e. 
_V
3 mapsnen.2 . . . 4  |-  B  e. 
_V
43snex 4275 . . 3  |-  { B }  e.  _V
5 fnovex 6050 . . 3  |-  ( (  ^m  Fn  ( _V 
X.  _V )  /\  A  e.  _V  /\  { B }  e.  _V )  ->  ( A  ^m  { B } )  e.  _V )
61, 2, 4, 5mp3an 1373 . 2  |-  ( A  ^m  { B }
)  e.  _V
7 vex 2805 . . . 4  |-  z  e. 
_V
87, 3fvex 5659 . . 3  |-  ( z `
 B )  e. 
_V
98a1i 9 . 2  |-  ( z  e.  ( A  ^m  { B } )  -> 
( z `  B
)  e.  _V )
10 vex 2805 . . . . 5  |-  w  e. 
_V
113, 10opex 4321 . . . 4  |-  <. B ,  w >.  e.  _V
1211snex 4275 . . 3  |-  { <. B ,  w >. }  e.  _V
1312a1i 9 . 2  |-  ( w  e.  A  ->  { <. B ,  w >. }  e.  _V )
142, 3mapsn 6858 . . . . . 6  |-  ( A  ^m  { B }
)  =  { z  |  E. y  e.  A  z  =  { <. B ,  y >. } }
1514abeq2i 2342 . . . . 5  |-  ( z  e.  ( A  ^m  { B } )  <->  E. y  e.  A  z  =  { <. B ,  y
>. } )
1615anbi1i 458 . . . 4  |-  ( ( z  e.  ( A  ^m  { B }
)  /\  w  =  ( z `  B
) )  <->  ( E. y  e.  A  z  =  { <. B ,  y
>. }  /\  w  =  ( z `  B
) ) )
17 r19.41v 2689 . . . 4  |-  ( E. y  e.  A  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) )  <->  ( E. y  e.  A  z  =  { <. B ,  y
>. }  /\  w  =  ( z `  B
) ) )
18 df-rex 2516 . . . 4  |-  ( E. y  e.  A  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) )  <->  E. y
( y  e.  A  /\  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) ) ) )
1916, 17, 183bitr2i 208 . . 3  |-  ( ( z  e.  ( A  ^m  { B }
)  /\  w  =  ( z `  B
) )  <->  E. y
( y  e.  A  /\  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) ) ) )
20 fveq1 5638 . . . . . . . . . 10  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  ( { <. B ,  y >. } `  B ) )
21 vex 2805 . . . . . . . . . . 11  |-  y  e. 
_V
223, 21fvsn 5848 . . . . . . . . . 10  |-  ( {
<. B ,  y >. } `  B )  =  y
2320, 22eqtrdi 2280 . . . . . . . . 9  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  y )
2423eqeq2d 2243 . . . . . . . 8  |-  ( z  =  { <. B , 
y >. }  ->  (
w  =  ( z `
 B )  <->  w  =  y ) )
25 equcom 1754 . . . . . . . 8  |-  ( w  =  y  <->  y  =  w )
2624, 25bitrdi 196 . . . . . . 7  |-  ( z  =  { <. B , 
y >. }  ->  (
w  =  ( z `
 B )  <->  y  =  w ) )
2726pm5.32i 454 . . . . . 6  |-  ( ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) )  <->  ( z  =  { <. B ,  y
>. }  /\  y  =  w ) )
2827anbi2i 457 . . . . 5  |-  ( ( y  e.  A  /\  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) ) )  <->  ( y  e.  A  /\  (
z  =  { <. B ,  y >. }  /\  y  =  w )
) )
29 anass 401 . . . . 5  |-  ( ( ( y  e.  A  /\  z  =  { <. B ,  y >. } )  /\  y  =  w )  <->  ( y  e.  A  /\  (
z  =  { <. B ,  y >. }  /\  y  =  w )
) )
30 ancom 266 . . . . 5  |-  ( ( ( y  e.  A  /\  z  =  { <. B ,  y >. } )  /\  y  =  w )  <->  ( y  =  w  /\  (
y  e.  A  /\  z  =  { <. B , 
y >. } ) ) )
3128, 29, 303bitr2i 208 . . . 4  |-  ( ( y  e.  A  /\  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) ) )  <->  ( y  =  w  /\  (
y  e.  A  /\  z  =  { <. B , 
y >. } ) ) )
3231exbii 1653 . . 3  |-  ( E. y ( y  e.  A  /\  ( z  =  { <. B , 
y >. }  /\  w  =  ( z `  B ) ) )  <->  E. y ( y  =  w  /\  ( y  e.  A  /\  z  =  { <. B ,  y
>. } ) ) )
33 eleq1w 2292 . . . . 5  |-  ( y  =  w  ->  (
y  e.  A  <->  w  e.  A ) )
34 opeq2 3863 . . . . . . 7  |-  ( y  =  w  ->  <. B , 
y >.  =  <. B ,  w >. )
3534sneqd 3682 . . . . . 6  |-  ( y  =  w  ->  { <. B ,  y >. }  =  { <. B ,  w >. } )
3635eqeq2d 2243 . . . . 5  |-  ( y  =  w  ->  (
z  =  { <. B ,  y >. }  <->  z  =  { <. B ,  w >. } ) )
3733, 36anbi12d 473 . . . 4  |-  ( y  =  w  ->  (
( y  e.  A  /\  z  =  { <. B ,  y >. } )  <->  ( w  e.  A  /\  z  =  { <. B ,  w >. } ) ) )
3810, 37ceqsexv 2842 . . 3  |-  ( E. y ( y  =  w  /\  ( y  e.  A  /\  z  =  { <. B ,  y
>. } ) )  <->  ( w  e.  A  /\  z  =  { <. B ,  w >. } ) )
3919, 32, 383bitri 206 . 2  |-  ( ( z  e.  ( A  ^m  { B }
)  /\  w  =  ( z `  B
) )  <->  ( w  e.  A  /\  z  =  { <. B ,  w >. } ) )
406, 2, 9, 13, 39en2i 6942 1  |-  ( A  ^m  { B }
)  ~~  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1397   E.wex 1540    e. wcel 2202   E.wrex 2511   _Vcvv 2802   {csn 3669   <.cop 3672   class class class wbr 4088    X. cxp 4723    Fn wfn 5321   ` cfv 5326  (class class class)co 6017    ^m cmap 6816    ~~ cen 6906
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-en 6909
This theorem is referenced by:  exmidpw2en  7103
  Copyright terms: Public domain W3C validator