| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > qusvsval | Structured version Visualization version GIF version | ||
| Description: Value of the scalar multiplication operation on the quotient structure. (Contributed by Thierry Arnoux, 18-May-2023.) |
| Ref | Expression |
|---|---|
| eqgvscpbl.v | ⊢ 𝐵 = (Base‘𝑀) |
| eqgvscpbl.e | ⊢ ∼ = (𝑀 ~QG 𝐺) |
| eqgvscpbl.s | ⊢ 𝑆 = (Base‘(Scalar‘𝑀)) |
| eqgvscpbl.p | ⊢ · = ( ·𝑠 ‘𝑀) |
| eqgvscpbl.m | ⊢ (𝜑 → 𝑀 ∈ LMod) |
| eqgvscpbl.g | ⊢ (𝜑 → 𝐺 ∈ (LSubSp‘𝑀)) |
| eqgvscpbl.k | ⊢ (𝜑 → 𝐾 ∈ 𝑆) |
| qusvsval.n | ⊢ 𝑁 = (𝑀 /s (𝑀 ~QG 𝐺)) |
| qusvsval.m | ⊢ ∙ = ( ·𝑠 ‘𝑁) |
| qusvsval.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| qusvsval | ⊢ (𝜑 → (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqgvscpbl.k | . . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑆) | |
| 2 | qusvsval.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 3 | qusvsval.n | . . . . . 6 ⊢ 𝑁 = (𝑀 /s (𝑀 ~QG 𝐺)) | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑁 = (𝑀 /s (𝑀 ~QG 𝐺))) |
| 5 | eqgvscpbl.v | . . . . . 6 ⊢ 𝐵 = (Base‘𝑀) | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝑀)) |
| 7 | eqid 2760 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) = (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) | |
| 8 | ovex 7453 | . . . . . 6 ⊢ (𝑀 ~QG 𝐺) ∈ V | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑀 ~QG 𝐺) ∈ V) |
| 10 | eqgvscpbl.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
| 11 | 4, 6, 7, 9, 10 | qusval 17719 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) “s 𝑀)) |
| 12 | 4, 6, 7, 9, 10 | quslem 17720 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)):𝐵–onto→(𝐵 / (𝑀 ~QG 𝐺))) |
| 13 | eqid 2760 | . . . 4 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀) | |
| 14 | eqgvscpbl.s | . . . 4 ⊢ 𝑆 = (Base‘(Scalar‘𝑀)) | |
| 15 | eqgvscpbl.p | . . . 4 ⊢ · = ( ·𝑠 ‘𝑀) | |
| 16 | qusvsval.m | . . . 4 ⊢ ∙ = ( ·𝑠 ‘𝑁) | |
| 17 | eqgvscpbl.e | . . . . 5 ⊢ ∼ = (𝑀 ~QG 𝐺) | |
| 18 | 10 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → 𝑀 ∈ LMod) |
| 19 | eqgvscpbl.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ (LSubSp‘𝑀)) | |
| 20 | 19 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → 𝐺 ∈ (LSubSp‘𝑀)) |
| 21 | simpr1 1213 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → 𝑘 ∈ 𝑆) | |
| 22 | simpr2 1214 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → 𝑢 ∈ 𝐵) | |
| 23 | simpr3 1215 | . . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → 𝑣 ∈ 𝐵) | |
| 24 | 5, 17, 14, 15, 18, 20, 21, 3, 16, 7, 22, 23 | qusvscpbl 33958 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑢) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑣) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑢)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑣)))) |
| 25 | 11, 6, 12, 10, 13, 14, 15, 16, 24 | imasvscaval 17715 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 26 | 1, 2, 25 | mpd3an23 1492 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 27 | eceq1 8760 | . . . . 5 ⊢ (𝑥 = 𝑋 → [𝑥](𝑀 ~QG 𝐺) = [𝑋](𝑀 ~QG 𝐺)) | |
| 28 | ecexg 8724 | . . . . . 6 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [𝑋](𝑀 ~QG 𝐺) ∈ V) | |
| 29 | 8, 28 | ax-mp 5 | . . . . 5 ⊢ [𝑋](𝑀 ~QG 𝐺) ∈ V |
| 30 | 27, 7, 29 | fvmpt 6993 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 31 | 2, 30 | syl 18 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 32 | 31 | oveq2d 7436 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺))) |
| 33 | 5, 13, 15, 14 | lmodvscl 21158 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 · 𝑋) ∈ 𝐵) |
| 34 | 10, 1, 2, 33 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐾 · 𝑋) ∈ 𝐵) |
| 35 | eceq1 8760 | . . . 4 ⊢ (𝑥 = (𝐾 · 𝑋) → [𝑥](𝑀 ~QG 𝐺) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) | |
| 36 | ecexg 8724 | . . . . 5 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V) | |
| 37 | 8, 36 | ax-mp 5 | . . . 4 ⊢ [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V |
| 38 | 35, 7, 37 | fvmpt 6993 | . . 3 ⊢ ((𝐾 · 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 39 | 34, 38 | syl 18 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 40 | 26, 32, 39 | 3eqtr3d 2803 | 1 ⊢ (𝜑 → (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ↦ cmpt 5185 ‘cfv 6538 (class class class)co 7420 [cec 8718 / cqs 8719 Basecbs 17392 Scalarcsca 17436 ·𝑠 cvsca 17437 /s cqus 17682 ~QG cqg 19337 LModclmod 21140 LSubSpclss 21211 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-ec 8722 df-qs 8726 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-sup 9437 df-inf 9438 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-7 12413 df-8 12414 df-9 12415 df-n0 12610 df-z 12697 df-dec 12818 df-uz 12969 df-fz 13643 df-struct 17330 df-sets 17347 df-slot 17365 df-ndx 17377 df-base 17393 df-ress 17414 df-plusg 17446 df-mulr 17447 df-sca 17449 df-vsca 17450 df-ip 17451 df-tset 17452 df-ple 17453 df-ds 17455 df-0g 17617 df-imas 17685 df-qus 17686 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-grp 19152 df-minusg 19153 df-sbg 19154 df-subg 19338 df-eqg 19340 df-cmn 20001 df-abl 20002 df-mgp 20366 df-rng 20380 df-ur 20413 df-ring 20466 df-lmod 21142 df-lss 21212 |
| This theorem is used by: lmhmqusker 34014 |
| Copyright terms: Public domain | W3C validator |