| 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 2765 | . 2 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 2 | eqid 2765 | . 2 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 3 | eqid 2765 | . 2 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 4 | simp3 1154 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 ∈ 𝐴) | |
| 5 | ringidss.g | . . . . 5 ⊢ 𝑀 = ((mulGrp‘𝑅) ↾s 𝐴) | |
| 6 | eqid 2765 | . . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 7 | ringidss.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | 6, 7 | mgpbas 20209 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
| 9 | 5, 8 | ressbas2 17286 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 = (Base‘𝑀)) |
| 10 | 9 | 3ad2ant2 1150 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 = (Base‘𝑀)) |
| 11 | 4, 10 | eleqtrd 2867 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 ∈ (Base‘𝑀)) |
| 12 | simp2 1153 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 ⊆ 𝐵) | |
| 13 | 10, 12 | eqsstrrd 3974 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → (Base‘𝑀) ⊆ 𝐵) |
| 14 | 13 | sselda 3939 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → 𝑦 ∈ 𝐵) |
| 15 | fvex 6884 | . . . . . . . 8 ⊢ (Base‘𝑀) ∈ V | |
| 16 | 10, 15 | eqeltrdi 2873 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 𝐴 ∈ V) |
| 17 | eqid 2765 | . . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 18 | 6, 17 | mgpplusg 20208 | . . . . . . . 8 ⊢ (.r‘𝑅) = (+g‘(mulGrp‘𝑅)) |
| 19 | 5, 18 | ressplusg 17332 | . . . . . . 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 7417 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = ( 1 (+g‘𝑀)𝑦)) |
| 23 | ringidss.u | . . . . . 6 ⊢ 1 = (1r‘𝑅) | |
| 24 | 7, 17, 23 | ringlidm 20340 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = 𝑦) |
| 25 | 24 | 3ad2antl1 1202 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (.r‘𝑅)𝑦) = 𝑦) |
| 26 | 22, 25 | eqtr3d 2802 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ( 1 (+g‘𝑀)𝑦) = 𝑦) |
| 27 | 14, 26 | syldan 602 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → ( 1 (+g‘𝑀)𝑦) = 𝑦) |
| 28 | 21 | oveqd 7417 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = (𝑦(+g‘𝑀) 1 )) |
| 29 | 7, 17, 23 | ringridm 20341 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = 𝑦) |
| 30 | 29 | 3ad2antl1 1202 | . . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(.r‘𝑅) 1 ) = 𝑦) |
| 31 | 28, 30 | eqtr3d 2802 | . . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑦(+g‘𝑀) 1 ) = 𝑦) |
| 32 | 14, 31 | syldan 602 | . 2 ⊢ (((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) ∧ 𝑦 ∈ (Base‘𝑀)) → (𝑦(+g‘𝑀) 1 ) = 𝑦) |
| 33 | 1, 2, 3, 11, 27, 32 | ismgmid2 18714 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴) → 1 = (0g‘𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ⊆ wss 3907 ‘cfv 6525 (class class class)co 7400 Basecbs 17257 ↾s cress 17278 +gcplusg 17298 .rcmulr 17299 0gc0g 17480 mulGrpcmgp 20204 1rcur 20251 Ringcrg 20303 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 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 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-2 12291 df-sets 17212 df-slot 17230 df-ndx 17242 df-base 17258 df-ress 17279 df-plusg 17311 df-0g 17482 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-mgp 20205 df-ur 20252 df-ring 20305 |
| This theorem is referenced by: unitgrpid 20455 cnmgpid 21536 xrge0iifmhm 34241 |
| Copyright terms: Public domain | W3C validator |