| 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 5289 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐽 ∈ V) |
| 6 | eqid 2760 | . . . . . . 7 ⊢ (𝑅 freeLMod 𝐽) = (𝑅 freeLMod 𝐽) | |
| 7 | frlmsslss.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 8 | 6, 7 | frlm0 21967 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐽 ∈ V) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 9 | 2, 5, 8 | syl2anc 596 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 10 | 9 | eqeq2d 2771 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → ((𝑥 ↾ 𝐽) = (𝐽 × { 0 }) ↔ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽)))) |
| 11 | 10 | rabbidv 3419 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (𝐽 × { 0 })} = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 12 | 1, 11 | eqtrid 2807 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 13 | frlmsslss.y | . . . 4 ⊢ 𝑌 = (𝑅 freeLMod 𝐼) | |
| 14 | frlmsslss.b | . . . 4 ⊢ 𝐵 = (Base‘𝑌) | |
| 15 | eqid 2760 | . . . 4 ⊢ (Base‘(𝑅 freeLMod 𝐽)) = (Base‘(𝑅 freeLMod 𝐽)) | |
| 16 | eqid 2760 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) | |
| 17 | 13, 6, 14, 15, 16 | frlmsplit2 21986 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽))) |
| 18 | fvex 6891 | . . . . . 6 ⊢ (0g‘(𝑅 freeLMod 𝐽)) ∈ V | |
| 19 | 16 | mptiniseg 6235 | . . . . . 6 ⊢ ((0g‘(𝑅 freeLMod 𝐽)) ∈ V → (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} |
| 21 | 20 | eqcomi 2769 | . . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} = (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) |
| 22 | eqid 2760 | . . . 4 ⊢ (0g‘(𝑅 freeLMod 𝐽)) = (0g‘(𝑅 freeLMod 𝐽)) | |
| 23 | frlmsslss.u | . . . 4 ⊢ 𝑈 = (LSubSp‘𝑌) | |
| 24 | 21, 22, 23 | lmhmkerlss 21235 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽)) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 25 | 17, 24 | syl 18 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 26 | 12, 25 | eqeltrd 2860 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {crab 3412 Vcvv 3450 ⊆ wss 3899 {csn 4584 ↦ cmpt 5186 × cxp 5653 ◡ccnv 5654 ↾ cres 5657 “ cima 5658 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 0gc0g 17524 Ringcrg 20372 LSubSpclss 21115 LMHom clmhm 21203 freeLMod cfrlm 21959 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fsupp 9332 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-fz 13562 df-struct 17239 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-hom 17366 df-cco 17367 df-0g 17526 df-prds 17532 df-pws 17534 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-mhm 18891 df-submnd 18892 df-grp 19060 df-minusg 19061 df-sbg 19062 df-subg 19246 df-ghm 19341 df-cmn 19909 df-abl 19910 df-mgp 20274 df-rng 20288 df-ur 20321 df-ring 20374 df-subrg 20732 df-lmod 21046 df-lss 21116 df-lmhm 21206 df-sra 21357 df-rgmod 21358 df-dsmm 21945 df-frlm 21960 |
| This theorem is used by: frlmsslss2 21988 |
| Copyright terms: Public domain | W3C validator |