MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rngosn3 Unicode version

Theorem rngosn3 21093
Description: The only unital ring with a base set consisting in one element is the zero ring. (Contributed by FL, 13-Feb-2010.) (Proof shortened by Mario Carneiro, 30-Apr-2015.) (New usage is discouraged.)
Hypotheses
Ref Expression
on1el3.1  |-  G  =  ( 1st `  R
)
on1el3.2  |-  X  =  ran  G
Assertion
Ref Expression
rngosn3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  R  =  <. { <. <. A ,  A >. ,  A >. } ,  { <. <. A ,  A >. ,  A >. } >. ) )

Proof of Theorem rngosn3
StepHypRef Expression
1 on1el3.1 . . . . . . . . . 10  |-  G  =  ( 1st `  R
)
21rngogrpo 21057 . . . . . . . . 9  |-  ( R  e.  RingOps  ->  G  e.  GrpOp )
3 on1el3.2 . . . . . . . . . 10  |-  X  =  ran  G
43grpofo 20866 . . . . . . . . 9  |-  ( G  e.  GrpOp  ->  G :
( X  X.  X
) -onto-> X )
5 fof 5451 . . . . . . . . 9  |-  ( G : ( X  X.  X ) -onto-> X  ->  G : ( X  X.  X ) --> X )
62, 4, 53syl 18 . . . . . . . 8  |-  ( R  e.  RingOps  ->  G : ( X  X.  X ) --> X )
76adantr 451 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  G : ( X  X.  X ) --> X )
8 id 19 . . . . . . . . 9  |-  ( X  =  { A }  ->  X  =  { A } )
98, 8xpeq12d 4714 . . . . . . . 8  |-  ( X  =  { A }  ->  ( X  X.  X
)  =  ( { A }  X.  { A } ) )
109, 8feq23d 5386 . . . . . . 7  |-  ( X  =  { A }  ->  ( G : ( X  X.  X ) --> X  <->  G : ( { A }  X.  { A } ) --> { A } ) )
117, 10syl5ibcom 211 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  G : ( { A }  X.  { A } ) --> { A } ) )
12 fdm 5393 . . . . . . . . . 10  |-  ( G : ( X  X.  X ) --> X  ->  dom  G  =  ( X  X.  X ) )
137, 12syl 15 . . . . . . . . 9  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  dom  G  =  ( X  X.  X ) )
1413eqcomd 2288 . . . . . . . 8  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  X.  X )  =  dom  G )
15 fdm 5393 . . . . . . . . 9  |-  ( G : ( { A }  X.  { A }
) --> { A }  ->  dom  G  =  ( { A }  X.  { A } ) )
1615eqeq2d 2294 . . . . . . . 8  |-  ( G : ( { A }  X.  { A }
) --> { A }  ->  ( ( X  X.  X )  =  dom  G  <-> 
( X  X.  X
)  =  ( { A }  X.  { A } ) ) )
1714, 16syl5ibcom 211 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  ->  ( X  X.  X
)  =  ( { A }  X.  { A } ) ) )
18 xpid11 4900 . . . . . . 7  |-  ( ( X  X.  X )  =  ( { A }  X.  { A }
)  <->  X  =  { A } )
1917, 18syl6ib 217 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  ->  X  =  { A } ) )
2011, 19impbid 183 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  G : ( { A }  X.  { A } ) --> { A } ) )
21 simpr 447 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  A  e.  B )
22 xpsng 5699 . . . . . . 7  |-  ( ( A  e.  B  /\  A  e.  B )  ->  ( { A }  X.  { A } )  =  { <. A ,  A >. } )
2321, 22sylancom 648 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( { A }  X.  { A } )  =  { <. A ,  A >. } )
2423feq2d 5380 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  <->  G : { <. A ,  A >. } --> { A } ) )
25 opex 4237 . . . . . 6  |-  <. A ,  A >.  e.  _V
26 fsng 5697 . . . . . 6  |-  ( (
<. A ,  A >.  e. 
_V  /\  A  e.  B )  ->  ( G : { <. A ,  A >. } --> { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
2725, 21, 26sylancr 644 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : { <. A ,  A >. } --> { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
2820, 24, 273bitrd 270 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
291eqeq1i 2290 . . . 4  |-  ( G  =  { <. <. A ,  A >. ,  A >. }  <-> 
( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. } )
3028, 29syl6bb 252 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  ( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
3130anbi1d 685 . 2  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( X  =  { A }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } )  <-> 
( ( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } ) ) )
32 eqid 2283 . . . . . . 7  |-  ( 2nd `  R )  =  ( 2nd `  R )
331, 32, 3rngosm 21048 . . . . . 6  |-  ( R  e.  RingOps  ->  ( 2nd `  R
) : ( X  X.  X ) --> X )
3433adantr 451 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( 2nd `  R ) : ( X  X.  X
) --> X )
359, 8feq23d 5386 . . . . 5  |-  ( X  =  { A }  ->  ( ( 2nd `  R
) : ( X  X.  X ) --> X  <-> 
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } ) )
3634, 35syl5ibcom 211 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  ( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } ) )
3723feq2d 5380 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } 
<->  ( 2nd `  R
) : { <. A ,  A >. } --> { A } ) )
38 fsng 5697 . . . . . 6  |-  ( (
<. A ,  A >.  e. 
_V  /\  A  e.  B )  ->  (
( 2nd `  R
) : { <. A ,  A >. } --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
3925, 21, 38sylancr 644 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : { <. A ,  A >. } --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4037, 39bitrd 244 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4136, 40sylibd 205 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4241pm4.71d 615 . 2  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  ( X  =  { A }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } ) ) )
43 relrngo 21044 . . . . . 6  |-  Rel  RingOps
44 df-rel 4696 . . . . . 6  |-  ( Rel  RingOps  <->  RingOps  C_  ( _V  X.  _V ) )
4543, 44mpbi 199 . . . . 5  |-  RingOps  C_  ( _V  X.  _V )
4645sseli 3176 . . . 4  |-  ( R  e.  RingOps  ->  R  e.  ( _V  X.  _V )
)
4746adantr 451 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  R  e.  ( _V  X.  _V ) )
48 eqop 6162 . . 3  |-  ( R  e.  ( _V  X.  _V )  ->  ( R  =  <. { <. <. A ,  A >. ,  A >. } ,  { <. <. A ,  A >. ,  A >. }
>. 
<->  ( ( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } ) ) )
4947, 48syl 15 . 2  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( R  =  <. { <. <. A ,  A >. ,  A >. } ,  { <. <. A ,  A >. ,  A >. } >.  <->  (
( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } ) ) )
5031, 42, 493bitr4d 276 1  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  R  =  <. { <. <. A ,  A >. ,  A >. } ,  { <. <. A ,  A >. ,  A >. } >. ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   _Vcvv 2788    C_ wss 3152   {csn 3640   <.cop 3643    X. cxp 4687   dom cdm 4689   ran crn 4690   Rel wrel 4694   -->wf 5251   -onto->wfo 5253   ` cfv 5255   1stc1st 6120   2ndc2nd 6121   GrpOpcgr 20853   RingOpscrngo 21042
This theorem is referenced by:  rngosn4  21094
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-1st 6122  df-2nd 6123  df-grpo 20858  df-ablo 20949  df-rngo 21043
  Copyright terms: Public domain W3C validator