| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rngressid | GIF version | ||
| Description: A non-unital ring restricted to its base set is a non-unital ring. It will usually be the original non-unital ring exactly, of course, but to show that needs additional conditions such as those in strressid 13402. (Contributed by Jim Kingdon, 5-May-2025.) |
| Ref | Expression |
|---|---|
| rngressid.b | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| rngressid | ⊢ (𝐺 ∈ Rng → (𝐺 ↾s 𝐵) ∈ Rng) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqidd 2239 | . . 3 ⊢ (𝐺 ∈ Rng → (𝐺 ↾s 𝐵) = (𝐺 ↾s 𝐵)) | |
| 2 | rngressid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 2 | a1i 9 | . . 3 ⊢ (𝐺 ∈ Rng → 𝐵 = (Base‘𝐺)) |
| 4 | id 19 | . . 3 ⊢ (𝐺 ∈ Rng → 𝐺 ∈ Rng) | |
| 5 | ssidd 3269 | . . 3 ⊢ (𝐺 ∈ Rng → 𝐵 ⊆ 𝐵) | |
| 6 | 1, 3, 4, 5 | ressbas2d 13399 | . 2 ⊢ (𝐺 ∈ Rng → 𝐵 = (Base‘(𝐺 ↾s 𝐵))) |
| 7 | eqidd 2239 | . . 3 ⊢ (𝐺 ∈ Rng → (+g‘𝐺) = (+g‘𝐺)) | |
| 8 | basfn 13389 | . . . . 5 ⊢ Base Fn V | |
| 9 | elex 2833 | . . . . 5 ⊢ (𝐺 ∈ Rng → 𝐺 ∈ V) | |
| 10 | funfvex 5707 | . . . . . 6 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V) | |
| 11 | 10 | funfni 5478 | . . . . 5 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V) |
| 12 | 8, 9, 11 | sylancr 418 | . . . 4 ⊢ (𝐺 ∈ Rng → (Base‘𝐺) ∈ V) |
| 13 | 2, 12 | eqeltrid 2325 | . . 3 ⊢ (𝐺 ∈ Rng → 𝐵 ∈ V) |
| 14 | 1, 7, 13, 9 | ressplusgd 13460 | . 2 ⊢ (𝐺 ∈ Rng → (+g‘𝐺) = (+g‘(𝐺 ↾s 𝐵))) |
| 15 | eqid 2238 | . . . 4 ⊢ (𝐺 ↾s 𝐵) = (𝐺 ↾s 𝐵) | |
| 16 | eqid 2238 | . . . 4 ⊢ (.r‘𝐺) = (.r‘𝐺) | |
| 17 | 15, 16 | ressmulrg 13476 | . . 3 ⊢ ((𝐵 ∈ V ∧ 𝐺 ∈ Rng) → (.r‘𝐺) = (.r‘(𝐺 ↾s 𝐵))) |
| 18 | 13, 17 | mpancom 426 | . 2 ⊢ (𝐺 ∈ Rng → (.r‘𝐺) = (.r‘(𝐺 ↾s 𝐵))) |
| 19 | rngabl 14209 | . . 3 ⊢ (𝐺 ∈ Rng → 𝐺 ∈ Abel) | |
| 20 | 2 | ablressid 14116 | . . 3 ⊢ (𝐺 ∈ Abel → (𝐺 ↾s 𝐵) ∈ Abel) |
| 21 | 19, 20 | syl 14 | . 2 ⊢ (𝐺 ∈ Rng → (𝐺 ↾s 𝐵) ∈ Abel) |
| 22 | 2, 16 | rngcl 14218 | . 2 ⊢ ((𝐺 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝐺)𝑦) ∈ 𝐵) |
| 23 | 2, 16 | rngass 14213 | . 2 ⊢ ((𝐺 ∈ Rng ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝐺)𝑦)(.r‘𝐺)𝑧) = (𝑥(.r‘𝐺)(𝑦(.r‘𝐺)𝑧))) |
| 24 | eqid 2238 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 25 | 2, 24, 16 | rngdi 14214 | . 2 ⊢ ((𝐺 ∈ Rng ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝐺)(𝑦(+g‘𝐺)𝑧)) = ((𝑥(.r‘𝐺)𝑦)(+g‘𝐺)(𝑥(.r‘𝐺)𝑧))) |
| 26 | 2, 24, 16 | rngdir 14215 | . 2 ⊢ ((𝐺 ∈ Rng ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(+g‘𝐺)𝑦)(.r‘𝐺)𝑧) = ((𝑥(.r‘𝐺)𝑧)(+g‘𝐺)(𝑦(.r‘𝐺)𝑧))) |
| 27 | 6, 14, 18, 21, 22, 23, 25, 26 | isrngd 14227 | 1 ⊢ (𝐺 ∈ Rng → (𝐺 ↾s 𝐵) ∈ Rng) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 Fn wfn 5367 ‘cfv 5372 (class class class)co 6075 Basecbs 13330 ↾s cress 13331 +gcplusg 13408 .rcmulr 13409 Abelcabl 14065 Rngcrng 14206 |
| 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-coll 4241 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-lttrn 8283 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-iun 4009 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-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 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-iress 13338 df-plusg 13421 df-mulr 13422 df-0g 13589 df-mgm 13653 df-sgrp 13694 df-mnd 13707 df-grp 13785 df-minusg 13786 df-cmn 14066 df-abl 14067 df-mgp 14195 df-rng 14207 |
| This theorem is referenced by: subrngid 14482 |
| Copyright terms: Public domain | W3C validator |