| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lspun | 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 1028 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑊 ∈ LMod) | |
| 2 | simp2 1029 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ 𝑉) | |
| 3 | simp3 1030 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ 𝑉) | |
| 4 | 2, 3 | unssd 3405 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ 𝑉) |
| 5 | ssun1 3392 | . . . . . . 7 ⊢ 𝑇 ⊆ (𝑇 ∪ 𝑈) | |
| 6 | 5 | a1i 9 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑇 ∪ 𝑈)) |
| 7 | lspss.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 8 | lspss.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 9 | 7, 8 | lspss 14738 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑇 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 10 | 1, 4, 6, 9 | syl3anc 1278 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 11 | ssun2 3393 | . . . . . . 7 ⊢ 𝑈 ⊆ (𝑇 ∪ 𝑈) | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑇 ∪ 𝑈)) |
| 13 | 7, 8 | lspss 14738 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉 ∧ 𝑈 ⊆ (𝑇 ∪ 𝑈)) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 14 | 1, 4, 12, 13 | syl3anc 1278 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘𝑈) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 15 | 10, 14 | unssd 3405 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 16 | 7, 8 | lspssv 14737 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 17 | 1, 4, 16 | syl2anc 415 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉) |
| 18 | 15, 17 | sstrd 3258 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉) |
| 19 | 7, 8 | lspssid 14739 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 20 | 1, 2, 19 | syl2anc 415 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → 𝑇 ⊆ (𝑁‘𝑇)) |
| 21 | 7, 8 | lspssid 14739 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉) → 𝑈 ⊆ (𝑁‘𝑈)) |
| 22 | unss12 3401 | . . . 4 ⊢ ((𝑇 ⊆ (𝑁‘𝑇) ∧ 𝑈 ⊆ (𝑁‘𝑈)) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) | |
| 23 | 20, 21, 22 | 3imp3i2an 1214 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) |
| 24 | 7, 8 | lspss 14738 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ 𝑉 ∧ (𝑇 ∪ 𝑈) ⊆ ((𝑁‘𝑇) ∪ (𝑁‘𝑈))) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 25 | 1, 18, 23, 24 | syl3anc 1278 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) ⊆ (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| 26 | 7, 8 | lspss 14738 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑁‘(𝑇 ∪ 𝑈)) ⊆ 𝑉 ∧ ((𝑁‘𝑇) ∪ (𝑁‘𝑈)) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 27 | 1, 17, 15, 26 | syl3anc 1278 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑁‘(𝑇 ∪ 𝑈)))) |
| 28 | 7, 8 | lspidm 14740 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝑇 ∪ 𝑈) ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 29 | 1, 4, 28 | syl2anc 415 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑁‘(𝑇 ∪ 𝑈))) = (𝑁‘(𝑇 ∪ 𝑈))) |
| 30 | 27, 29 | sseqtrd 3286 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈))) ⊆ (𝑁‘(𝑇 ∪ 𝑈))) |
| 31 | 25, 30 | eqssd 3265 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑇 ⊆ 𝑉 ∧ 𝑈 ⊆ 𝑉) → (𝑁‘(𝑇 ∪ 𝑈)) = (𝑁‘((𝑁‘𝑇) ∪ (𝑁‘𝑈)))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 ⊆ wss 3220 ‘cfv 5377 Basecbs 13354 LModclmod 14625 LSpanclspn 14725 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-pre-ltirr 8291 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-5 9367 df-6 9368 df-ndx 13357 df-slot 13358 df-base 13360 df-sets 13361 df-plusg 13446 df-mulr 13447 df-sca 13449 df-vsca 13450 df-0g 13614 df-mgm 13678 df-sgrp 13719 df-mnd 13732 df-grp 13810 df-minusg 13811 df-sbg 13812 df-mgp 14220 df-ur 14265 df-ring 14304 df-lmod 14627 df-lssm 14692 df-lsp 14726 |
| This theorem is used by: lspun0 14764 |
| Copyright terms: Public domain | W3C validator |