| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subrg1 | Structured version Visualization version GIF version | ||
| Description: A subring always has the same multiplicative identity. (Contributed by Stefan O'Rear, 27-Nov-2014.) |
| Ref | Expression |
|---|---|
| subrg1.1 | ⊢ 𝑆 = (𝑅 ↾s 𝐴) |
| subrg1.2 | ⊢ 1 = (1r‘𝑅) |
| Ref | Expression |
|---|---|
| subrg1 | ⊢ (𝐴 ∈ (SubRing‘𝑅) → 1 = (1r‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subrg1.2 | . 2 ⊢ 1 = (1r‘𝑅) | |
| 2 | eqid 2765 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 3 | 2 | subrg1cl 20708 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 4 | subrg1.1 | . . . . 5 ⊢ 𝑆 = (𝑅 ↾s 𝐴) | |
| 5 | 4 | subrgbas 20709 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆)) |
| 6 | 3, 5 | eleqtrd 2867 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ (Base‘𝑆)) |
| 7 | eqid 2765 | . . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | 7 | subrgss 20700 | . . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 9 | 5, 8 | eqsstrrd 3973 | . . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅)) |
| 10 | 9 | sselda 3938 | . . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑆)) → 𝑥 ∈ (Base‘𝑅)) |
| 11 | subrgrcl 20704 | . . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 12 | eqid 2765 | . . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 13 | 7, 12, 2 | ringidmlem 20375 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅)) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥)) |
| 14 | 11, 13 | sylan 592 | . . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥)) |
| 15 | 4, 12 | ressmulr 17377 | . . . . . . . . . 10 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆)) |
| 16 | 15 | oveqd 7433 | . . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((1r‘𝑅)(.r‘𝑅)𝑥) = ((1r‘𝑅)(.r‘𝑆)𝑥)) |
| 17 | 16 | eqeq1d 2767 | . . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ↔ ((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥)) |
| 18 | 15 | oveqd 7433 | . . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r‘𝑅)(1r‘𝑅)) = (𝑥(.r‘𝑆)(1r‘𝑅))) |
| 19 | 18 | eqeq1d 2767 | . . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥 ↔ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 20 | 17, 19 | anbi12d 644 | . . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥) ↔ (((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥))) |
| 21 | 20 | biimpa 482 | . . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥)) → (((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 22 | 14, 21 | syldan 603 | . . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 23 | 10, 22 | syldan 603 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑆)) → (((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 24 | 23 | ralrimiva 3159 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ (Base‘𝑆)(((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 25 | 4 | subrgring 20702 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring) |
| 26 | eqid 2765 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 27 | eqid 2765 | . . . . 5 ⊢ (.r‘𝑆) = (.r‘𝑆) | |
| 28 | eqid 2765 | . . . . 5 ⊢ (1r‘𝑆) = (1r‘𝑆) | |
| 29 | 26, 27, 28 | isringid 20378 | . . . 4 ⊢ (𝑆 ∈ Ring → (((1r‘𝑅) ∈ (Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑆)(((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) ↔ (1r‘𝑆) = (1r‘𝑅))) |
| 30 | 25, 29 | syl 18 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (((1r‘𝑅) ∈ (Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑆)(((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) ↔ (1r‘𝑆) = (1r‘𝑅))) |
| 31 | 6, 24, 30 | mpbi2and 725 | . 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑆) = (1r‘𝑅)) |
| 32 | 1, 31 | eqtr4id 2819 | 1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 1 = (1r‘𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ‘cfv 6540 (class class class)co 7416 Basecbs 17286 ↾s cress 17307 .rcmulr 17328 1rcur 20286 Ringcrg 20338 SubRingcsubrg 20697 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-nn 12245 df-2 12314 df-3 12315 df-sets 17241 df-slot 17259 df-ndx 17271 df-base 17287 df-ress 17308 df-plusg 17340 df-mulr 17341 df-0g 17511 df-mgm 18715 df-sgrp 18798 df-mnd 18814 df-subg 19212 df-mgp 20240 df-ur 20287 df-ring 20340 df-subrg 20698 |
| This theorem is used by: subrguss 20715 subrginv 20716 subrgunit 20718 subrgnzr 20722 subsubrg 20726 imadrhmcl 20929 sralmod 21337 gzrngunitlem 21611 zring1 21638 re1r 21792 ressascl 22075 mpl1 22190 subrgmvr 22213 evlsmaprhm 22311 evls1maprhm 22565 scmatsrng1 22709 scmatmhm 22720 clm1 25261 isclmp 25285 qrng1 27815 subrgchr 33579 ressply1mon1p 33881 mplvrpmrhm 33960 algextdeglem4 34133 evlsbagval 43351 |
| Copyright terms: Public domain | W3C validator |