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

Theorem rngidpropdg 13315
Description: The ring unity depends only on the ring's base set and multiplication operation. (Contributed by Mario Carneiro, 26-Dec-2014.)
Hypotheses
Ref Expression
rngidpropd.1  |-  ( ph  ->  B  =  ( Base `  K ) )
rngidpropd.2  |-  ( ph  ->  B  =  ( Base `  L ) )
rngidpropd.3  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( .r
`  K ) y )  =  ( x ( .r `  L
) y ) )
rngidpropdg.k  |-  ( ph  ->  K  e.  V )
rngidpropdg.l  |-  ( ph  ->  L  e.  W )
Assertion
Ref Expression
rngidpropdg  |-  ( ph  ->  ( 1r `  K
)  =  ( 1r
`  L ) )
Distinct variable groups:    x, y, B   
x, K, y    x, L, y    ph, x, y
Allowed substitution hints:    V( x, y)    W( x, y)

Proof of Theorem rngidpropdg
StepHypRef Expression
1 rngidpropd.1 . . . 4  |-  ( ph  ->  B  =  ( Base `  K ) )
2 rngidpropdg.k . . . . 5  |-  ( ph  ->  K  e.  V )
3 eqid 2177 . . . . . 6  |-  (mulGrp `  K )  =  (mulGrp `  K )
4 eqid 2177 . . . . . 6  |-  ( Base `  K )  =  (
Base `  K )
53, 4mgpbasg 13136 . . . . 5  |-  ( K  e.  V  ->  ( Base `  K )  =  ( Base `  (mulGrp `  K ) ) )
62, 5syl 14 . . . 4  |-  ( ph  ->  ( Base `  K
)  =  ( Base `  (mulGrp `  K )
) )
71, 6eqtrd 2210 . . 3  |-  ( ph  ->  B  =  ( Base `  (mulGrp `  K )
) )
8 rngidpropd.2 . . . 4  |-  ( ph  ->  B  =  ( Base `  L ) )
9 rngidpropdg.l . . . . 5  |-  ( ph  ->  L  e.  W )
10 eqid 2177 . . . . . 6  |-  (mulGrp `  L )  =  (mulGrp `  L )
11 eqid 2177 . . . . . 6  |-  ( Base `  L )  =  (
Base `  L )
1210, 11mgpbasg 13136 . . . . 5  |-  ( L  e.  W  ->  ( Base `  L )  =  ( Base `  (mulGrp `  L ) ) )
139, 12syl 14 . . . 4  |-  ( ph  ->  ( Base `  L
)  =  ( Base `  (mulGrp `  L )
) )
148, 13eqtrd 2210 . . 3  |-  ( ph  ->  B  =  ( Base `  (mulGrp `  L )
) )
153mgpex 13135 . . . 4  |-  ( K  e.  V  ->  (mulGrp `  K )  e.  _V )
162, 15syl 14 . . 3  |-  ( ph  ->  (mulGrp `  K )  e.  _V )
1710mgpex 13135 . . . 4  |-  ( L  e.  W  ->  (mulGrp `  L )  e.  _V )
189, 17syl 14 . . 3  |-  ( ph  ->  (mulGrp `  L )  e.  _V )
19 rngidpropd.3 . . . 4  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( .r
`  K ) y )  =  ( x ( .r `  L
) y ) )
20 eqid 2177 . . . . . . 7  |-  ( .r
`  K )  =  ( .r `  K
)
213, 20mgpplusgg 13134 . . . . . 6  |-  ( K  e.  V  ->  ( .r `  K )  =  ( +g  `  (mulGrp `  K ) ) )
222, 21syl 14 . . . . 5  |-  ( ph  ->  ( .r `  K
)  =  ( +g  `  (mulGrp `  K )
) )
2322oveqdr 5903 . . . 4  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( .r
`  K ) y )  =  ( x ( +g  `  (mulGrp `  K ) ) y ) )
24 eqid 2177 . . . . . . 7  |-  ( .r
`  L )  =  ( .r `  L
)
2510, 24mgpplusgg 13134 . . . . . 6  |-  ( L  e.  W  ->  ( .r `  L )  =  ( +g  `  (mulGrp `  L ) ) )
269, 25syl 14 . . . . 5  |-  ( ph  ->  ( .r `  L
)  =  ( +g  `  (mulGrp `  L )
) )
2726oveqdr 5903 . . . 4  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( .r
`  L ) y )  =  ( x ( +g  `  (mulGrp `  L ) ) y ) )
2819, 23, 273eqtr3d 2218 . . 3  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x ( +g  `  (mulGrp `  K )
) y )  =  ( x ( +g  `  (mulGrp `  L )
) y ) )
297, 14, 16, 18, 28grpidpropdg 12793 . 2  |-  ( ph  ->  ( 0g `  (mulGrp `  K ) )  =  ( 0g `  (mulGrp `  L ) ) )
30 eqid 2177 . . . 4  |-  ( 1r
`  K )  =  ( 1r `  K
)
313, 30ringidvalg 13144 . . 3  |-  ( K  e.  V  ->  ( 1r `  K )  =  ( 0g `  (mulGrp `  K ) ) )
322, 31syl 14 . 2  |-  ( ph  ->  ( 1r `  K
)  =  ( 0g
`  (mulGrp `  K )
) )
33 eqid 2177 . . . 4  |-  ( 1r
`  L )  =  ( 1r `  L
)
3410, 33ringidvalg 13144 . . 3  |-  ( L  e.  W  ->  ( 1r `  L )  =  ( 0g `  (mulGrp `  L ) ) )
359, 34syl 14 . 2  |-  ( ph  ->  ( 1r `  L
)  =  ( 0g
`  (mulGrp `  L )
) )
3629, 32, 353eqtr4d 2220 1  |-  ( ph  ->  ( 1r `  K
)  =  ( 1r
`  L ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148   _Vcvv 2738   ` cfv 5217  (class class class)co 5875   Basecbs 12462   +g cplusg 12536   .rcmulr 12537   0gc0g 12705  mulGrpcmgp 13130   1rcur 13142
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-cnex 7902  ax-resscn 7903  ax-1cn 7904  ax-1re 7905  ax-icn 7906  ax-addcl 7907  ax-addrcl 7908  ax-mulcl 7909  ax-addcom 7911  ax-addass 7913  ax-i2m1 7916  ax-0lt1 7917  ax-0id 7919  ax-rnegex 7920  ax-pre-ltirr 7923  ax-pre-ltadd 7927
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-br 4005  df-opab 4066  df-mpt 4067  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-fv 5225  df-riota 5831  df-ov 5878  df-oprab 5879  df-mpo 5880  df-pnf 7994  df-mnf 7995  df-ltxr 7997  df-inn 8920  df-2 8978  df-3 8979  df-ndx 12465  df-slot 12466  df-base 12468  df-sets 12469  df-plusg 12549  df-mulr 12550  df-0g 12707  df-mgp 13131  df-ur 13143
This theorem is referenced by:  unitpropdg  13317  subrgpropd  13369  lmodprop2d  13438
  Copyright terms: Public domain W3C validator