| 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 21310. (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 3997 | . . 3 ⊢ 𝐵 ⊆ (Base‘𝑅) |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ⊆ (Base‘𝑅)) |
| 4 | rnggrp 20214 | . . 3 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 5 | 1 | grpbn0 19018 | . . 3 ⊢ (𝑅 ∈ Grp → 𝐵 ≠ ∅) |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ≠ ∅) |
| 7 | eqid 2763 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4 | adantr 484 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Grp) |
| 9 | simpl 486 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Rng) | |
| 10 | 1 | eqcomi 2772 | . . . . . . . . 9 ⊢ (Base‘𝑅) = 𝐵 |
| 11 | 10 | eleq2i 2855 | . . . . . . . 8 ⊢ (𝑥 ∈ (Base‘𝑅) ↔ 𝑥 ∈ 𝐵) |
| 12 | 11 | biimpi 218 | . . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝑅) → 𝑥 ∈ 𝐵) |
| 13 | 12 | 3ad2ant1 1147 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → 𝑥 ∈ 𝐵) |
| 14 | 13 | adantl 485 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑥 ∈ 𝐵) |
| 15 | simpr2 1210 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 16 | eqid 2763 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | rngcl 20220 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 18 | 9, 14, 15, 17 | syl3anc 1392 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 19 | simpr3 1211 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵) | |
| 20 | 1, 7, 8, 18, 19 | grpcld 18999 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 21 | 20 | ralrimivvva 3209 | . 2 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 22 | rnglidl0.u | . . 3 ⊢ 𝑈 = (LIdeal‘𝑅) | |
| 23 | eqid 2763 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 24 | 22, 23, 7, 16 | islidl 21292 | . 2 ⊢ (𝐵 ∈ 𝑈 ↔ (𝐵 ⊆ (Base‘𝑅) ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵)) |
| 25 | 3, 6, 21, 24 | syl3anbrc 1358 | 1 ⊢ (𝑅 ∈ Rng → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 ∀wral 3077 ⊆ wss 3905 ∅c0 4286 ‘cfv 6521 (class class class)co 7396 Basecbs 17255 +gcplusg 17296 .rcmulr 17297 Grpcgrp 18985 Rngcrng 20208 LIdealclidl 21283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-nn 12221 df-2 12290 df-3 12291 df-4 12292 df-5 12293 df-6 12294 df-7 12295 df-8 12296 df-sets 17210 df-slot 17228 df-ndx 17240 df-base 17256 df-ress 17277 df-plusg 17309 df-sca 17312 df-vsca 17313 df-ip 17314 df-0g 17480 df-mgm 18684 df-sgrp 18763 df-mnd 18779 df-grp 18988 df-abl 19833 df-mgp 20197 df-rng 20209 df-lss 21006 df-sra 21247 df-rgmod 21248 df-lidl 21285 |
| This theorem is referenced by: lidl1 21310 |
| Copyright terms: Public domain | W3C validator |