| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dflidl2rng | Structured version Visualization version GIF version | ||
| Description: Alternate (the usual textbook) definition of a (left) ideal of a non-unital ring to be a subgroup of the additive group of the ring which is closed under left-multiplication by elements of the full ring. (Contributed by AV, 21-Mar-2025.) |
| Ref | Expression |
|---|---|
| dflidl2rng.u | ⊢ 𝑈 = (LIdeal‘𝑅) |
| dflidl2rng.b | ⊢ 𝐵 = (Base‘𝑅) |
| dflidl2rng.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| dflidl2rng | ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 779 | . . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) → 𝑅 ∈ Rng) | |
| 2 | simpr 490 | . . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) → 𝐼 ∈ 𝑈) | |
| 3 | eqid 2760 | . . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 4 | 3 | subg0cl 19305 | . . . . . 6 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → (0g‘𝑅) ∈ 𝐼) |
| 5 | 4 | ad2antlr 740 | . . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) → (0g‘𝑅) ∈ 𝐼) |
| 6 | 1, 2, 5 | 3jca 1146 | . . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) → (𝑅 ∈ Rng ∧ 𝐼 ∈ 𝑈 ∧ (0g‘𝑅) ∈ 𝐼)) |
| 7 | dflidl2rng.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | dflidl2rng.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 9 | dflidl2rng.u | . . . . 5 ⊢ 𝑈 = (LIdeal‘𝑅) | |
| 10 | 3, 7, 8, 9 | rnglidlmcl 21456 | . . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ 𝑈 ∧ (0g‘𝑅) ∈ 𝐼) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼)) → (𝑥 · 𝑦) ∈ 𝐼) |
| 11 | 6, 10 | sylan 592 | . . 3 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼)) → (𝑥 · 𝑦) ∈ 𝐼) |
| 12 | 11 | ralrimivva 3205 | . 2 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼 ∈ 𝑈) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼) |
| 13 | 7 | subgss 19298 | . . . 4 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → 𝐼 ⊆ 𝐵) |
| 14 | 13 | ad2antlr 740 | . . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼 ⊆ 𝐵) |
| 15 | 4 | ne0d 4287 | . . . 4 ⊢ (𝐼 ∈ (SubGrp‘𝑅) → 𝐼 ≠ ∅) |
| 16 | 15 | ad2antlr 740 | . . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼 ≠ ∅) |
| 17 | eqid 2760 | . . . . . . . . 9 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 18 | 17 | subgcl 19307 | . . . . . . . 8 ⊢ ((𝐼 ∈ (SubGrp‘𝑅) ∧ (𝑥 · 𝑦) ∈ 𝐼 ∧ 𝑧 ∈ 𝐼) → ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼) |
| 19 | 18 | ad5ant245 1384 | . . . . . . 7 ⊢ (((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) ∧ 𝑧 ∈ 𝐼) → ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼) |
| 20 | 19 | ralrimiva 3154 | . . . . . 6 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑧 ∈ 𝐼 ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼) |
| 21 | 20 | ex 418 | . . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼)) → ((𝑥 · 𝑦) ∈ 𝐼 → ∀𝑧 ∈ 𝐼 ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼)) |
| 22 | 21 | ralimdvva 3209 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ∀𝑧 ∈ 𝐼 ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼)) |
| 23 | 22 | imp 412 | . . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ∀𝑧 ∈ 𝐼 ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼) |
| 24 | 9, 7, 17, 8 | islidl 21455 | . . 3 ⊢ (𝐼 ∈ 𝑈 ↔ (𝐼 ⊆ 𝐵 ∧ 𝐼 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ∀𝑧 ∈ 𝐼 ((𝑥 · 𝑦)(+g‘𝑅)𝑧) ∈ 𝐼)) |
| 25 | 14, 16, 23, 24 | syl3anbrc 1362 | . 2 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼 ∈ 𝑈) |
| 26 | 12, 25 | impbida 813 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 ⊆ wss 3898 ∅c0 4278 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 +gcplusg 17389 .rcmulr 17390 0gc0g 17571 SubGrpcsubg 19291 Rngcrng 20335 LIdealclidl 21445 |
| 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 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-nn 12305 df-2 12374 df-3 12375 df-4 12376 df-5 12377 df-6 12378 df-7 12379 df-8 12380 df-sets 17303 df-slot 17321 df-ndx 17333 df-base 17349 df-ress 17370 df-plusg 17402 df-sca 17405 df-vsca 17406 df-ip 17407 df-0g 17573 df-mgm 18777 df-sgrp 18869 df-mnd 18885 df-grp 19108 df-subg 19294 df-abl 19958 df-mgp 20322 df-rng 20336 df-lss 21168 df-sra 21409 df-rgmod 21410 df-lidl 21447 |
| This theorem is used by: isridlrng 21459 dflidl2 21468 df2idl2rng 21511 |
| Copyright terms: Public domain | W3C validator |