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

Theorem mapsnen 6981
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 6819 . . 3  |-  ^m  Fn  ( _V  X.  _V )
2 mapsnen.1 . . 3  |-  A  e. 
_V
3 mapsnen.2 . . . 4  |-  B  e. 
_V
43snex 4273 . . 3  |-  { B }  e.  _V
5 fnovex 6046 . . 3  |-  ( (  ^m  Fn  ( _V 
X.  _V )  /\  A  e.  _V  /\  { B }  e.  _V )  ->  ( A  ^m  { B } )  e.  _V )
61, 2, 4, 5mp3an 1371 . 2  |-  ( A  ^m  { B }
)  e.  _V
7 vex 2803 . . . 4  |-  z  e. 
_V
87, 3fvex 5655 . . 3  |-  ( z `
 B )  e. 
_V
98a1i 9 . 2  |-  ( z  e.  ( A  ^m  { B } )  -> 
( z `  B
)  e.  _V )
10 vex 2803 . . . . 5  |-  w  e. 
_V
113, 10opex 4319 . . . 4  |-  <. B ,  w >.  e.  _V
1211snex 4273 . . 3  |-  { <. B ,  w >. }  e.  _V
1312a1i 9 . 2  |-  ( w  e.  A  ->  { <. B ,  w >. }  e.  _V )
142, 3mapsn 6854 . . . . . 6  |-  ( A  ^m  { B }
)  =  { z  |  E. y  e.  A  z  =  { <. B ,  y >. } }
1514abeq2i 2340 . . . . 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 2687 . . . 4  |-  ( E. y  e.  A  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) )  <->  ( E. y  e.  A  z  =  { <. B ,  y
>. }  /\  w  =  ( z `  B
) ) )
18 df-rex 2514 . . . 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 5634 . . . . . . . . . 10  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  ( { <. B ,  y >. } `  B ) )
21 vex 2803 . . . . . . . . . . 11  |-  y  e. 
_V
223, 21fvsn 5844 . . . . . . . . . 10  |-  ( {
<. B ,  y >. } `  B )  =  y
2320, 22eqtrdi 2278 . . . . . . . . 9  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  y )
2423eqeq2d 2241 . . . . . . . 8  |-  ( z  =  { <. B , 
y >. }  ->  (
w  =  ( z `
 B )  <->  w  =  y ) )
25 equcom 1752 . . . . . . . 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 1651 . . 3  |-  ( E. y ( y  e.  A  /\  ( z  =  { <. B , 
y >. }  /\  w  =  ( z `  B ) ) )  <->  E. y ( y  =  w  /\  ( y  e.  A  /\  z  =  { <. B ,  y
>. } ) ) )
33 eleq1w 2290 . . . . 5  |-  ( y  =  w  ->  (
y  e.  A  <->  w  e.  A ) )
34 opeq2 3861 . . . . . . 7  |-  ( y  =  w  ->  <. B , 
y >.  =  <. B ,  w >. )
3534sneqd 3680 . . . . . 6  |-  ( y  =  w  ->  { <. B ,  y >. }  =  { <. B ,  w >. } )
3635eqeq2d 2241 . . . . 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 2840 . . 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 6938 1  |-  ( A  ^m  { B }
)  ~~  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200   E.wrex 2509   _Vcvv 2800   {csn 3667   <.cop 3670   class class class wbr 4086    X. cxp 4721    Fn wfn 5319   ` cfv 5324  (class class class)co 6013    ^m cmap 6812    ~~ cen 6902
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-map 6814  df-en 6905
This theorem is referenced by:  exmidpw2en  7097
  Copyright terms: Public domain W3C validator