| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspun | Structured version Visualization version GIF version | ||
| Description: The span of union is the span of the union of spans. (Contributed by NM, 22-Feb-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lspss.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspss.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| Ref | Expression |
|---|---|
| lspun | ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1137 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ LMod) | |
| 2 | simp2 1138 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ 𝑉) | |
| 3 | simp3 1139 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 4 | 2, 3 | unssd 4133 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ 𝑉) |
| 5 | ssun1 4119 | . . . . . . 7 ⊢ 𝑇 ⊆ (𝑇 ∪ 𝑈) | |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑇 ∪ 𝑈)) |
| 7 | lspss.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lspss.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 7, 8 | lspss 20970 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑇 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 10 | 1, 4, 6, 9 | syl3anc 1374 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | ssun2 4120 | . . . . . . 7 ⊢ 𝑈 ⊆ (𝑇 ∪ 𝑈) | |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑇 ∪ 𝑈)) |
| 13 | 7, 8 | lspss 20970 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑈 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 1, 4, 12, 13 | syl3anc 1374 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 15 | 10, 14 | unssd 4133 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 16 | 7, 8 | lspssv 20969 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 17 | 1, 4, 16 | syl2anc 585 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 18 | 15, 17 | sstrd 3933 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉) |
| 19 | 7, 8 | lspssid 20971 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 20 | 1, 2, 19 | syl2anc 585 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 21 | 7, 8 | lspssid 20971 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑁‘𝑈)) |
| 22 | unss12 4129 | . . . 4 ⊢ ((𝑇 ⊆ (𝑁‘𝑇) ∧ 𝑈 ⊆ (𝑁‘𝑈)) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) | |
| 23 | 20, 21, 22 | 3imp3i2an 1347 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) |
| 24 | 7, 8 | lspss 20970 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉 ∧ (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 25 | 1, 18, 23, 24 | syl3anc 1374 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 26 | 7, 8 | lspss 20970 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉 ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 27 | 1, 17, 15, 26 | syl3anc 1374 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 28 | 7, 8 | lspidm 20972 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 29 | 1, 4, 28 | syl2anc 585 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 30 | 27, 29 | sseqtrd 3959 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 31 | 25, 30 | eqssd 3940 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∪ cun 3888 ⊆ wss 3890 ‘cfv 6492 Basecbs 17170 LModclmod 20846 LSpanclspn 20957 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-mgp 20113 df-ur 20154 df-ring 20207 df-lmod 20848 df-lss 20918 df-lsp 20958 |
| This theorem is referenced by: lspun0 20997 lsmsp2 21074 lsmpr 21076 lsppr 21080 islshpsm 39440 lshpnel2N 39445 lkrlsp3 39564 dochsatshp 41911 |
| Copyright terms: Public domain | W3C validator |