ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dflidl2rng GIF version

Theorem dflidl2rng 13980
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.)
Hypotheses
Ref Expression
dflidl2rng.u 𝑈 = (LIdeal‘𝑅)
dflidl2rng.b 𝐵 = (Base‘𝑅)
dflidl2rng.t · = (.r𝑅)
Assertion
Ref Expression
dflidl2rng ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼𝑈 ↔ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐼,𝑦   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦
Allowed substitution hints:   · (𝑥,𝑦)

Proof of Theorem dflidl2rng
Dummy variables 𝑧 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 527 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → 𝑅 ∈ Rng)
2 simpr 110 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → 𝐼𝑈)
3 eqid 2193 . . . . . . 7 (0g𝑅) = (0g𝑅)
43subg0cl 13255 . . . . . 6 (𝐼 ∈ (SubGrp‘𝑅) → (0g𝑅) ∈ 𝐼)
54ad2antlr 489 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → (0g𝑅) ∈ 𝐼)
61, 2, 53jca 1179 . . . 4 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → (𝑅 ∈ Rng ∧ 𝐼𝑈 ∧ (0g𝑅) ∈ 𝐼))
7 dflidl2rng.b . . . . 5 𝐵 = (Base‘𝑅)
8 dflidl2rng.t . . . . 5 · = (.r𝑅)
9 dflidl2rng.u . . . . 5 𝑈 = (LIdeal‘𝑅)
103, 7, 8, 9rnglidlmcl 13979 . . . 4 (((𝑅 ∈ Rng ∧ 𝐼𝑈 ∧ (0g𝑅) ∈ 𝐼) ∧ (𝑥𝐵𝑦𝐼)) → (𝑥 · 𝑦) ∈ 𝐼)
116, 10sylan 283 . . 3 ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) ∧ (𝑥𝐵𝑦𝐼)) → (𝑥 · 𝑦) ∈ 𝐼)
1211ralrimivva 2576 . 2 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼)
137subgss 13247 . . . 4 (𝐼 ∈ (SubGrp‘𝑅) → 𝐼𝐵)
1413ad2antlr 489 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼𝐵)
15 elex2 2776 . . . . 5 ((0g𝑅) ∈ 𝐼 → ∃𝑗 𝑗𝐼)
164, 15syl 14 . . . 4 (𝐼 ∈ (SubGrp‘𝑅) → ∃𝑗 𝑗𝐼)
1716ad2antlr 489 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → ∃𝑗 𝑗𝐼)
18 eqid 2193 . . . . . . . . 9 (+g𝑅) = (+g𝑅)
1918subgcl 13257 . . . . . . . 8 ((𝐼 ∈ (SubGrp‘𝑅) ∧ (𝑥 · 𝑦) ∈ 𝐼𝑧𝐼) → ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2019ad5ant245 1238 . . . . . . 7 (((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) ∧ 𝑧𝐼) → ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2120ralrimiva 2567 . . . . . 6 ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2221ex 115 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) → ((𝑥 · 𝑦) ∈ 𝐼 → ∀𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2322ralimdvva 2563 . . . 4 ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼 → ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2423imp 124 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
259, 7, 18, 8islidlm 13978 . . 3 (𝐼𝑈 ↔ (𝐼𝐵 ∧ ∃𝑗 𝑗𝐼 ∧ ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2614, 17, 24, 25syl3anbrc 1183 . 2 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼𝑈)
2712, 26impbida 596 1 ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼𝑈 ↔ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wex 1503  wcel 2164  wral 2472  wss 3154  cfv 5255  (class class class)co 5919  Basecbs 12621  +gcplusg 12698  .rcmulr 12699  0gc0g 12870  SubGrpcsubg 13240  Rngcrng 13431  LIdealclidl 13966
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-lttrn 7988  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-3 9044  df-4 9045  df-5 9046  df-6 9047  df-7 9048  df-8 9049  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629  df-plusg 12711  df-mulr 12712  df-sca 12714  df-vsca 12715  df-ip 12716  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078  df-subg 13243  df-abl 13360  df-mgp 13420  df-rng 13432  df-lssm 13852  df-sra 13934  df-rgmod 13935  df-lidl 13968
This theorem is referenced by:  isridlrng  13981  dflidl2  13987  df2idl2rng  14007
  Copyright terms: Public domain W3C validator