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

Theorem srgideu 14047
Description: The unity element of a semiring is unique. (Contributed by NM, 27-Aug-2011.) (Revised by Mario Carneiro, 6-Jan-2015.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgcl.b 𝐵 = (Base‘𝑅)
srgcl.t · = (.r𝑅)
Assertion
Ref Expression
srgideu (𝑅 ∈ SRing → ∃!𝑢𝐵𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥))
Distinct variable groups:   𝑥,𝑢,𝐵   𝑢,𝑅,𝑥   𝑢, · ,𝑥

Proof of Theorem srgideu
StepHypRef Expression
1 eqid 2231 . . . . 5 (mulGrp‘𝑅) = (mulGrp‘𝑅)
21srgmgp 14043 . . . 4 (𝑅 ∈ SRing → (mulGrp‘𝑅) ∈ Mnd)
3 eqid 2231 . . . . 5 (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
4 eqid 2231 . . . . 5 (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
53, 4mndideu 13570 . . . 4 ((mulGrp‘𝑅) ∈ Mnd → ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥))
62, 5syl 14 . . 3 (𝑅 ∈ SRing → ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥))
7 srgcl.t . . . . . . . . 9 · = (.r𝑅)
81, 7mgpplusgg 13999 . . . . . . . 8 (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅)))
98oveqd 6045 . . . . . . 7 (𝑅 ∈ SRing → (𝑢 · 𝑥) = (𝑢(+g‘(mulGrp‘𝑅))𝑥))
109eqeq1d 2240 . . . . . 6 (𝑅 ∈ SRing → ((𝑢 · 𝑥) = 𝑥 ↔ (𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
118oveqd 6045 . . . . . . 7 (𝑅 ∈ SRing → (𝑥 · 𝑢) = (𝑥(+g‘(mulGrp‘𝑅))𝑢))
1211eqeq1d 2240 . . . . . 6 (𝑅 ∈ SRing → ((𝑥 · 𝑢) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥))
1310, 12anbi12d 473 . . . . 5 (𝑅 ∈ SRing → (((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥)))
1413ralbidv 2533 . . . 4 (𝑅 ∈ SRing → (∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥)))
1514reubidv 2719 . . 3 (𝑅 ∈ SRing → (∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥)))
166, 15mpbird 167 . 2 (𝑅 ∈ SRing → ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥))
17 srgcl.b . . . 4 𝐵 = (Base‘𝑅)
181, 17mgpbasg 14001 . . 3 (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅)))
19 raleq 2731 . . . 4 (𝐵 = (Base‘(mulGrp‘𝑅)) → (∀𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥)))
2019reueqd 2745 . . 3 (𝐵 = (Base‘(mulGrp‘𝑅)) → (∃!𝑢𝐵𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥)))
2118, 20syl 14 . 2 (𝑅 ∈ SRing → (∃!𝑢𝐵𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∃!𝑢 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥)))
2216, 21mpbird 167 1 (𝑅 ∈ SRing → ∃!𝑢𝐵𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2202  wral 2511  ∃!wreu 2513  cfv 5333  (class class class)co 6028  Basecbs 13143  +gcplusg 13221  .rcmulr 13222  Mndcmnd 13560  mulGrpcmgp 13995  SRingcsrg 14038
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8259  df-mnf 8260  df-ltxr 8262  df-inn 9187  df-2 9245  df-3 9246  df-ndx 13146  df-slot 13147  df-base 13149  df-sets 13150  df-plusg 13234  df-mulr 13235  df-0g 13402  df-mgm 13500  df-sgrp 13546  df-mnd 13561  df-mgp 13996  df-srg 14039
This theorem is referenced by:  issrgid  14056
  Copyright terms: Public domain W3C validator