| 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 2761 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) = (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) | |
| 8 | ovex 7445 | . . . . . 6 ⊢ (𝑀 ~QG 𝐺) ∈ V | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑀 ~QG 𝐺) ∈ V) |
| 10 | eqgvscpbl.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
| 11 | 4, 6, 7, 9, 10 | qusval 17694 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) “s 𝑀)) |
| 12 | 4, 6, 7, 9, 10 | quslem 17695 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)):𝐵–onto→(𝐵 / (𝑀 ~QG 𝐺))) |
| 13 | eqid 2761 | . . . 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 33894 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑢) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑣) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑢)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑣)))) |
| 25 | 11, 6, 12, 10, 13, 14, 15, 16, 24 | imasvscaval 17690 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 26 | 1, 2, 25 | mpd3an23 1492 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 27 | eceq1 8741 | . . . . 5 ⊢ (𝑥 = 𝑋 → [𝑥](𝑀 ~QG 𝐺) = [𝑋](𝑀 ~QG 𝐺)) | |
| 28 | ecexg 8705 | . . . . . 6 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [𝑋](𝑀 ~QG 𝐺) ∈ V) | |
| 29 | 8, 28 | ax-mp 5 | . . . . 5 ⊢ [𝑋](𝑀 ~QG 𝐺) ∈ V |
| 30 | 27, 7, 29 | fvmpt 6985 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 31 | 2, 30 | syl 18 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 32 | 31 | oveq2d 7428 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺))) |
| 33 | 5, 13, 15, 14 | lmodvscl 21133 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 · 𝑋) ∈ 𝐵) |
| 34 | 10, 1, 2, 33 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐾 · 𝑋) ∈ 𝐵) |
| 35 | eceq1 8741 | . . . 4 ⊢ (𝑥 = (𝐾 · 𝑋) → [𝑥](𝑀 ~QG 𝐺) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) | |
| 36 | ecexg 8705 | . . . . 5 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V) | |
| 37 | 8, 36 | ax-mp 5 | . . . 4 ⊢ [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V |
| 38 | 35, 7, 37 | fvmpt 6985 | . . 3 ⊢ ((𝐾 · 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 39 | 34, 38 | syl 18 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 40 | 26, 32, 39 | 3eqtr3d 2804 | 1 ⊢ (𝜑 → (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ↦ cmpt 5186 ‘cfv 6531 (class class class)co 7412 [cec 8699 / cqs 8700 Basecbs 17367 Scalarcsca 17411 ·𝑠 cvsca 17412 /s cqus 17657 ~QG cqg 19312 LModclmod 21115 LSubSpclss 21186 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-ec 8703 df-qs 8707 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-5 12389 df-6 12390 df-7 12391 df-8 12392 df-9 12393 df-n0 12588 df-z 12675 df-dec 12796 df-uz 12947 df-fz 13621 df-struct 17305 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-ress 17389 df-plusg 17421 df-mulr 17422 df-sca 17424 df-vsca 17425 df-ip 17426 df-tset 17427 df-ple 17428 df-ds 17430 df-0g 17592 df-imas 17660 df-qus 17661 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-sbg 19129 df-subg 19313 df-eqg 19315 df-cmn 19976 df-abl 19977 df-mgp 20341 df-rng 20355 df-ur 20388 df-ring 20441 df-lmod 21117 df-lss 21187 |
| This theorem is used by: lmhmqusker 33950 |
| Copyright terms: Public domain | W3C validator |