Theorem isridlrng 14929

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 2238	. . . 4 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
2	1	opprrng 14492	. . 3 ⊢ (𝑅 ∈ Rng → (oppr‘𝑅) ∈ Rng)
3	1	opprsubgg 14500	. . . . 5 ⊢ (𝑅 ∈ Rng → (SubGrp‘𝑅) = (SubGrp‘(oppr‘𝑅)))
4	3	eleq2d 2308	. . . 4 ⊢ (𝑅 ∈ Rng → (𝐼 ∈ (SubGrp‘𝑅) ↔ 𝐼 ∈ (SubGrp‘(oppr‘𝑅))))
5	4	biimpa 296	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ (SubGrp‘(oppr‘𝑅)))
6		isridlrng.u	. . . 4 ⊢ 𝑈 = (LIdeal‘(oppr‘𝑅))
7		eqid 2238	. . . 4 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅))
8		eqid 2238	. . . 4 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
9	6, 7, 8	dflidl2rng 14928	. . 3 ⊢ (((oppr‘𝑅) ∈ Rng ∧ 𝐼 ∈ (SubGrp‘(oppr‘𝑅))) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
10	2, 5, 9	syl2an2r 603	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
11		isridlrng.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
12	1, 11	opprbasg 14490	. . . 4 ⊢ (𝑅 ∈ Rng → 𝐵 = (Base‘(oppr‘𝑅)))
13	12	adantr 276	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → 𝐵 = (Base‘(oppr‘𝑅)))
14	13	raleqdv 2755	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))
15		isridlrng.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
16	11, 15, 1, 8	opprmulg 14486	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐼) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥))
17	16	ad4ant134 1248	. . . . 5 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥))
18	17	eleq1d 2307	. . . 4 ⊢ ((((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ (𝑦 · 𝑥) ∈ 𝐼))
19	18	ralbidva 2546	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))
20	19	ralbidva 2546	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))
21	10, 14, 20	3bitr2d 216	1 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (SubGrp‘𝑅)) → (𝐼 ∈ 𝑈 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5380  (class class class)co 6088  Basecbs 13411  ._rcmulr 13492  SubGrpcsubg 14030  Rngcrng 14339  opp_rcoppr 14482  LIdealclidl 14914

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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-pre-ltirr 8298  ax-pre-lttrn 8300  ax-pre-ltadd 8302

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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-tpos 6520  df-pnf 8369  df-mnf 8370  df-ltxr 8372  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-5 9376  df-6 9377  df-7 9378  df-8 9379  df-ndx 13414  df-slot 13415  df-base 13417  df-sets 13418  df-iress 13419  df-plusg 13504  df-mulr 13505  df-sca 13507  df-vsca 13508  df-ip 13509  df-0g 13672  df-mgm 13736  df-sgrp 13777  df-mnd 13790  df-grp 13868  df-subg 14033  df-cmn 14180  df-abl 14181  df-mgp 14326  df-rng 14340  df-oppr 14483  df-lssm 14800  df-sra 14882  df-rgmod 14883  df-lidl 14916

This theorem is used by:  df2idl2rng  14955