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

Theorem mapsnen 6927
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 6765 . . 3  |-  ^m  Fn  ( _V  X.  _V )
2 mapsnen.1 . . 3  |-  A  e. 
_V
3 mapsnen.2 . . . 4  |-  B  e. 
_V
43snex 4245 . . 3  |-  { B }  e.  _V
5 fnovex 6000 . . 3  |-  ( (  ^m  Fn  ( _V 
X.  _V )  /\  A  e.  _V  /\  { B }  e.  _V )  ->  ( A  ^m  { B } )  e.  _V )
61, 2, 4, 5mp3an 1350 . 2  |-  ( A  ^m  { B }
)  e.  _V
7 vex 2779 . . . 4  |-  z  e. 
_V
87, 3fvex 5619 . . 3  |-  ( z `
 B )  e. 
_V
98a1i 9 . 2  |-  ( z  e.  ( A  ^m  { B } )  -> 
( z `  B
)  e.  _V )
10 vex 2779 . . . . 5  |-  w  e. 
_V
113, 10opex 4291 . . . 4  |-  <. B ,  w >.  e.  _V
1211snex 4245 . . 3  |-  { <. B ,  w >. }  e.  _V
1312a1i 9 . 2  |-  ( w  e.  A  ->  { <. B ,  w >. }  e.  _V )
142, 3mapsn 6800 . . . . . 6  |-  ( A  ^m  { B }
)  =  { z  |  E. y  e.  A  z  =  { <. B ,  y >. } }
1514abeq2i 2318 . . . . 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 2664 . . . 4  |-  ( E. y  e.  A  ( z  =  { <. B ,  y >. }  /\  w  =  ( z `  B ) )  <->  ( E. y  e.  A  z  =  { <. B ,  y
>. }  /\  w  =  ( z `  B
) ) )
18 df-rex 2492 . . . 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 5598 . . . . . . . . . 10  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  ( { <. B ,  y >. } `  B ) )
21 vex 2779 . . . . . . . . . . 11  |-  y  e. 
_V
223, 21fvsn 5802 . . . . . . . . . 10  |-  ( {
<. B ,  y >. } `  B )  =  y
2320, 22eqtrdi 2256 . . . . . . . . 9  |-  ( z  =  { <. B , 
y >. }  ->  (
z `  B )  =  y )
2423eqeq2d 2219 . . . . . . . 8  |-  ( z  =  { <. B , 
y >. }  ->  (
w  =  ( z `
 B )  <->  w  =  y ) )
25 equcom 1730 . . . . . . . 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 1629 . . 3  |-  ( E. y ( y  e.  A  /\  ( z  =  { <. B , 
y >. }  /\  w  =  ( z `  B ) ) )  <->  E. y ( y  =  w  /\  ( y  e.  A  /\  z  =  { <. B ,  y
>. } ) ) )
33 eleq1w 2268 . . . . 5  |-  ( y  =  w  ->  (
y  e.  A  <->  w  e.  A ) )
34 opeq2 3834 . . . . . . 7  |-  ( y  =  w  ->  <. B , 
y >.  =  <. B ,  w >. )
3534sneqd 3656 . . . . . 6  |-  ( y  =  w  ->  { <. B ,  y >. }  =  { <. B ,  w >. } )
3635eqeq2d 2219 . . . . 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 2816 . . 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 6884 1  |-  ( A  ^m  { B }
)  ~~  A
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1373   E.wex 1516    e. wcel 2178   E.wrex 2487   _Vcvv 2776   {csn 3643   <.cop 3646   class class class wbr 4059    X. cxp 4691    Fn wfn 5285   ` cfv 5290  (class class class)co 5967    ^m cmap 6758    ~~ cen 6848
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-map 6760  df-en 6851
This theorem is referenced by:  exmidpw2en  7035
  Copyright terms: Public domain W3C validator