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

Theorem ringressid 14477
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 13484. (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 13481 . 2 (𝐺 ∈ Ring → 𝐵 = (Base‘(𝐺 ↾s 𝐵)))
7 eqidd 2239 . . 3 (𝐺 ∈ Ring → (+g‘𝐺) = (+g‘𝐺))
8 basfn 13469 . . . . 5 Base Fn V
9 elex 2833 . . . . 5 (𝐺 ∈ Ring → 𝐺 ∈ V)
10 funfvex 5715 . . . . . 6 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1110funfni 5486 . . . . 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 13542 . 2 (𝐺 ∈ Ring → (+g‘𝐺) = (+g‘(𝐺 ↾s 𝐵)))
15 eqid 2238 . . . 4 (𝐺 ↾s 𝐵) = (𝐺 ↾s 𝐵)
16 eqid 2238 . . . 4 (.r‘𝐺) = (.r‘𝐺)
1715, 16ressmulrg 13558 . . 3 ((𝐵 ∈ V ∧ 𝐺 ∈ Ring) → (.r‘𝐺) = (.r‘(𝐺 ↾s 𝐵)))
1813, 17mpancom 426 . 2 (𝐺 ∈ Ring → (.r‘𝐺) = (.r‘(𝐺 ↾s 𝐵)))
19 ringgrp 14412 . . 3 (𝐺 ∈ Ring → 𝐺 ∈ Grp)
202grpressid 13925 . . 3 (𝐺 ∈ Grp → (𝐺 ↾s 𝐵) ∈ Grp)
2119, 20syl 14 . 2 (𝐺 ∈ Ring → (𝐺 ↾s 𝐵) ∈ Grp)
222, 16ringcl 14424 . 2 ((𝐺 ∈ Ring ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐺)𝑦) ∈ 𝐵)
232, 16ringass 14427 . 2 ((𝐺 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝐺)𝑦)(.r‘𝐺)𝑧) = (𝑥(.r‘𝐺)(𝑦(.r‘𝐺)𝑧)))
24 eqid 2238 . . 3 (+g‘𝐺) = (+g‘𝐺)
252, 24, 16ringdi 14430 . 2 ((𝐺 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝐺)(𝑦(+g‘𝐺)𝑧)) = ((𝑥(.r‘𝐺)𝑦)(+g‘𝐺)(𝑥(.r‘𝐺)𝑧)))
262, 24, 16ringdir 14431 . 2 ((𝐺 ∈ Ring ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(+g‘𝐺)𝑦)(.r‘𝐺)𝑧) = ((𝑥(.r‘𝐺)𝑧)(+g‘𝐺)(𝑦(.r‘𝐺)𝑧)))
27 eqid 2238 . . 3 (1r‘𝐺) = (1r‘𝐺)
282, 27ringidcl 14432 . 2 (𝐺 ∈ Ring → (1r‘𝐺) ∈ 𝐵)
292, 16, 27ringlidm 14435 . 2 ((𝐺 ∈ Ring ∧ 𝑥 ∈ 𝐵) → ((1r‘𝐺)(.r‘𝐺)𝑥) = 𝑥)
302, 16, 27ringridm 14436 . 2 ((𝐺 ∈ Ring ∧ 𝑥 ∈ 𝐵) → (𝑥(.r‘𝐺)(1r‘𝐺)) = 𝑥)
316, 14, 18, 21, 22, 23, 25, 26, 28, 29, 30isringd 14453 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 5375  ‘cfv 5380  (class class class)co 6088  Basecbs 13410   ↾s cress 13411  +gcplusg 13490  .rcmulr 13491  Grpcgrp 13864  1rcur 14369  Ringcrg 14407
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-mgp 14325  df-ur 14370  df-ring 14409
This theorem is used by:  subrgid  14640
  Copyright terms: Public domain W3C validator