| 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 5293 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐽 ∈ V) |
| 6 | eqid 2763 | . . . . . . 7 ⊢ (𝑅 freeLMod 𝐽) = (𝑅 freeLMod 𝐽) | |
| 7 | frlmsslss.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 8 | 6, 7 | frlm0 22115 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐽 ∈ V) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 9 | 2, 5, 8 | syl2anc 596 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝐽 × { 0 }) = (0g‘(𝑅 freeLMod 𝐽))) |
| 10 | 9 | eqeq2d 2774 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → ((𝑥 ↾ 𝐽) = (𝐽 × { 0 }) ↔ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽)))) |
| 11 | 10 | rabbidv 3423 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (𝐽 × { 0 })} = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 12 | 1, 11 | eqtrid 2810 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 13 | frlmsslss.y | . . . 4 ⊢ 𝑌 = (𝑅 freeLMod 𝐼) | |
| 14 | frlmsslss.b | . . . 4 ⊢ 𝐵 = (Base‘𝑌) | |
| 15 | eqid 2763 | . . . 4 ⊢ (Base‘(𝑅 freeLMod 𝐽)) = (Base‘(𝑅 freeLMod 𝐽)) | |
| 16 | eqid 2763 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) | |
| 17 | 13, 6, 14, 15, 16 | frlmsplit2 22134 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽))) |
| 18 | fvex 6929 | . . . . . 6 ⊢ (0g‘(𝑅 freeLMod 𝐽)) ∈ V | |
| 19 | 16 | mptiniseg 6259 | . . . . . 6 ⊢ ((0g‘(𝑅 freeLMod 𝐽)) ∈ V → (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))}) |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) = {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} |
| 21 | 20 | eqcomi 2772 | . . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} = (◡(𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) “ {(0g‘(𝑅 freeLMod 𝐽))}) |
| 22 | eqid 2763 | . . . 4 ⊢ (0g‘(𝑅 freeLMod 𝐽)) = (0g‘(𝑅 freeLMod 𝐽)) | |
| 23 | frlmsslss.u | . . . 4 ⊢ 𝑈 = (LSubSp‘𝑌) | |
| 24 | 21, 22, 23 | lmhmkerlss 21377 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝐽)) ∈ (𝑌 LMHom (𝑅 freeLMod 𝐽)) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 25 | 17, 24 | syl 18 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → {𝑥 ∈ 𝐵 ∣ (𝑥 ↾ 𝐽) = (0g‘(𝑅 freeLMod 𝐽))} ∈ 𝑈) |
| 26 | 12, 25 | eqeltrd 2864 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼) → 𝐶 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 ⊆ wss 3900 {csn 4588 ↦ cmpt 5192 × cxp 5656 ◡ccnv 5657 ↾ cres 5660 “ cima 5661 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 0gc0g 17660 Ringcrg 20510 LSubSpclss 21257 LMHom clmhm 21345 freeLMod cfrlm 22107 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-supp 8215 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-ixp 8964 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fsupp 9392 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ds 17495 df-hom 17497 df-cco 17498 df-0g 17662 df-prds 17668 df-pws 17670 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-mhm 19028 df-submnd 19029 df-grp 19197 df-minusg 19198 df-sbg 19199 df-subg 19383 df-ghm 19478 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-subrg 20873 df-lmod 21188 df-lss 21258 df-lmhm 21348 df-sra 21499 df-rgmod 21500 df-dsmm 22093 df-frlm 22108 |
| This theorem is used by: frlmsslss2 22136 |
| Copyright terms: Public domain | W3C validator |