Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lincext2 | Structured version Visualization version GIF version |
Description: Property 2 of an extension of a linear combination. (Contributed by AV, 20-Apr-2019.) (Revised by AV, 30-Jul-2019.) |
Ref | Expression |
---|---|
lincext.b | ⊢ 𝐵 = (Base‘𝑀) |
lincext.r | ⊢ 𝑅 = (Scalar‘𝑀) |
lincext.e | ⊢ 𝐸 = (Base‘𝑅) |
lincext.0 | ⊢ 0 = (0g‘𝑅) |
lincext.z | ⊢ 𝑍 = (0g‘𝑀) |
lincext.n | ⊢ 𝑁 = (invg‘𝑅) |
lincext.f | ⊢ 𝐹 = (𝑧 ∈ 𝑆 ↦ if(𝑧 = 𝑋, (𝑁‘𝑌), (𝐺‘𝑧))) |
Ref | Expression |
---|---|
lincext2 | ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 𝐹 finSupp 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvex 6685 | . . . . . 6 ⊢ (𝑁‘𝑌) ∈ V | |
2 | fvex 6685 | . . . . . 6 ⊢ (𝐺‘𝑧) ∈ V | |
3 | 1, 2 | ifex 4517 | . . . . 5 ⊢ if(𝑧 = 𝑋, (𝑁‘𝑌), (𝐺‘𝑧)) ∈ V |
4 | lincext.f | . . . . 5 ⊢ 𝐹 = (𝑧 ∈ 𝑆 ↦ if(𝑧 = 𝑋, (𝑁‘𝑌), (𝐺‘𝑧))) | |
5 | 3, 4 | dmmpti 6494 | . . . 4 ⊢ dom 𝐹 = 𝑆 |
6 | 5 | difeq1i 4097 | . . 3 ⊢ (dom 𝐹 ∖ (𝑆 ∖ {𝑋})) = (𝑆 ∖ (𝑆 ∖ {𝑋})) |
7 | snssi 4743 | . . . . . . 7 ⊢ (𝑋 ∈ 𝑆 → {𝑋} ⊆ 𝑆) | |
8 | 7 | 3ad2ant2 1130 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) → {𝑋} ⊆ 𝑆) |
9 | 8 | 3ad2ant2 1130 | . . . . 5 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → {𝑋} ⊆ 𝑆) |
10 | dfss4 4237 | . . . . 5 ⊢ ({𝑋} ⊆ 𝑆 ↔ (𝑆 ∖ (𝑆 ∖ {𝑋})) = {𝑋}) | |
11 | 9, 10 | sylib 220 | . . . 4 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → (𝑆 ∖ (𝑆 ∖ {𝑋})) = {𝑋}) |
12 | snfi 8596 | . . . 4 ⊢ {𝑋} ∈ Fin | |
13 | 11, 12 | eqeltrdi 2923 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → (𝑆 ∖ (𝑆 ∖ {𝑋})) ∈ Fin) |
14 | 6, 13 | eqeltrid 2919 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → (dom 𝐹 ∖ (𝑆 ∖ {𝑋})) ∈ Fin) |
15 | lincext.b | . . . 4 ⊢ 𝐵 = (Base‘𝑀) | |
16 | lincext.r | . . . 4 ⊢ 𝑅 = (Scalar‘𝑀) | |
17 | lincext.e | . . . 4 ⊢ 𝐸 = (Base‘𝑅) | |
18 | lincext.0 | . . . 4 ⊢ 0 = (0g‘𝑅) | |
19 | lincext.z | . . . 4 ⊢ 𝑍 = (0g‘𝑀) | |
20 | lincext.n | . . . 4 ⊢ 𝑁 = (invg‘𝑅) | |
21 | 15, 16, 17, 18, 19, 20, 4 | lincext1 44516 | . . 3 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})))) → 𝐹 ∈ (𝐸 ↑m 𝑆)) |
22 | 21 | 3adant3 1128 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 𝐹 ∈ (𝐸 ↑m 𝑆)) |
23 | elmapfun 8432 | . . 3 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → Fun 𝐹) | |
24 | 22, 23 | syl 17 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → Fun 𝐹) |
25 | elmapi 8430 | . . . . 5 ⊢ (𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) → 𝐺:(𝑆 ∖ {𝑋})⟶𝐸) | |
26 | 4 | fdmdifeqresdif 44397 | . . . . 5 ⊢ (𝐺:(𝑆 ∖ {𝑋})⟶𝐸 → 𝐺 = (𝐹 ↾ (𝑆 ∖ {𝑋}))) |
27 | 25, 26 | syl 17 | . . . 4 ⊢ (𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋})) → 𝐺 = (𝐹 ↾ (𝑆 ∖ {𝑋}))) |
28 | 27 | 3ad2ant3 1131 | . . 3 ⊢ ((𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) → 𝐺 = (𝐹 ↾ (𝑆 ∖ {𝑋}))) |
29 | 28 | 3ad2ant2 1130 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 𝐺 = (𝐹 ↾ (𝑆 ∖ {𝑋}))) |
30 | simp3 1134 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 𝐺 finSupp 0 ) | |
31 | 18 | fvexi 6686 | . . 3 ⊢ 0 ∈ V |
32 | 31 | a1i 11 | . 2 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 0 ∈ V) |
33 | 14, 22, 24, 29, 30, 32 | resfsupp 8862 | 1 ⊢ (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (𝑌 ∈ 𝐸 ∧ 𝑋 ∈ 𝑆 ∧ 𝐺 ∈ (𝐸 ↑m (𝑆 ∖ {𝑋}))) ∧ 𝐺 finSupp 0 ) → 𝐹 finSupp 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ∖ cdif 3935 ⊆ wss 3938 ifcif 4469 𝒫 cpw 4541 {csn 4569 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ↾ cres 5559 Fun wfun 6351 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ↑m cmap 8408 Fincfn 8511 finSupp cfsupp 8835 Basecbs 16485 Scalarcsca 16570 0gc0g 16715 invgcminusg 18106 LModclmod 19636 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-fin 8515 df-fsupp 8836 df-0g 16717 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-grp 18108 df-minusg 18109 df-ring 19301 df-lmod 19638 |
This theorem is referenced by: lincext3 44518 lindslinindsimp1 44519 islindeps2 44545 |
Copyright terms: Public domain | W3C validator |