| 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 2763 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) = (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) | |
| 8 | ovex 7479 | . . . . . 6 ⊢ (𝑀 ~QG 𝐺) ∈ V | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑀 ~QG 𝐺) ∈ V) |
| 10 | eqgvscpbl.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ LMod) | |
| 11 | 4, 6, 7, 9, 10 | qusval 17746 | . . . 4 ⊢ (𝜑 → 𝑁 = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)) “s 𝑀)) |
| 12 | 4, 6, 7, 9, 10 | quslem 17747 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺)):𝐵⟶onto(𝐵 / (𝑀 ~QG 𝐺))) |
| 13 | eqid 2763 | . . . 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 33996 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑆 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑢) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑣) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑢)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝑘 · 𝑣)))) |
| 25 | 11, 6, 12, 10, 13, 14, 15, 16, 24 | imasvscaval 17742 | . . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 26 | 1, 2, 25 | mpd3an23 1493 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋))) |
| 27 | eceq1 8788 | . . . . 5 ⊢ (𝑥 = 𝑋 → [𝑥](𝑀 ~QG 𝐺) = [𝑋](𝑀 ~QG 𝐺)) | |
| 28 | ecexg 8752 | . . . . . 6 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [𝑋](𝑀 ~QG 𝐺) ∈ V) | |
| 29 | 8, 28 | ax-mp 5 | . . . . 5 ⊢ [𝑋](𝑀 ~QG 𝐺) ∈ V |
| 30 | 27, 7, 29 | fvmpt 7019 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 31 | 2, 30 | syl 18 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋) = [𝑋](𝑀 ~QG 𝐺)) |
| 32 | 31 | oveq2d 7462 | . 2 ⊢ (𝜑 → (𝐾 ∙ ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘𝑋)) = (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺))) |
| 33 | 5, 13, 15, 14 | lmodvscl 21186 | . . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝐾 ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → (𝐾 · 𝑋) ∈ 𝐵) |
| 34 | 10, 1, 2, 33 | syl3anc 1399 | . . 3 ⊢ (𝜑 → (𝐾 · 𝑋) ∈ 𝐵) |
| 35 | eceq1 8788 | . . . 4 ⊢ (𝑥 = (𝐾 · 𝑋) → [𝑥](𝑀 ~QG 𝐺) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) | |
| 36 | ecexg 8752 | . . . . 5 ⊢ ((𝑀 ~QG 𝐺) ∈ V → [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V) | |
| 37 | 8, 36 | ax-mp 5 | . . . 4 ⊢ [(𝐾 · 𝑋)](𝑀 ~QG 𝐺) ∈ V |
| 38 | 35, 7, 37 | fvmpt 7019 | . . 3 ⊢ ((𝐾 · 𝑋) ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 39 | 34, 38 | syl 18 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝑀 ~QG 𝐺))‘(𝐾 · 𝑋)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| 40 | 26, 32, 39 | 3eqtr3d 2806 | 1 ⊢ (𝜑 → (𝐾 ∙ [𝑋](𝑀 ~QG 𝐺)) = [(𝐾 · 𝑋)](𝑀 ~QG 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ↦ cmpt 5190 ‘cfv 6561 (class class class)co 7446 [cec 8746 / cqs 8747 Basecbs 17419 Scalarcsca 17463 ·𝑠 cvsca 17464 /s cqus 17709 ~QG cqg 19364 LModclmod 21168 LSubSpclss 21239 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-er 8748 df-ec 8750 df-qs 8754 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-sup 9464 df-inf 9465 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-fz 13670 df-struct 17357 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-ress 17441 df-plusg 17473 df-mulr 17474 df-sca 17476 df-vsca 17477 df-ip 17478 df-tset 17479 df-ple 17480 df-ds 17482 df-0g 17644 df-imas 17712 df-qus 17713 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-grp 19179 df-minusg 19180 df-sbg 19181 df-subg 19365 df-eqg 19367 df-cmn 20029 df-abl 20030 df-mgp 20394 df-rng 20408 df-ur 20441 df-ring 20494 df-lmod 21170 df-lss 21240 |
| This theorem is used by: lmhmqusker 34052 |
| Copyright terms: Public domain | W3C validator |