| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frlmsslss | Structured version Visualization version GIF version | ||
| Description: A subset of a free module obtained by restricting the support set is a submodule. 𝐽 is the set of forbidden unit vectors. (Contributed by Stefan O'Rear, 4-Feb-2015.) |
| Ref | Expression |
|---|---|
| frlmsslss.y | ⊢ 𝑌 = (𝑅 freeLMod 𝐼) |
| frlmsslss.u | ⊢ 𝑈 = (LSubSp‘𝑌) |
| frlmsslss.b | ⊢ 𝐵 = (Base‘𝑌) |
| frlmsslss.z | ⊢ 0 = (0g‘𝑅) |
| frlmsslss.c | ⊢ 𝐶 = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (𝐽 × { 0 })} |
| Ref | Expression |
|---|---|
| frlmsslss | ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frlmsslss.c | . . 3 ⊢ 𝐶 = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (𝐽 × { 0 })} | |
| 2 | simp1 1154 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝑅 ∈ Ring) | |
| 3 | simp2 1155 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐼 ∈ 𝑉) | |
| 4 | simp3 1156 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐽 ⊆ 𝐼) | |
| 5 | 3, 4 | ssexd 5297 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐽 ∈ V) |
| 6 | eqid 2765 | . . . . . . 7 ⊢ (𝑅 freeLMod 𝐽) = (𝑅 freeLMod 𝐽) | |
| 7 | frlmsslss.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 8 | 6, 7 | frlm0 21954 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐽 ∈ V) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 9 | 2, 5, 8 | syl2anc 596 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 10 | 9 | eqeq2d 2776 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → ((𝑥 ↾ 𝐽) = (𝐽 × { 0 }) ↔ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽)))) |
| 11 | 10 | rabbidv 3425 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (𝐽 × { 0 })} = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 12 | 1, 11 | eqtrid 2812 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 13 | frlmsslss.y | . . . 4 ⊢ 𝑌 = (𝑅 freeLMod 𝐼) | |
| 14 | frlmsslss.b | . . . 4 ⊢ 𝐵 = (Base‘𝑌) | |
| 15 | eqid 2765 | . . . 4 ⊢ (Base‘(𝑅 freeLMod 𝐽)) = (Base‘(𝑅 freeLMod 𝐽)) | |
| 16 | eqid 2765 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) | |
| 17 | 13, 6, 14, 15, 16 | frlmsplit2 21973 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽))) |
| 18 | fvex 6898 | . . . . . 6 ⊢ (0g‘(𝑅 freeLMod 𝐽)) ∈ V | |
| 19 | 16 | mptiniseg 6242 | . . . . . 6 ⊢ ((0g‘(𝑅 freeLMod 𝐽)) ∈ V → (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} |
| 21 | 20 | eqcomi 2774 | . . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} = (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) |
| 22 | eqid 2765 | . . . 4 ⊢ (0g‘(𝑅 freeLMod 𝐽)) = (0g‘(𝑅 freeLMod 𝐽)) | |
| 23 | frlmsslss.u | . . . 4 ⊢ 𝑈 = (LSubSp‘𝑌) | |
| 24 | 21, 22, 23 | lmhmkerlss 21222 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽)) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 25 | 17, 24 | syl 18 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 26 | 12, 25 | eqeltrd 2865 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 {crab 3418 Vcvv 3457 ⊆ wss 3906 {csn 4591 ↦ cmpt 5194 × cxp 5661 ◡ccnv 5662 ↾ cres 5665 “ cima 5666 ‘cfv 6540 (class class class)co 7419 Basecbs 17291 0gc0g 17514 Ringcrg 20359 LSubSpclss 21102 LMHom clmhm 21190 freeLMod cfrlm 21946 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-om 7869 df-1st 7992 df-2nd 7993 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fsupp 9329 df-sup 9409 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-9 12325 df-n0 12520 df-z 12607 df-dec 12728 df-uz 12879 df-fz 13552 df-struct 17229 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-mulr 17346 df-sca 17348 df-vsca 17349 df-ip 17350 df-tset 17351 df-ple 17352 df-ds 17354 df-hom 17356 df-cco 17357 df-0g 17516 df-prds 17522 df-pws 17524 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-mhm 18878 df-submnd 18879 df-grp 19047 df-minusg 19048 df-sbg 19049 df-subg 19233 df-ghm 19328 df-cmn 19896 df-abl 19897 df-mgp 20261 df-rng 20275 df-ur 20308 df-ring 20361 df-subrg 20719 df-lmod 21033 df-lss 21103 df-lmhm 21193 df-sra 21344 df-rgmod 21345 df-dsmm 21932 df-frlm 21947 |
| This theorem is used by: frlmsslss2 21975 |
| Copyright terms: Public domain | W3C validator |