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

Theorem ringressid 14368
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 13425. (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 2239 . . 3 (𝐺 ∈ Ring → (𝐺s 𝐵) = (𝐺s 𝐵))
2 ringressid.b . . . 4 𝐵 = (Base‘𝐺)
32a1i 9 . . 3 (𝐺 ∈ Ring → 𝐵 = (Base‘𝐺))
4 id 19 . . 3 (𝐺 ∈ Ring → 𝐺 ∈ Ring)
5 ssidd 3269 . . 3 (𝐺 ∈ Ring → 𝐵𝐵)
61, 3, 4, 5ressbas2d 13422 . 2 (𝐺 ∈ Ring → 𝐵 = (Base‘(𝐺s 𝐵)))
7 eqidd 2239 . . 3 (𝐺 ∈ Ring → (+g𝐺) = (+g𝐺))
8 basfn 13411 . . . . 5 Base Fn V
9 elex 2833 . . . . 5 (𝐺 ∈ Ring → 𝐺 ∈ V)
10 funfvex 5712 . . . . . 6 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1110funfni 5483 . . . . 5 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
128, 9, 11sylancr 418 . . . 4 (𝐺 ∈ Ring → (Base‘𝐺) ∈ V)
132, 12eqeltrid 2325 . . 3 (𝐺 ∈ Ring → 𝐵 ∈ V)
141, 7, 13, 4ressplusgd 13483 . 2 (𝐺 ∈ Ring → (+g𝐺) = (+g‘(𝐺s 𝐵)))
15 eqid 2238 . . . 4 (𝐺s 𝐵) = (𝐺s 𝐵)
16 eqid 2238 . . . 4 (.r𝐺) = (.r𝐺)
1715, 16ressmulrg 13499 . . 3 ((𝐵 ∈ V ∧ 𝐺 ∈ Ring) → (.r𝐺) = (.r‘(𝐺s 𝐵)))
1813, 17mpancom 426 . 2 (𝐺 ∈ Ring → (.r𝐺) = (.r‘(𝐺s 𝐵)))
19 ringgrp 14305 . . 3 (𝐺 ∈ Ring → 𝐺 ∈ Grp)
202grpressid 13866 . . 3 (𝐺 ∈ Grp → (𝐺s 𝐵) ∈ Grp)
2119, 20syl 14 . 2 (𝐺 ∈ Ring → (𝐺s 𝐵) ∈ Grp)
222, 16ringcl 14317 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(.r𝐺)𝑦) ∈ 𝐵)
232, 16ringass 14320 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(.r𝐺)𝑦)(.r𝐺)𝑧) = (𝑥(.r𝐺)(𝑦(.r𝐺)𝑧)))
24 eqid 2238 . . 3 (+g𝐺) = (+g𝐺)
252, 24, 16ringdi 14323 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → (𝑥(.r𝐺)(𝑦(+g𝐺)𝑧)) = ((𝑥(.r𝐺)𝑦)(+g𝐺)(𝑥(.r𝐺)𝑧)))
262, 24, 16ringdir 14324 . 2 ((𝐺 ∈ Ring ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(+g𝐺)𝑦)(.r𝐺)𝑧) = ((𝑥(.r𝐺)𝑧)(+g𝐺)(𝑦(.r𝐺)𝑧)))
27 eqid 2238 . . 3 (1r𝐺) = (1r𝐺)
282, 27ringidcl 14325 . 2 (𝐺 ∈ Ring → (1r𝐺) ∈ 𝐵)
292, 16, 27ringlidm 14328 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵) → ((1r𝐺)(.r𝐺)𝑥) = 𝑥)
302, 16, 27ringridm 14329 . 2 ((𝐺 ∈ Ring ∧ 𝑥𝐵) → (𝑥(.r𝐺)(1r𝐺)) = 𝑥)
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14346 1 (𝐺 ∈ Ring → (𝐺s 𝐵) ∈ Ring)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4   = wceq 1402  wcel 2209  Vcvv 2821   Fn wfn 5372  cfv 5377  (class class class)co 6085  Basecbs 13352  s cress 13353  +gcplusg 13431  .rcmulr 13432  Grpcgrp 13805  1rcur 14262  Ringcrg 14300
This proof depends on 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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-mgp 14218  df-ur 14263  df-ring 14302
This theorem is used by:  subrgid  14531
  Copyright terms: Public domain W3C validator