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

Theorem issrgid 14259
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 2238 . . 3 (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
2 eqid 2238 . . 3 (0g‘(mulGrp‘𝑅)) = (0g‘(mulGrp‘𝑅))
3 eqid 2238 . . 3 (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
4 srgidm.b . . . . . 6 𝐵 = (Base‘𝑅)
5 srgidm.t . . . . . 6 · = (.r𝑅)
64, 5srgideu 14250 . . . . 5 (𝑅 ∈ SRing → ∃!𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
7 reurex 2771 . . . . 5 (∃!𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) → ∃𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
86, 7syl 14 . . . 4 (𝑅 ∈ SRing → ∃𝑦𝐵𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥))
9 eqid 2238 . . . . . 6 (mulGrp‘𝑅) = (mulGrp‘𝑅)
109, 4mgpbasg 14200 . . . . 5 (𝑅 ∈ SRing → 𝐵 = (Base‘(mulGrp‘𝑅)))
119, 5mgpplusgg 14198 . . . . . . . . 9 (𝑅 ∈ SRing → · = (+g‘(mulGrp‘𝑅)))
1211oveqd 6092 . . . . . . . 8 (𝑅 ∈ SRing → (𝑦 · 𝑥) = (𝑦(+g‘(mulGrp‘𝑅))𝑥))
1312eqeq1d 2247 . . . . . . 7 (𝑅 ∈ SRing → ((𝑦 · 𝑥) = 𝑥 ↔ (𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
1411oveqd 6092 . . . . . . . 8 (𝑅 ∈ SRing → (𝑥 · 𝑦) = (𝑥(+g‘(mulGrp‘𝑅))𝑦))
1514eqeq1d 2247 . . . . . . 7 (𝑅 ∈ SRing → ((𝑥 · 𝑦) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥))
1613, 15anbi12d 477 . . . . . 6 (𝑅 ∈ SRing → (((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) ↔ ((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥)))
1710, 16raleqbidv 2765 . . . . 5 (𝑅 ∈ SRing → (∀𝑥𝐵 ((𝑦 · 𝑥) = 𝑥 ∧ (𝑥 · 𝑦) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝑦(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝑦) = 𝑥)))
1810, 17rexeqbidv 2766 . . . 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 13674 . 2 (𝑅 ∈ SRing → ((𝐼 ∈ (Base‘(mulGrp‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)) ↔ (0g‘(mulGrp‘𝑅)) = 𝐼))
2110eleq2d 2308 . . 3 (𝑅 ∈ SRing → (𝐼𝐵𝐼 ∈ (Base‘(mulGrp‘𝑅))))
2211oveqd 6092 . . . . . 6 (𝑅 ∈ SRing → (𝐼 · 𝑥) = (𝐼(+g‘(mulGrp‘𝑅))𝑥))
2322eqeq1d 2247 . . . . 5 (𝑅 ∈ SRing → ((𝐼 · 𝑥) = 𝑥 ↔ (𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥))
2411oveqd 6092 . . . . . 6 (𝑅 ∈ SRing → (𝑥 · 𝐼) = (𝑥(+g‘(mulGrp‘𝑅))𝐼))
2524eqeq1d 2247 . . . . 5 (𝑅 ∈ SRing → ((𝑥 · 𝐼) = 𝑥 ↔ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥))
2623, 25anbi12d 477 . . . 4 (𝑅 ∈ SRing → (((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥) ↔ ((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)))
2710, 26raleqbidv 2765 . . 3 (𝑅 ∈ SRing → (∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥) ↔ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥)))
2821, 27anbi12d 477 . 2 (𝑅 ∈ SRing → ((𝐼𝐵 ∧ ∀𝑥𝐵 ((𝐼 · 𝑥) = 𝑥 ∧ (𝑥 · 𝐼) = 𝑥)) ↔ (𝐼 ∈ (Base‘(mulGrp‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(mulGrp‘𝑅))((𝐼(+g‘(mulGrp‘𝑅))𝑥) = 𝑥 ∧ (𝑥(+g‘(mulGrp‘𝑅))𝐼) = 𝑥))))
29 srgidm.u . . . 4 1 = (1r𝑅)
309, 29ringidvalg 14239 . . 3 (𝑅 ∈ SRing → 1 = (0g‘(mulGrp‘𝑅)))
3130eqeq1d 2247 . 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 1402  wcel 2209  wral 2528  wrex 2529  ∃!wreu 2530  cfv 5372  (class class class)co 6075  Basecbs 13330  +gcplusg 13408  .rcmulr 13409  0gc0g 13587  mulGrpcmgp 14194  1rcur 14237  SRingcsrg 14241
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-mgp 14195  df-ur 14238  df-srg 14242
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator