| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > df2idl2rng | GIF version | ||
| Description: Alternate (the usual textbook) definition of a two-sided ideal of a non-unital ring to be a subgroup of the additive group of the ring which is closed under left- and right-multiplication by elements of the full ring. (Contributed by AV, 21-Mar-2025.) |
| Ref | Expression |
|---|---|
| df2idl2rng.u | ⊢ 𝑈 = (2Ideal‘𝑅) |
| df2idl2rng.b | ⊢ 𝐵 = (Base‘𝑅) |
| df2idl2rng.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| df2idl2rng | ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ((𝑥 · 𝑦) ∈ 𝐼 ∧ (𝑦 · 𝑥) ∈ 𝐼))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2238 | . . . 4 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅) | |
| 2 | df2idl2rng.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | df2idl2rng.t | . . . 4 ⊢ · = (.r‘𝑅) | |
| 4 | 1, 2, 3 | dflidl2rng 14820 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ (LIdeal‘𝑅) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼)) |
| 5 | eqid 2238 | . . . 4 ⊢ (LIdeal‘(oppr‘𝑅)) = (LIdeal‘(oppr‘𝑅)) | |
| 6 | 5, 2, 3 | isridlrng 14821 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ (LIdeal‘(oppr‘𝑅)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼)) |
| 7 | 4, 6 | anbi12d 477 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → ((𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐼 ∈ (LIdeal‘(oppr‘𝑅))) ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))) |
| 8 | eqid 2238 | . . 3 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 9 | df2idl2rng.u | . . 3 ⊢ 𝑈 = (2Ideal‘𝑅) | |
| 10 | 1, 8, 5, 9 | 2idlelb 14844 | . 2 ⊢ (𝐼 ∈ 𝑈 ↔ (𝐼 ∈ (LIdeal‘𝑅) ∧ 𝐼 ∈ (LIdeal‘(oppr‘𝑅)))) |
| 11 | r19.26-2 2680 | . 2 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ((𝑥 · 𝑦) ∈ 𝐼 ∧ (𝑦 · 𝑥) ∈ 𝐼) ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥 · 𝑦) ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼)) | |
| 12 | 7, 10, 11 | 3bitr4g 223 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 ((𝑥 · 𝑦) ∈ 𝐼 ∧ (𝑦 · 𝑥) ∈ 𝐼))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ‘cfv 5377 (class class class)co 6085 Basecbs 13354 .rcmulr 13434 SubGrpcsubg 13972 Rngcrng 14233 opprcoppr 14374 LIdealclidl 14806 2Idealc2idl 14838 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-pre-ltirr 8291 ax-pre-lttrn 8293 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-tpos 6516 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-5 9367 df-6 9368 df-7 9369 df-8 9370 df-ndx 13357 df-slot 13358 df-base 13360 df-sets 13361 df-iress 13362 df-plusg 13446 df-mulr 13447 df-sca 13449 df-vsca 13450 df-ip 13451 df-0g 13614 df-mgm 13678 df-sgrp 13719 df-mnd 13732 df-grp 13810 df-subg 13975 df-cmn 14091 df-abl 14092 df-mgp 14220 df-rng 14234 df-oppr 14375 df-lssm 14692 df-sra 14774 df-rgmod 14775 df-lidl 14808 df-2idl 14839 |
| This theorem is used by: df2idl2 14848 |
| Copyright terms: Public domain | W3C validator |