![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > isridl | GIF version |
Description: A right ideal is a left ideal of the opposite 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, 13-Feb-2025.) |
Ref | Expression |
---|---|
isridl.u | ⊢ 𝑈 = (LIdeal‘(oppr‘𝑅)) |
isridl.b | ⊢ 𝐵 = (Base‘𝑅) |
isridl.t | ⊢ · = (.r‘𝑅) |
Ref | Expression |
---|---|
isridl | ⊢ (𝑅 ∈ Ring → (𝐼 ∈ 𝑈 ↔ (𝐼 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2193 | . . . 4 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
2 | 1 | opprring 13575 | . . 3 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
3 | isridl.u | . . . 4 ⊢ 𝑈 = (LIdeal‘(oppr‘𝑅)) | |
4 | eqid 2193 | . . . 4 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅)) | |
5 | eqid 2193 | . . . 4 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)) | |
6 | 3, 4, 5 | dflidl2 13984 | . . 3 ⊢ ((oppr‘𝑅) ∈ Ring → (𝐼 ∈ 𝑈 ↔ (𝐼 ∈ (SubGrp‘(oppr‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))) |
7 | 2, 6 | syl 14 | . 2 ⊢ (𝑅 ∈ Ring → (𝐼 ∈ 𝑈 ↔ (𝐼 ∈ (SubGrp‘(oppr‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼))) |
8 | 1 | opprsubgg 13580 | . . . . 5 ⊢ (𝑅 ∈ Ring → (SubGrp‘𝑅) = (SubGrp‘(oppr‘𝑅))) |
9 | 8 | eqcomd 2199 | . . . 4 ⊢ (𝑅 ∈ Ring → (SubGrp‘(oppr‘𝑅)) = (SubGrp‘𝑅)) |
10 | 9 | eleq2d 2263 | . . 3 ⊢ (𝑅 ∈ Ring → (𝐼 ∈ (SubGrp‘(oppr‘𝑅)) ↔ 𝐼 ∈ (SubGrp‘𝑅))) |
11 | isridl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
12 | 1, 11 | opprbasg 13571 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝐵 = (Base‘(oppr‘𝑅))) |
13 | 12 | eqcomd 2199 | . . . 4 ⊢ (𝑅 ∈ Ring → (Base‘(oppr‘𝑅)) = 𝐵) |
14 | 12 | eleq2d 2263 | . . . . . 6 ⊢ (𝑅 ∈ Ring → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘(oppr‘𝑅)))) |
15 | 14 | pm5.32i 454 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) ↔ (𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘(oppr‘𝑅)))) |
16 | vex 2763 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
17 | vex 2763 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
18 | isridl.t | . . . . . . . . . 10 ⊢ · = (.r‘𝑅) | |
19 | 11, 18, 1, 5 | opprmulg 13567 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥)) |
20 | 16, 17, 19 | mp3an23 1340 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦 · 𝑥)) |
21 | 20 | eleq1d 2262 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → ((𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ (𝑦 · 𝑥) ∈ 𝐼)) |
22 | 21 | ad2antrr 488 | . . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ (𝑦 · 𝑥) ∈ 𝐼)) |
23 | 22 | ralbidva 2490 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼)) |
24 | 15, 23 | sylbir 135 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ (Base‘(oppr‘𝑅))) → (∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼)) |
25 | 13, 24 | raleqbidva 2708 | . . 3 ⊢ (𝑅 ∈ Ring → (∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼)) |
26 | 10, 25 | anbi12d 473 | . 2 ⊢ (𝑅 ∈ Ring → ((𝐼 ∈ (SubGrp‘(oppr‘𝑅)) ∧ ∀𝑥 ∈ (Base‘(oppr‘𝑅))∀𝑦 ∈ 𝐼 (𝑥(.r‘(oppr‘𝑅))𝑦) ∈ 𝐼) ↔ (𝐼 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))) |
27 | 7, 26 | bitrd 188 | 1 ⊢ (𝑅 ∈ Ring → (𝐼 ∈ 𝑈 ↔ (𝐼 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐼 (𝑦 · 𝑥) ∈ 𝐼))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 ∀wral 2472 Vcvv 2760 ‘cfv 5254 (class class class)co 5918 Basecbs 12618 .rcmulr 12696 SubGrpcsubg 13237 Ringcrg 13492 opprcoppr 13563 LIdealclidl 13963 |
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 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-lttrn 7986 ax-pre-ltadd 7988 |
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 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-tpos 6298 df-pnf 8056 df-mnf 8057 df-ltxr 8059 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-5 9044 df-6 9045 df-7 9046 df-8 9047 df-ndx 12621 df-slot 12622 df-base 12624 df-sets 12625 df-iress 12626 df-plusg 12708 df-mulr 12709 df-sca 12711 df-vsca 12712 df-ip 12713 df-0g 12869 df-mgm 12939 df-sgrp 12985 df-mnd 12998 df-grp 13075 df-minusg 13076 df-sbg 13077 df-subg 13240 df-cmn 13356 df-abl 13357 df-mgp 13417 df-rng 13429 df-ur 13456 df-ring 13494 df-oppr 13564 df-subrg 13715 df-lmod 13785 df-lssm 13849 df-sra 13931 df-rgmod 13932 df-lidl 13965 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |