| 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 2761 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 3 | 2 | subrg1cl 20832 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ 𝐴) |
| 4 | subrg1.1 | . . . . 5 ⊢ 𝑆 = (𝑅 ↾s 𝐴) | |
| 5 | 4 | subrgbas 20833 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆)) |
| 6 | 3, 5 | eleqtrd 2863 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (1r‘𝑅) ∈ (Base‘𝑆)) |
| 7 | eqid 2761 | . . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | 7 | subrgss 20824 | . . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
| 9 | 5, 8 | eqsstrrd 3966 | . . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅)) |
| 10 | 9 | sselda 3931 | . . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑆)) → 𝑥 ∈ (Base‘𝑅)) |
| 11 | subrgrcl 20828 | . . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring) | |
| 12 | eqid 2761 | . . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 13 | 7, 12, 2 | ringidmlem 20497 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑅)) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥)) |
| 14 | 11, 13 | sylan 592 | . . . . . 6 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅)) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑅)(1r‘𝑅)) = 𝑥)) |
| 15 | 4, 12 | ressmulr 17478 | . . . . . . . . . 10 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆)) |
| 16 | 15 | oveqd 7437 | . . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((1r‘𝑅)(.r‘𝑅)𝑥) = ((1r‘𝑅)(.r‘𝑆)𝑥)) |
| 17 | 16 | eqeq1d 2763 | . . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (((1r‘𝑅)(.r‘𝑅)𝑥) = 𝑥 ↔ ((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥)) |
| 18 | 15 | oveqd 7437 | . . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥(.r‘𝑅)(1r‘𝑅)) = (𝑥(.r‘𝑆)(1r‘𝑅))) |
| 19 | 18 | eqeq1d 2763 | . . . . . . . 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 3155 | . . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥 ∈ (Base‘𝑆)(((1r‘𝑅)(.r‘𝑆)𝑥) = 𝑥 ∧ (𝑥(.r‘𝑆)(1r‘𝑅)) = 𝑥)) |
| 25 | 4 | subrgring 20826 | . . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring) |
| 26 | eqid 2761 | . . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 27 | eqid 2761 | . . . . 5 ⊢ (.r‘𝑆) = (.r‘𝑆) | |
| 28 | eqid 2761 | . . . . 5 ⊢ (1r‘𝑆) = (1r‘𝑆) | |
| 29 | 26, 27, 28 | isringid 20500 | . . . 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 2815 | 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 2145 ∀wral 3077 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 ↾s cress 17408 .rcmulr 17429 1rcur 20407 Ringcrg 20459 SubRingcsubrg 20821 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-0g 17612 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-subg 19333 df-mgp 20361 df-ur 20408 df-ring 20461 df-subrg 20822 |
| This theorem is used by: subrguss 20839 subrginv 20840 subrgunit 20842 subrgnzr 20846 subsubrg 20850 imadrhmcl 21054 sralmod 21462 gzrngunitlem 21738 zring1 21765 re1r 21919 ressascl 22204 mpl1 22319 subrgmvr 22342 evlsmaprhm 22440 evls1maprhm 22694 scmatsrng1 22838 scmatmhm 22849 clm1 25394 isclmp 25418 qrng1 27949 subrgchr 33797 ressply1mon1p 34100 mplvrpmrhm 34179 algextdeglem4 34352 evlsbagval 43614 |
| Copyright terms: Public domain | W3C validator |