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

Theorem ringressid 14140
Description: A ring restricted to its base set is a ring. It will usually be the original ring exactly, of course, but to show that needs additional conditions such as those in strressid 13217. (Contributed by Jim Kingdon, 28-Feb-2025.)
Hypothesis
Ref Expression
ringressid.b 𝐵 = (Base‘𝐺)
Assertion
Ref Expression
ringressid (𝐺 ∈ Ring → (𝐺s 𝐵) ∈ Ring)

Proof of Theorem ringressid
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2232 . . 3 (𝐺 ∈ Ring → (𝐺s 𝐵) = (𝐺s 𝐵))
2 ringressid.b . . . 4 𝐵 = (Base‘𝐺)
32a1i 9 . . 3 (𝐺 ∈ Ring → 𝐵 = (Base‘𝐺))
4 id 19 . . 3 (𝐺 ∈ Ring → 𝐺 ∈ Ring)
5 ssidd 3249 . . 3 (𝐺 ∈ Ring → 𝐵𝐵)
61, 3, 4, 5ressbas2d 13214 . 2 (𝐺 ∈ Ring → 𝐵 = (Base‘(𝐺s 𝐵)))
7 eqidd 2232 . . 3 (𝐺 ∈ Ring → (+g𝐺) = (+g𝐺))
8 basfn 13204 . . . . 5 Base Fn V
9 elex 2815 . . . . 5 (𝐺 ∈ Ring → 𝐺 ∈ V)
10 funfvex 5665 . . . . . 6 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1110funfni 5439 . . . . 5 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
128, 9, 11sylancr 414 . . . 4 (𝐺 ∈ Ring → (Base‘𝐺) ∈ V)
132, 12eqeltrid 2318 . . 3 (𝐺 ∈ Ring → 𝐵 ∈ V)
141, 7, 13, 4ressplusgd 13275 . 2 (𝐺 ∈ Ring → (+g𝐺) = (+g‘(𝐺s 𝐵)))
15 eqid 2231 . . . 4 (𝐺s 𝐵) = (𝐺s 𝐵)
16 eqid 2231 . . . 4 (.r𝐺) = (.r𝐺)
1715, 16ressmulrg 13291 . . 3 ((𝐵 ∈ V ∧ 𝐺 ∈ Ring) → (.r𝐺) = (.r‘(𝐺s 𝐵)))
1813, 17mpancom 422 . 2 (𝐺 ∈ Ring → (.r𝐺) = (.r‘(𝐺s 𝐵)))
19 ringgrp 14078 . . 3 (𝐺 ∈ Ring → 𝐺 ∈ Grp)
202grpressid 13707 . . 3 (𝐺 ∈ Grp → (𝐺s 𝐵) ∈ Grp)
2119, 20syl 14 . 2 (𝐺 ∈ Ring → (𝐺s 𝐵) ∈ Grp)
222, 16ringcl 14090 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(.r𝐺)𝑦) ∈ 𝐵)
232, 16ringass 14093 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(.r𝐺)𝑦)(.r𝐺)𝑧) = (𝑥(.r𝐺)(𝑦(.r𝐺)𝑧)))
24 eqid 2231 . . 3 (+g𝐺) = (+g𝐺)
252, 24, 16ringdi 14095 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → (𝑥(.r𝐺)(𝑦(+g𝐺)𝑧)) = ((𝑥(.r𝐺)𝑦)(+g𝐺)(𝑥(.r𝐺)𝑧)))
262, 24, 16ringdir 14096 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(+g𝐺)𝑦)(.r𝐺)𝑧) = ((𝑥(.r𝐺)𝑧)(+g𝐺)(𝑦(.r𝐺)𝑧)))
27 eqid 2231 . . 3 (1r𝐺) = (1r𝐺)
282, 27ringidcl 14097 . 2 (𝐺 ∈ Ring → (1r𝐺) ∈ 𝐵)
292, 16, 27ringlidm 14100 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵) → ((1r𝐺)(.r𝐺)𝑥) = 𝑥)
302, 16, 27ringridm 14101 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵) → (𝑥(.r𝐺)(1r𝐺)) = 𝑥)
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14118 1 (𝐺 ∈ Ring → (𝐺s 𝐵) ∈ Ring)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2202  Vcvv 2803   Fn wfn 5328  cfv 5333  (class class class)co 6028  Basecbs 13145  s cress 13146  +gcplusg 13223  .rcmulr 13224  Grpcgrp 13646  1rcur 14036  Ringcrg 14073
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-coll 4209  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-lttrn 8189  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-iun 3977  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-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-mgp 13998  df-ur 14037  df-ring 14075
This theorem is referenced by:  subrgid  14301
  Copyright terms: Public domain W3C validator