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

Theorem srgideu 13991
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 13987 . . . 4 (𝑅 ∈ SRing → (mulGrp‘𝑅) ∈ Mnd)
3 eqid 2231 . . . . 5 (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
4 eqid 2231 . . . . 5 (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
53, 4mndideu 13514 . . . 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 13943 . . . . . . . 8 (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅)))
98oveqd 6035 . . . . . . 7 (𝑅 ∈ SRing → (𝑢 · 𝑥) = (𝑢(+g‘(mulGrp‘𝑅))𝑥))
109eqeq1d 2240 . . . . . 6 (𝑅 ∈ SRing → ((𝑢 · 𝑥) = 𝑥 ↔ (𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
118oveqd 6035 . . . . . . 7 (𝑅 ∈ SRing → (𝑥 · 𝑢) = (𝑥(+g‘(mulGrp‘𝑅))𝑢))
1211eqeq1d 2240 . . . . . 6 (𝑅 ∈ SRing → ((𝑥 · 𝑢) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥))
1310, 12anbi12d 473 . . . . 5 (𝑅 ∈ SRing → (((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥)))
1413ralbidv 2532 . . . 4 (𝑅 ∈ SRing → (∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑢) = 𝑥)))
1514reubidv 2718 . . 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 13945 . . 3 (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅)))
19 raleq 2730 . . . 4 (𝐵 = (Base‘(mulGrp‘𝑅)) → (∀𝑥𝐵 ((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑢 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑢) = 𝑥)))
2019reueqd 2744 . . 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 1397  wcel 2202  wral 2510  ∃!wreu 2512  cfv 5326  (class class class)co 6018  Basecbs 13087  +gcplusg 13165  .rcmulr 13166  Mndcmnd 13504  mulGrpcmgp 13939  SRingcsrg 13982
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-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 13090  df-slot 13091  df-base 13093  df-sets 13094  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-mgp 13940  df-srg 13983
This theorem is referenced by:  issrgid  14000
  Copyright terms: Public domain W3C validator