| 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 2762 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) = (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) | |
| 8 | ovex 7450 | . . . . . 6 ⊢ (𝑀 ~QG 𝐺) ∈ V | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑀 ~QG 𝐺) ∈ V) |
| 10 | eqgvscpbl.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
| 11 | 4, 6, 7, 9, 10 | qusval 17634 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) “s 𝑀)) |
| 12 | 4, 6, 7, 9, 10 | quslem 17635 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)):𝐵–onto→(𝐵 / (𝑀 ~QG 𝐺))) |
| 13 | eqid 2762 | . . . 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 33799 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑢) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑣) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑢)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑣)))) |
| 25 | 11, 6, 12, 10, 13, 14, 15, 16, 24 | imasvscaval 17630 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 26 | 1, 2, 25 | mpd3an23 1492 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 27 | eceq1 8740 | . . . . 5 ⊢ (𝑥 = 𝑋 → [𝑥](𝑀 ~QG 𝐺) = [𝑋](𝑀 ~QG 𝐺)) | |
| 28 | ecexg 8704 | . . . . . 6 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [𝑋](𝑀 ~QG 𝐺) ∈ V) | |
| 29 | 8, 28 | ax-mp 5 | . . . . 5 ⊢ [𝑋](𝑀 ~QG 𝐺) ∈ V |
| 30 | 27, 7, 29 | fvmpt 6990 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 31 | 2, 30 | syl 18 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 32 | 31 | oveq2d 7433 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺))) |
| 33 | 5, 13, 15, 14 | lmodvscl 21068 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 · 𝑋) ∈ 𝐵) |
| 34 | 10, 1, 2, 33 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝐾 · 𝑋) ∈ 𝐵) |
| 35 | eceq1 8740 | . . . 4 ⊢ (𝑥 = (𝐾 · 𝑋) → [𝑥](𝑀 ~QG 𝐺) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) | |
| 36 | ecexg 8704 | . . . . 5 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V) | |
| 37 | 8, 36 | ax-mp 5 | . . . 4 ⊢ [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V |
| 38 | 35, 7, 37 | fvmpt 6990 | . . 3 ⊢ ((𝐾 · 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 39 | 34, 38 | syl 18 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 40 | 26, 32, 39 | 3eqtr3d 2805 | 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 3453 ↦ cmpt 5190 ‘cfv 6537 (class class class)co 7417 [cec 8698 / cqs 8699 Basecbs 17307 Scalarcsca 17351 ·𝑠 cvsca 17352 /s cqus 17597 ~QG cqg 19251 LModclmod 21050 LSubSpclss 21121 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-ec 8702 df-qs 8706 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-z 12620 df-dec 12741 df-uz 12892 df-fz 13566 df-struct 17245 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-ress 17329 df-plusg 17361 df-mulr 17362 df-sca 17364 df-vsca 17365 df-ip 17366 df-tset 17367 df-ple 17368 df-ds 17370 df-0g 17532 df-imas 17600 df-qus 17601 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-sbg 19068 df-subg 19252 df-eqg 19254 df-cmn 19915 df-abl 19916 df-mgp 20280 df-rng 20294 df-ur 20327 df-ring 20380 df-lmod 21052 df-lss 21122 |
| This theorem is used by: lmhmqusker 33854 |
| Copyright terms: Public domain | W3C validator |