| 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 1136 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ LMod) | |
| 2 | simp2 1137 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ 𝑉) | |
| 3 | simp3 1138 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 4 | 2, 3 | unssd 4157 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ 𝑉) |
| 5 | ssun1 4143 | . . . . . . 7 ⊢ 𝑇 ⊆ (𝑇 ∪ 𝑈) | |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑇 ∪ 𝑈)) |
| 7 | lspss.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lspss.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 7, 8 | lspss 20896 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑇 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 10 | 1, 4, 6, 9 | syl3anc 1373 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | ssun2 4144 | . . . . . . 7 ⊢ 𝑈 ⊆ (𝑇 ∪ 𝑈) | |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑇 ∪ 𝑈)) |
| 13 | 7, 8 | lspss 20896 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑈 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 1, 4, 12, 13 | syl3anc 1373 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 15 | 10, 14 | unssd 4157 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 16 | 7, 8 | lspssv 20895 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 17 | 1, 4, 16 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 18 | 15, 17 | sstrd 3959 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉) |
| 19 | 7, 8 | lspssid 20897 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 20 | 1, 2, 19 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 21 | 7, 8 | lspssid 20897 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑁‘𝑈)) |
| 22 | unss12 4153 | . . . 4 ⊢ ((𝑇 ⊆ (𝑁‘𝑇) ∧ 𝑈 ⊆ (𝑁‘𝑈)) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) | |
| 23 | 20, 21, 22 | 3imp3i2an 1346 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) |
| 24 | 7, 8 | lspss 20896 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉 ∧ (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 25 | 1, 18, 23, 24 | syl3anc 1373 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 26 | 7, 8 | lspss 20896 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉 ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 27 | 1, 17, 15, 26 | syl3anc 1373 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 28 | 7, 8 | lspidm 20898 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 29 | 1, 4, 28 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 30 | 27, 29 | sseqtrd 3985 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 31 | 25, 30 | eqssd 3966 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∪ cun 3914 ⊆ wss 3916 ‘cfv 6513 Basecbs 17185 LModclmod 20772 LSpanclspn 20883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-er 8673 df-en 8921 df-dom 8922 df-sdom 8923 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-nn 12188 df-2 12250 df-sets 17140 df-slot 17158 df-ndx 17170 df-base 17186 df-plusg 17239 df-0g 17410 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-grp 18874 df-minusg 18875 df-sbg 18876 df-mgp 20056 df-ur 20097 df-ring 20150 df-lmod 20774 df-lss 20844 df-lsp 20884 |
| This theorem is referenced by: lspun0 20923 lsmsp2 21000 lsmpr 21002 lsppr 21006 islshpsm 38968 lshpnel2N 38973 lkrlsp3 39092 dochsatshp 41440 |
| Copyright terms: Public domain | W3C validator |