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

Theorem dflidl2rng 14287
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 2206 . . . . . . 7 (0g𝑅) = (0g𝑅)
43subg0cl 13562 . . . . . 6 (𝐼 ∈ (SubGrp‘𝑅) → (0g𝑅) ∈ 𝐼)
54ad2antlr 489 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → (0g𝑅) ∈ 𝐼)
61, 2, 53jca 1180 . . . 4 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → (𝑅 ∈ Rng ∧ 𝐼𝑈 ∧ (0g𝑅) ∈ 𝐼))
7 dflidl2rng.b . . . . 5 𝐵 = (Base‘𝑅)
8 dflidl2rng.t . . . . 5 · = (.r𝑅)
9 dflidl2rng.u . . . . 5 𝑈 = (LIdeal‘𝑅)
103, 7, 8, 9rnglidlmcl 14286 . . . 4 (((𝑅 ∈ Rng ∧ 𝐼𝑈 ∧ (0g𝑅) ∈ 𝐼) ∧ (𝑥𝐵𝑦𝐼)) → (𝑥 · 𝑦) ∈ 𝐼)
116, 10sylan 283 . . 3 ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) ∧ (𝑥𝐵𝑦𝐼)) → (𝑥 · 𝑦) ∈ 𝐼)
1211ralrimivva 2589 . 2 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝐼𝑈) → ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼)
137subgss 13554 . . . 4 (𝐼 ∈ (SubGrp‘𝑅) → 𝐼𝐵)
1413ad2antlr 489 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼𝐵)
15 elex2 2789 . . . . 5 ((0g𝑅) ∈ 𝐼 → ∃𝑗 𝑗𝐼)
164, 15syl 14 . . . 4 (𝐼 ∈ (SubGrp‘𝑅) → ∃𝑗 𝑗𝐼)
1716ad2antlr 489 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → ∃𝑗 𝑗𝐼)
18 eqid 2206 . . . . . . . . 9 (+g𝑅) = (+g𝑅)
1918subgcl 13564 . . . . . . . 8 ((𝐼 ∈ (SubGrp‘𝑅) ∧ (𝑥 · 𝑦) ∈ 𝐼𝑧𝐼) → ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2019ad5ant245 1239 . . . . . . 7 (((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) ∧ 𝑧𝐼) → ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2120ralrimiva 2580 . . . . . 6 ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) ∧ (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
2221ex 115 . . . . 5 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑥𝐵𝑦𝐼)) → ((𝑥 · 𝑦) ∈ 𝐼 → ∀𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2322ralimdvva 2576 . . . 4 ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼 → ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2423imp 124 . . 3 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼)
259, 7, 18, 8islidlm 14285 . . 3 (𝐼𝑈 ↔ (𝐼𝐵 ∧ ∃𝑗 𝑗𝐼 ∧ ∀𝑥𝐵𝑦𝐼𝑧𝐼 ((𝑥 · 𝑦)(+g𝑅)𝑧) ∈ 𝐼))
2614, 17, 24, 25syl3anbrc 1184 . 2 (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼) → 𝐼𝑈)
2712, 26impbida 596 1 ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼𝑈 ↔ ∀𝑥𝐵𝑦𝐼 (𝑥 · 𝑦) ∈ 𝐼))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 981   = wceq 1373  wex 1516  wcel 2177  wral 2485  wss 3167  cfv 5276  (class class class)co 5951  Basecbs 12876  +gcplusg 12953  .rcmulr 12954  0gc0g 13132  SubGrpcsubg 13547  Rngcrng 13738  LIdealclidl 14273
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-addcom 8032  ax-addass 8034  ax-i2m1 8037  ax-0lt1 8038  ax-0id 8040  ax-rnegex 8041  ax-pre-ltirr 8044  ax-pre-lttrn 8046  ax-pre-ltadd 8048
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-pnf 8116  df-mnf 8117  df-ltxr 8119  df-inn 9044  df-2 9102  df-3 9103  df-4 9104  df-5 9105  df-6 9106  df-7 9107  df-8 9108  df-ndx 12879  df-slot 12880  df-base 12882  df-sets 12883  df-iress 12884  df-plusg 12966  df-mulr 12967  df-sca 12969  df-vsca 12970  df-ip 12971  df-0g 13134  df-mgm 13232  df-sgrp 13278  df-mnd 13293  df-grp 13379  df-subg 13550  df-abl 13667  df-mgp 13727  df-rng 13739  df-lssm 14159  df-sra 14241  df-rgmod 14242  df-lidl 14275
This theorem is referenced by:  isridlrng  14288  dflidl2  14294  df2idl2rng  14314
  Copyright terms: Public domain W3C validator