| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnglidl1 | Structured version Visualization version GIF version | ||
| Description: The base set of every non-unital ring is an ideal. For unital rings, such ideals are called "unit ideals", see lidl1 21338. (Contributed by AV, 19-Feb-2025.) |
| Ref | Expression |
|---|---|
| rnglidl0.u | ⊢ 𝑈 = (LIdeal‘𝑅) |
| rnglidl1.b | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| rnglidl1 | ⊢ (𝑅 ∈ Rng → 𝐵 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnglidl1.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | 1 | eqimssi 3996 | . . 3 ⊢ 𝐵 ⊆ (Base‘𝑅) |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ⊆ (Base‘𝑅)) |
| 4 | rnggrp 20235 | . . 3 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 5 | 1 | grpbn0 19032 | . . 3 ⊢ (𝑅 ∈ Grp → 𝐵 ≠ ∅) |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ≠ ∅) |
| 7 | eqid 2761 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4 | adantr 485 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Grp) |
| 9 | simpl 487 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Rng) | |
| 10 | 1 | eqcomi 2770 | . . . . . . . . 9 ⊢ (Base‘𝑅) = 𝐵 |
| 11 | 10 | eleq2i 2853 | . . . . . . . 8 ⊢ (𝑥 ∈ (Base‘𝑅) ↔ 𝑥 ∈ 𝐵) |
| 12 | 11 | biimpi 219 | . . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝑅) → 𝑥 ∈ 𝐵) |
| 13 | 12 | 3ad2ant1 1149 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → 𝑥 ∈ 𝐵) |
| 14 | 13 | adantl 486 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑥 ∈ 𝐵) |
| 15 | simpr2 1212 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 16 | eqid 2761 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | rngcl 20241 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 18 | 9, 14, 15, 17 | syl3anc 1396 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 19 | simpr3 1213 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵) | |
| 20 | 1, 7, 8, 18, 19 | grpcld 19013 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 21 | 20 | ralrimivvva 3209 | . 2 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 22 | rnglidl0.u | . . 3 ⊢ 𝑈 = (LIdeal‘𝑅) | |
| 23 | eqid 2761 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 24 | 22, 23, 7, 16 | islidl 21319 | . 2 ⊢ (𝐵 ∈ 𝑈 ↔ (𝐵 ⊆ (Base‘𝑅) ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵)) |
| 25 | 3, 6, 21, 24 | syl3anbrc 1360 | 1 ⊢ (𝑅 ∈ Rng → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 ∀wral 3077 ⊆ wss 3904 ∅c0 4285 ‘cfv 6536 (class class class)co 7410 Basecbs 17268 +gcplusg 17309 .rcmulr 17310 Grpcgrp 18999 Rngcrng 20229 LIdealclidl 21309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 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 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-sca 17325 df-vsca 17326 df-ip 17327 df-0g 17493 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-grp 19002 df-abl 19852 df-mgp 20216 df-rng 20230 df-lss 21032 df-sra 21273 df-rgmod 21274 df-lidl 21311 |
| This theorem is referenced by: lidl1 21338 |
| Copyright terms: Public domain | W3C validator |