Theorem isridlrng 14454

Description: A right ideal is a left ideal of the opposite non-unital ring. This theorem shows that this definition corresponds to the usual textbook definition of a right ideal of a ring to be a subgroup of the additive group of the ring which is closed under right-multiplication by elements of the full ring. (Contributed by AV, 21-Mar-2025.)

Hypotheses

Ref	Expression
isridlrng.u	⊢ 𝑈 = (LIdeal‘(oppr‘𝑅))
isridlrng.b	⊢ 𝐵 = (Base‘𝑅)
isridlrng.t	⊢ · = (.r‘𝑅)

Assertion

Ref	Expression
isridlrng	⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐼,𝑦   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦

Allowed substitution hints:   · (𝑥,𝑦)

Proof of Theorem isridlrng

Step	Hyp	Ref	Expression
1		eqid 2229	. . . 4 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
2	1	opprrng 14048	. . 3 ⊢ (𝑅 ∈ Rng → (oppr‘𝑅) ∈ Rng)
3	1	opprsubgg 14055	. . . . 5 ⊢ (𝑅 ∈ Rng → (SubGrp‘𝑅) = (SubGrp‘(oppr‘𝑅)))
4	3	eleq2d 2299	. . . 4 ⊢ (𝑅 ∈ Rng → (𝐼 ∈ (SubGrp‘𝑅) ↔ 𝐼 ∈ (SubGrp‘(oppr‘𝑅))))
5	4	biimpa 296	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ (SubGrp‘(oppr‘𝑅)))
6		isridlrng.u	. . . 4 ⊢ 𝑈 = (LIdeal‘(oppr‘𝑅))
7		eqid 2229	. . . 4 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅))
8		eqid 2229	. . . 4 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
9	6, 7, 8	dflidl2rng 14453	. . 3 ⊢ (((oppr‘𝑅) ∈ Rng ∧ 𝐼 ∈ (SubGrp‘(oppr‘𝑅))) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
10	2, 5, 9	syl2an2r 597	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
11		isridlrng.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
12	1, 11	opprbasg 14046	. . . 4 ⊢ (𝑅 ∈ Rng → 𝐵 = (Base‘(oppr‘𝑅)))
13	12	adantr 276	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → 𝐵 = (Base‘(oppr‘𝑅)))
14	13	raleqdv 2734	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
15		isridlrng.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
16	11, 15, 1, 8	opprmulg 14042	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥))
17	16	ad4ant134 1241	. . . . 5 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥))
18	17	eleq1d 2298	. . . 4 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ (𝑦 · 𝑥) ∈ 𝐼))
19	18	ralbidva 2526	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))
20	19	ralbidva 2526	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))
21	10, 14, 20	3bitr2d 216	1 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200  ∀wral 2508  ‘cfv 5318  (class class class)co 6007  Basecbs 13040  ._rcmulr 13119  SubGrpcsubg 13712  Rngcrng 13903  opp_rcoppr 14038  LIdealclidl 14439

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8098  ax-resscn 8099  ax-1cn 8100  ax-1re 8101  ax-icn 8102  ax-addcl 8103  ax-addrcl 8104  ax-mulcl 8105  ax-addcom 8107  ax-addass 8109  ax-i2m1 8112  ax-0lt1 8113  ax-0id 8115  ax-rnegex 8116  ax-pre-ltirr 8119  ax-pre-lttrn 8121  ax-pre-ltadd 8123

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-tpos 6397  df-pnf 8191  df-mnf 8192  df-ltxr 8194  df-inn 9119  df-2 9177  df-3 9178  df-4 9179  df-5 9180  df-6 9181  df-7 9182  df-8 9183  df-ndx 13043  df-slot 13044  df-base 13046  df-sets 13047  df-iress 13048  df-plusg 13131  df-mulr 13132  df-sca 13134  df-vsca 13135  df-ip 13136  df-0g 13299  df-mgm 13397  df-sgrp 13443  df-mnd 13458  df-grp 13544  df-subg 13715  df-cmn 13831  df-abl 13832  df-mgp 13892  df-rng 13904  df-oppr 14039  df-lssm 14325  df-sra 14407  df-rgmod 14408  df-lidl 14441

This theorem is referenced by:  df2idl2rng  14480