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

Theorem issrgid 14125
Description: Properties showing that an element 𝐼 is the unity element of a semiring. (Contributed by NM, 7-Aug-2013.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgidm.b 𝐵 = (Base‘𝑅)
srgidm.t · = (.r𝑅)
srgidm.u 1 = (1r𝑅)
Assertion
Ref Expression
issrgid (𝑅 ∈ SRing → ((𝐼𝐵 ∧ ∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥)) ↔ 1 = 𝐼))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐼   𝑥,𝑅   𝑥, ·   𝑥, 1

Proof of Theorem issrgid
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqid 2232 . . 3 (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
2 eqid 2232 . . 3 (0g‘(mulGrp‘𝑅)) = (0g‘(mulGrp‘𝑅))
3 eqid 2232 . . 3 (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
4 srgidm.b . . . . . 6 𝐵 = (Base‘𝑅)
5 srgidm.t . . . . . 6 · = (.r𝑅)
64, 5srgideu 14116 . . . . 5 (𝑅 ∈ SRing → ∃!𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
7 reurex 2763 . . . . 5 (∃!𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) → ∃𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
86, 7syl 14 . . . 4 (𝑅 ∈ SRing → ∃𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
9 eqid 2232 . . . . . 6 (mulGrp‘𝑅) = (mulGrp‘𝑅)
109, 4mgpbasg 14070 . . . . 5 (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅)))
119, 5mgpplusgg 14068 . . . . . . . . 9 (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅)))
1211oveqd 6067 . . . . . . . 8 (𝑅 ∈ SRing → (𝑦 · 𝑥) = (𝑦(+g‘(mulGrp‘𝑅))𝑥))
1312eqeq1d 2241 . . . . . . 7 (𝑅 ∈ SRing → ((𝑦 · 𝑥) = 𝑥 ↔ (𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
1411oveqd 6067 . . . . . . . 8 (𝑅 ∈ SRing → (𝑥 · 𝑦) = (𝑥(+g‘(mulGrp‘𝑅))𝑦))
1514eqeq1d 2241 . . . . . . 7 (𝑅 ∈ SRing → ((𝑥 · 𝑦) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥))
1613, 15anbi12d 473 . . . . . 6 (𝑅 ∈ SRing → (((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) ↔ ((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥)))
1710, 16raleqbidv 2757 . . . . 5 (𝑅 ∈ SRing → (∀𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥)))
1810, 17rexeqbidv 2758 . . . 4 (𝑅 ∈ SRing → (∃𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) ↔ ∃𝑦 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥)))
198, 18mpbid 147 . . 3 (𝑅 ∈ SRing → ∃𝑦 ∈ (Base‘(mulGrp‘𝑅))∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥))
201, 2, 3, 19ismgmid 13590 . 2 (𝑅 ∈ SRing → ((𝐼 ∈ (Base‘(mulGrp‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)) ↔ (0g‘(mulGrp‘𝑅)) = 𝐼))
2110eleq2d 2302 . . 3 (𝑅 ∈ SRing → (𝐼𝐵𝐼 ∈ (Base‘(mulGrp‘𝑅))))
2211oveqd 6067 . . . . . 6 (𝑅 ∈ SRing → (𝐼 · 𝑥) = (𝐼(+g‘(mulGrp‘𝑅))𝑥))
2322eqeq1d 2241 . . . . 5 (𝑅 ∈ SRing → ((𝐼 · 𝑥) = 𝑥 ↔ (𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
2411oveqd 6067 . . . . . 6 (𝑅 ∈ SRing → (𝑥 · 𝐼) = (𝑥(+g‘(mulGrp‘𝑅))𝐼))
2524eqeq1d 2241 . . . . 5 (𝑅 ∈ SRing → ((𝑥 · 𝐼) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥))
2623, 25anbi12d 473 . . . 4 (𝑅 ∈ SRing → (((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥) ↔ ((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)))
2710, 26raleqbidv 2757 . . 3 (𝑅 ∈ SRing → (∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)))
2821, 27anbi12d 473 . 2 (𝑅 ∈ SRing → ((𝐼𝐵 ∧ ∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥)) ↔ (𝐼 ∈ (Base‘(mulGrp‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥))))
29 srgidm.u . . . 4 1 = (1r𝑅)
309, 29ringidvalg 14105 . . 3 (𝑅 ∈ SRing → 1 = (0g‘(mulGrp‘𝑅)))
3130eqeq1d 2241 . 2 (𝑅 ∈ SRing → ( 1 = 𝐼 ↔ (0g‘(mulGrp‘𝑅)) = 𝐼))
3220, 28, 313bitr4d 220 1 (𝑅 ∈ SRing → ((𝐼𝐵 ∧ ∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥)) ↔ 1 = 𝐼))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203  wral 2520  wrex 2521  ∃!wreu 2522  cfv 5352  (class class class)co 6050  Basecbs 13212  +gcplusg 13290  .rcmulr 13291  0gc0g 13469  mulGrpcmgp 14064  1rcur 14103  SRingcsrg 14107
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-plusg 13303  df-mulr 13304  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-mgp 14065  df-ur 14104  df-srg 14108
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator