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

Theorem srgidmlem 14010
Description: Lemma for srglidm 14011 and srgridm 14012. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 27-Dec-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgidm.b 𝐵 = (Base‘𝑅)
srgidm.t · = (.r𝑅)
srgidm.u 1 = (1r𝑅)
Assertion
Ref Expression
srgidmlem ((𝑅 ∈ SRing ∧ 𝑋𝐵) → (( 1 · 𝑋) = 𝑋 ∧ (𝑋 · 1 ) = 𝑋))

Proof of Theorem srgidmlem
StepHypRef Expression
1 eqid 2231 . . . 4 (mulGrp‘𝑅) = (mulGrp‘𝑅)
21srgmgp 14000 . . 3 (𝑅 ∈ SRing → (mulGrp‘𝑅) ∈ Mnd)
3 srgidm.b . . . . . 6 𝐵 = (Base‘𝑅)
41, 3mgpbasg 13958 . . . . 5 (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅)))
54eleq2d 2301 . . . 4 (𝑅 ∈ SRing → (𝑋𝐵𝑋 ∈ (Base‘(mulGrp‘𝑅))))
65biimpa 296 . . 3 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → 𝑋 ∈ (Base‘(mulGrp‘𝑅)))
7 eqid 2231 . . . 4 (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
8 eqid 2231 . . . 4 (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
9 eqid 2231 . . . 4 (0g‘(mulGrp‘𝑅)) = (0g‘(mulGrp‘𝑅))
107, 8, 9mndlrid 13535 . . 3 (((mulGrp‘𝑅) ∈ Mnd ∧ 𝑋 ∈ (Base‘(mulGrp‘𝑅))) → (((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋) = 𝑋 ∧ (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))) = 𝑋))
112, 6, 10syl2an2r 599 . 2 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → (((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋) = 𝑋 ∧ (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))) = 𝑋))
12 srgidm.t . . . . . . 7 · = (.r𝑅)
131, 12mgpplusgg 13956 . . . . . 6 (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅)))
14 srgidm.u . . . . . . 7 1 = (1r𝑅)
151, 14ringidvalg 13993 . . . . . 6 (𝑅 ∈ SRing → 1 = (0g‘(mulGrp‘𝑅)))
16 eqidd 2232 . . . . . 6 (𝑅 ∈ SRing → 𝑋 = 𝑋)
1713, 15, 16oveq123d 6039 . . . . 5 (𝑅 ∈ SRing → ( 1 · 𝑋) = ((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋))
1817eqeq1d 2240 . . . 4 (𝑅 ∈ SRing → (( 1 · 𝑋) = 𝑋 ↔ ((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋) = 𝑋))
1913, 16, 15oveq123d 6039 . . . . 5 (𝑅 ∈ SRing → (𝑋 · 1 ) = (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))))
2019eqeq1d 2240 . . . 4 (𝑅 ∈ SRing → ((𝑋 · 1 ) = 𝑋 ↔ (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))) = 𝑋))
2118, 20anbi12d 473 . . 3 (𝑅 ∈ SRing → ((( 1 · 𝑋) = 𝑋 ∧ (𝑋 · 1 ) = 𝑋) ↔ (((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋) = 𝑋 ∧ (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))) = 𝑋)))
2221adantr 276 . 2 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → ((( 1 · 𝑋) = 𝑋 ∧ (𝑋 · 1 ) = 𝑋) ↔ (((0g‘(mulGrp‘𝑅))(+g‘(mulGrp‘𝑅))𝑋) = 𝑋 ∧ (𝑋(+g‘(mulGrp‘𝑅))(0g‘(mulGrp‘𝑅))) = 𝑋)))
2311, 22mpbird 167 1 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → (( 1 · 𝑋) = 𝑋 ∧ (𝑋 · 1 ) = 𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wcel 2202  cfv 5326  (class class class)co 6018  Basecbs 13100  +gcplusg 13178  .rcmulr 13179  0gc0g 13357  Mndcmnd 13517  mulGrpcmgp 13952  1rcur 13991  SRingcsrg 13995
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13103  df-slot 13104  df-base 13106  df-sets 13107  df-plusg 13191  df-mulr 13192  df-0g 13359  df-mgm 13457  df-sgrp 13503  df-mnd 13518  df-mgp 13953  df-ur 13992  df-srg 13996
This theorem is referenced by:  srglidm  14011  srgridm  14012
  Copyright terms: Public domain W3C validator