| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ringidss | Structured version Visualization version GIF version | ||
| Description: A subset of the multiplicative group has the multiplicative identity as its identity if the identity is in the subset. (Contributed by Mario Carneiro, 27-Dec-2014.) (Revised by Mario Carneiro, 30-Apr-2015.) |
| Ref | Expression |
|---|---|
| ringidss.g | ⊢ 𝑀 = ((mulGrp‘𝑅) ↾s 𝐴) |
| ringidss.b | ⊢ 𝐵 = (Base‘𝑅) |
| ringidss.u | ⊢ 1 = (1r‘𝑅) |
| Ref | Expression |
|---|---|
| ringidss | ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 = (0g‘𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . 2 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 2 | eqid 2763 | . 2 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 3 | eqid 2763 | . 2 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 4 | simp3 1156 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 ∈ 𝐴) | |
| 5 | ringidss.g | . . . . 5 ⊢ 𝑀 = ((mulGrp‘𝑅) ↾s 𝐴) | |
| 6 | eqid 2763 | . . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 7 | ringidss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | 6, 7 | mgpbas 20222 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
| 9 | 5, 8 | ressbas2 17299 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 = (Base‘𝑀)) |
| 10 | 9 | 3ad2ant2 1152 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 = (Base‘𝑀)) |
| 11 | 4, 10 | eleqtrd 2865 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 ∈ (Base‘𝑀)) |
| 12 | simp2 1155 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 ⊆ 𝐵) | |
| 13 | 10, 12 | eqsstrrd 3973 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → (Base‘𝑀) ⊆ 𝐵) |
| 14 | 13 | sselda 3938 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → 𝑦 ∈ 𝐵) |
| 15 | fvex 6896 | . . . . . . . 8 ⊢ (Base‘𝑀) ∈ V | |
| 16 | 10, 15 | eqeltrdi 2871 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 ∈ V) |
| 17 | eqid 2763 | . . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 18 | 6, 17 | mgpplusg 20221 | . . . . . . . 8 ⊢ (.r‘𝑅) = (+g‘(mulGrp‘𝑅)) |
| 19 | 5, 18 | ressplusg 17345 | . . . . . . 7 ⊢ (𝐴 ∈ V → (.r‘𝑅) = (+g‘𝑀)) |
| 20 | 16, 19 | syl 18 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → (.r‘𝑅) = (+g‘𝑀)) |
| 21 | 20 | adantr 485 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (.r‘𝑅) = (+g‘𝑀)) |
| 22 | 21 | oveqd 7429 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = ( 1 (+g‘𝑀)𝑦)) |
| 23 | ringidss.u | . . . . . 6 ⊢ 1 = (1r‘𝑅) | |
| 24 | 7, 17, 23 | ringlidm 20353 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = 𝑦) |
| 25 | 24 | 3ad2antl1 1204 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = 𝑦) |
| 26 | 22, 25 | eqtr3d 2800 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (+g‘𝑀)𝑦) = 𝑦) |
| 27 | 14, 26 | syldan 602 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → ( 1 (+g‘𝑀)𝑦) = 𝑦) |
| 28 | 21 | oveqd 7429 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = (𝑦(+g‘𝑀) 1 )) |
| 29 | 7, 17, 23 | ringridm 20354 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = 𝑦) |
| 30 | 29 | 3ad2antl1 1204 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = 𝑦) |
| 31 | 28, 30 | eqtr3d 2800 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(+g‘𝑀) 1 ) = 𝑦) |
| 32 | 14, 31 | syldan 602 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → (𝑦(+g‘𝑀) 1 ) = 𝑦) |
| 33 | 1, 2, 3, 11, 27, 32 | ismgmid2 18727 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 = (0g‘𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ⊆ wss 3906 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 ↾s cress 17291 +gcplusg 17311 .rcmulr 17312 0gc0g 17493 mulGrpcmgp 20217 1rcur 20264 Ringcrg 20316 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 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 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-sets 17225 df-slot 17243 df-ndx 17255 df-base 17271 df-ress 17292 df-plusg 17324 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-mgp 20218 df-ur 20265 df-ring 20318 |
| This theorem is referenced by: unitgrpid 20468 cnmgpid 21560 xrge0iifmhm 34310 |
| Copyright terms: Public domain | W3C validator |