Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > islidl | Structured version Visualization version GIF version |
Description: Predicate of being a (left) ideal. (Contributed by Stefan O'Rear, 1-Apr-2015.) |
Ref | Expression |
---|---|
islidl.s | ⊢ 𝑈 = (LIdeal‘𝑅) |
islidl.b | ⊢ 𝐵 = (Base‘𝑅) |
islidl.p | ⊢ + = (+g‘𝑅) |
islidl.t | ⊢ · = (.r‘𝑅) |
Ref | Expression |
---|---|
islidl | ⊢ (𝐼 ∈ 𝑈 ↔ (𝐼 ⊆ 𝐵 ∧ 𝐼 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝐼 ∀𝑏 ∈ 𝐼 ((𝑥 · 𝑎) + 𝑏) ∈ 𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rlmsca2 19966 | . 2 ⊢ ( I ‘𝑅) = (Scalar‘(ringLMod‘𝑅)) | |
2 | baseid 16535 | . . 3 ⊢ Base = Slot (Base‘ndx) | |
3 | islidl.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
4 | 2, 3 | strfvi 16529 | . 2 ⊢ 𝐵 = (Base‘( I ‘𝑅)) |
5 | rlmbas 19960 | . . 3 ⊢ (Base‘𝑅) = (Base‘(ringLMod‘𝑅)) | |
6 | 3, 5 | eqtri 2821 | . 2 ⊢ 𝐵 = (Base‘(ringLMod‘𝑅)) |
7 | islidl.p | . . 3 ⊢ + = (+g‘𝑅) | |
8 | rlmplusg 19961 | . . 3 ⊢ (+g‘𝑅) = (+g‘(ringLMod‘𝑅)) | |
9 | 7, 8 | eqtri 2821 | . 2 ⊢ + = (+g‘(ringLMod‘𝑅)) |
10 | islidl.t | . . 3 ⊢ · = (.r‘𝑅) | |
11 | rlmvsca 19967 | . . 3 ⊢ (.r‘𝑅) = ( ·𝑠 ‘(ringLMod‘𝑅)) | |
12 | 10, 11 | eqtri 2821 | . 2 ⊢ · = ( ·𝑠 ‘(ringLMod‘𝑅)) |
13 | islidl.s | . . 3 ⊢ 𝑈 = (LIdeal‘𝑅) | |
14 | lidlval 19957 | . . 3 ⊢ (LIdeal‘𝑅) = (LSubSp‘(ringLMod‘𝑅)) | |
15 | 13, 14 | eqtri 2821 | . 2 ⊢ 𝑈 = (LSubSp‘(ringLMod‘𝑅)) |
16 | 1, 4, 6, 9, 12, 15 | islss 19699 | 1 ⊢ (𝐼 ∈ 𝑈 ↔ (𝐼 ⊆ 𝐵 ∧ 𝐼 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ 𝐼 ∀𝑏 ∈ 𝐼 ((𝑥 · 𝑎) + 𝑏) ∈ 𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ⊆ wss 3881 ∅c0 4243 I cid 5424 ‘cfv 6324 (class class class)co 7135 ndxcnx 16472 Basecbs 16475 +gcplusg 16557 .rcmulr 16558 ·𝑠 cvsca 16561 LSubSpclss 19696 ringLModcrglmod 19934 LIdealclidl 19935 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-sca 16573 df-vsca 16574 df-ip 16575 df-lss 19697 df-sra 19937 df-rgmod 19938 df-lidl 19939 |
This theorem is referenced by: intlidl 31010 rhmpreimaidl 31011 idlinsubrg 31016 rhmimaidl 31017 ssmxidllem 31049 hbtlem2 40068 2zlidl 44558 |
Copyright terms: Public domain | W3C validator |