| 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 21192. (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 3995 | . . 3 ⊢ 𝐵 ⊆ (Base‘𝑅) |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ⊆ (Base‘𝑅)) |
| 4 | rnggrp 20097 | . . 3 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 5 | 1 | grpbn0 18900 | . . 3 ⊢ (𝑅 ∈ Grp → 𝐵 ≠ ∅) |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ≠ ∅) |
| 7 | eqid 2737 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4 | adantr 480 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Grp) |
| 9 | simpl 482 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Rng) | |
| 10 | 1 | eqcomi 2746 | . . . . . . . . 9 ⊢ (Base‘𝑅) = 𝐵 |
| 11 | 10 | eleq2i 2829 | . . . . . . . 8 ⊢ (𝑥 ∈ (Base‘𝑅) ↔ 𝑥 ∈ 𝐵) |
| 12 | 11 | biimpi 216 | . . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝑅) → 𝑥 ∈ 𝐵) |
| 13 | 12 | 3ad2ant1 1134 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → 𝑥 ∈ 𝐵) |
| 14 | 13 | adantl 481 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑥 ∈ 𝐵) |
| 15 | simpr2 1197 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 16 | eqid 2737 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | rngcl 20103 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 18 | 9, 14, 15, 17 | syl3anc 1374 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 19 | simpr3 1198 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵) | |
| 20 | 1, 7, 8, 18, 19 | grpcld 18881 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 21 | 20 | ralrimivvva 3183 | . 2 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 22 | rnglidl0.u | . . 3 ⊢ 𝑈 = (LIdeal‘𝑅) | |
| 23 | eqid 2737 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 24 | 22, 23, 7, 16 | islidl 21174 | . 2 ⊢ (𝐵 ∈ 𝑈 ↔ (𝐵 ⊆ (Base‘𝑅) ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵)) |
| 25 | 3, 6, 21, 24 | syl3anbrc 1345 | 1 ⊢ (𝑅 ∈ Rng → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ⊆ wss 3902 ∅c0 4286 ‘cfv 6493 (class class class)co 7360 Basecbs 17140 +gcplusg 17181 .rcmulr 17182 Grpcgrp 18867 Rngcrng 20091 LIdealclidl 21165 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-ress 17162 df-plusg 17194 df-sca 17197 df-vsca 17198 df-ip 17199 df-0g 17365 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-grp 18870 df-abl 19716 df-mgp 20080 df-rng 20092 df-lss 20887 df-sra 21129 df-rgmod 21130 df-lidl 21167 |
| This theorem is referenced by: lidl1 21192 |
| Copyright terms: Public domain | W3C validator |