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

Theorem rngosn3 25101
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 25065 . . . . . . . . 9  |-  ( R  e.  RingOps  ->  G  e.  GrpOp )
3 on1el3.2 . . . . . . . . . 10  |-  X  =  ran  G
43grpofo 24874 . . . . . . . . 9  |-  ( G  e.  GrpOp  ->  G :
( X  X.  X
) -onto-> X )
5 fof 5793 . . . . . . . . 9  |-  ( G : ( X  X.  X ) -onto-> X  ->  G : ( X  X.  X ) --> X )
62, 4, 53syl 20 . . . . . . . 8  |-  ( R  e.  RingOps  ->  G : ( X  X.  X ) --> X )
76adantr 465 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  G : ( X  X.  X ) --> X )
8 id 22 . . . . . . . . 9  |-  ( X  =  { A }  ->  X  =  { A } )
98, 8xpeq12d 5024 . . . . . . . 8  |-  ( X  =  { A }  ->  ( X  X.  X
)  =  ( { A }  X.  { A } ) )
109, 8feq23d 5724 . . . . . . 7  |-  ( X  =  { A }  ->  ( G : ( X  X.  X ) --> X  <->  G : ( { A }  X.  { A } ) --> { A } ) )
117, 10syl5ibcom 220 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  G : ( { A }  X.  { A } ) --> { A } ) )
12 fdm 5733 . . . . . . . . . 10  |-  ( G : ( X  X.  X ) --> X  ->  dom  G  =  ( X  X.  X ) )
137, 12syl 16 . . . . . . . . 9  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  dom  G  =  ( X  X.  X ) )
1413eqcomd 2475 . . . . . . . 8  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  X.  X )  =  dom  G )
15 fdm 5733 . . . . . . . . 9  |-  ( G : ( { A }  X.  { A }
) --> { A }  ->  dom  G  =  ( { A }  X.  { A } ) )
1615eqeq2d 2481 . . . . . . . 8  |-  ( G : ( { A }  X.  { A }
) --> { A }  ->  ( ( X  X.  X )  =  dom  G  <-> 
( X  X.  X
)  =  ( { A }  X.  { A } ) ) )
1714, 16syl5ibcom 220 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  ->  ( X  X.  X
)  =  ( { A }  X.  { A } ) ) )
18 xpid11 5222 . . . . . . 7  |-  ( ( X  X.  X )  =  ( { A }  X.  { A }
)  <->  X  =  { A } )
1917, 18syl6ib 226 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  ->  X  =  { A } ) )
2011, 19impbid 191 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  G : ( { A }  X.  { A } ) --> { A } ) )
21 simpr 461 . . . . . . 7  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  A  e.  B )
22 xpsng 6060 . . . . . . 7  |-  ( ( A  e.  B  /\  A  e.  B )  ->  ( { A }  X.  { A } )  =  { <. A ,  A >. } )
2321, 22sylancom 667 . . . . . 6  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( { A }  X.  { A } )  =  { <. A ,  A >. } )
2423feq2d 5716 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : ( { A }  X.  { A }
) --> { A }  <->  G : { <. A ,  A >. } --> { A } ) )
25 opex 4711 . . . . . 6  |-  <. A ,  A >.  e.  _V
26 fsng 6058 . . . . . 6  |-  ( (
<. A ,  A >.  e. 
_V  /\  A  e.  B )  ->  ( G : { <. A ,  A >. } --> { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
2725, 21, 26sylancr 663 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( G : { <. A ,  A >. } --> { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
2820, 24, 273bitrd 279 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  G  =  { <. <. A ,  A >. ,  A >. } ) )
291eqeq1i 2474 . . . 4  |-  ( G  =  { <. <. A ,  A >. ,  A >. }  <-> 
( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. } )
3028, 29syl6bb 261 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  ( 1st `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
3130anbi1d 704 . 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 2467 . . . . . . 7  |-  ( 2nd `  R )  =  ( 2nd `  R )
331, 32, 3rngosm 25056 . . . . . 6  |-  ( R  e.  RingOps  ->  ( 2nd `  R
) : ( X  X.  X ) --> X )
3433adantr 465 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( 2nd `  R ) : ( X  X.  X
) --> X )
359, 8feq23d 5724 . . . . 5  |-  ( X  =  { A }  ->  ( ( 2nd `  R
) : ( X  X.  X ) --> X  <-> 
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } ) )
3634, 35syl5ibcom 220 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  ( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } ) )
3723feq2d 5716 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } 
<->  ( 2nd `  R
) : { <. A ,  A >. } --> { A } ) )
38 fsng 6058 . . . . . 6  |-  ( (
<. A ,  A >.  e. 
_V  /\  A  e.  B )  ->  (
( 2nd `  R
) : { <. A ,  A >. } --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
3925, 21, 38sylancr 663 . . . . 5  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : { <. A ,  A >. } --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4037, 39bitrd 253 . . . 4  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  (
( 2nd `  R
) : ( { A }  X.  { A } ) --> { A } 
<->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4136, 40sylibd 214 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A }  ->  ( 2nd `  R
)  =  { <. <. A ,  A >. ,  A >. } ) )
4241pm4.71d 634 . 2  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  ( X  =  { A }  /\  ( 2nd `  R )  =  { <. <. A ,  A >. ,  A >. } ) ) )
43 relrngo 25052 . . . . . 6  |-  Rel  RingOps
44 df-rel 5006 . . . . . 6  |-  ( Rel  RingOps  <->  RingOps  C_  ( _V  X.  _V ) )
4543, 44mpbi 208 . . . . 5  |-  RingOps  C_  ( _V  X.  _V )
4645sseli 3500 . . . 4  |-  ( R  e.  RingOps  ->  R  e.  ( _V  X.  _V )
)
4746adantr 465 . . 3  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  R  e.  ( _V  X.  _V ) )
48 eqop 6821 . . 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 16 . 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 285 1  |-  ( ( R  e.  RingOps  /\  A  e.  B )  ->  ( X  =  { A } 
<->  R  =  <. { <. <. A ,  A >. ,  A >. } ,  { <. <. A ,  A >. ,  A >. } >. ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1379    e. wcel 1767   _Vcvv 3113    C_ wss 3476   {csn 4027   <.cop 4033    X. cxp 4997   dom cdm 4999   ran crn 5000   Rel wrel 5004   -->wf 5582   -onto->wfo 5584   ` cfv 5586   1stc1st 6779   2ndc2nd 6780   GrpOpcgr 24861   RingOpscrngo 25050
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-reu 2821  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-iun 4327  df-br 4448  df-opab 4506  df-mpt 4507  df-id 4795  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-iota 5549  df-fun 5588  df-fn 5589  df-f 5590  df-f1 5591  df-fo 5592  df-f1o 5593  df-fv 5594  df-ov 6285  df-1st 6781  df-2nd 6782  df-grpo 24866  df-ablo 24957  df-rngo 25051
This theorem is referenced by:  rngosn4  25102
  Copyright terms: Public domain W3C validator