| 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 21423. (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 3994 | . . 3 ⊢ 𝐵 ⊆ (Base‘𝑅) |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ⊆ (Base‘𝑅)) |
| 4 | rnggrp 20294 | . . 3 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 5 | 1 | grpbn0 19091 | . . 3 ⊢ (𝑅 ∈ Grp → 𝐵 ≠ ∅) |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝑅 ∈ Rng → 𝐵 ≠ ∅) |
| 7 | eqid 2762 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4 | adantr 486 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Grp) |
| 9 | simpl 488 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑅 ∈ Rng) | |
| 10 | 1 | eqcomi 2771 | . . . . . . . . 9 ⊢ (Base‘𝑅) = 𝐵 |
| 11 | 10 | eleq2i 2854 | . . . . . . . 8 ⊢ (𝑥 ∈ (Base‘𝑅) ↔ 𝑥 ∈ 𝐵) |
| 12 | 11 | biimpi 219 | . . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝑅) → 𝑥 ∈ 𝐵) |
| 13 | 12 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → 𝑥 ∈ 𝐵) |
| 14 | 13 | adantl 487 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑥 ∈ 𝐵) |
| 15 | simpr2 1214 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 16 | eqid 2762 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | rngcl 20300 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 18 | 9, 14, 15, 17 | syl3anc 1398 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥(.r‘𝑅)𝑦) ∈ 𝐵) |
| 19 | simpr3 1215 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵) | |
| 20 | 1, 7, 8, 18, 19 | grpcld 19072 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 21 | 20 | ralrimivvva 3210 | . 2 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵) |
| 22 | rnglidl0.u | . . 3 ⊢ 𝑈 = (LIdeal‘𝑅) | |
| 23 | eqid 2762 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 24 | 22, 23, 7, 16 | islidl 21404 | . 2 ⊢ (𝐵 ∈ 𝑈 ↔ (𝐵 ⊆ (Base‘𝑅) ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)𝑧) ∈ 𝐵)) |
| 25 | 3, 6, 21, 24 | syl3anbrc 1362 | 1 ⊢ (𝑅 ∈ Rng → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ⊆ wss 3902 ∅c0 4282 ‘cfv 6537 (class class class)co 7416 Basecbs 17305 +gcplusg 17346 .rcmulr 17347 Grpcgrp 19058 Rngcrng 20288 LIdealclidl 21394 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-sca 17362 df-vsca 17363 df-ip 17364 df-0g 17530 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-grp 19061 df-abl 19911 df-mgp 20275 df-rng 20289 df-lss 21117 df-sra 21358 df-rgmod 21359 df-lidl 21396 |
| This theorem is used by: lidl1 21423 |
| Copyright terms: Public domain | W3C validator |