![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cnlmod | Structured version Visualization version GIF version |
Description: The set of complex numbers is a left module over itself. The vector operation is +, and the scalar product is ·. (Contributed by AV, 20-Sep-2021.) |
Ref | Expression |
---|---|
cnlmod.w | ⊢ 𝑊 = ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} ∪ {〈(Scalar‘ndx), ℂfld〉, 〈( ·𝑠 ‘ndx), · 〉}) |
Ref | Expression |
---|---|
cnlmod | ⊢ 𝑊 ∈ LMod |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0cn 11282 | . 2 ⊢ 0 ∈ ℂ | |
2 | cnlmod.w | . . . . . 6 ⊢ 𝑊 = ({〈(Base‘ndx), ℂ〉, 〈(+g‘ndx), + 〉} ∪ {〈(Scalar‘ndx), ℂfld〉, 〈( ·𝑠 ‘ndx), · 〉}) | |
3 | 2 | cnlmodlem1 25188 | . . . . 5 ⊢ (Base‘𝑊) = ℂ |
4 | 3 | eqcomi 2749 | . . . 4 ⊢ ℂ = (Base‘𝑊) |
5 | 4 | a1i 11 | . . 3 ⊢ (0 ∈ ℂ → ℂ = (Base‘𝑊)) |
6 | 2 | cnlmodlem2 25189 | . . . . 5 ⊢ (+g‘𝑊) = + |
7 | 6 | eqcomi 2749 | . . . 4 ⊢ + = (+g‘𝑊) |
8 | 7 | a1i 11 | . . 3 ⊢ (0 ∈ ℂ → + = (+g‘𝑊)) |
9 | addcl 11266 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) | |
10 | 9 | 3adant1 1130 | . . 3 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) |
11 | addass 11271 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) | |
12 | 11 | adantl 481 | . . 3 ⊢ ((0 ∈ ℂ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
13 | id 22 | . . 3 ⊢ (0 ∈ ℂ → 0 ∈ ℂ) | |
14 | addlid 11473 | . . . 4 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
15 | 14 | adantl 481 | . . 3 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0 + 𝑥) = 𝑥) |
16 | negcl 11536 | . . . 4 ⊢ (𝑥 ∈ ℂ → -𝑥 ∈ ℂ) | |
17 | 16 | adantl 481 | . . 3 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → -𝑥 ∈ ℂ) |
18 | id 22 | . . . . . 6 ⊢ (𝑥 ∈ ℂ → 𝑥 ∈ ℂ) | |
19 | 16, 18 | addcomd 11492 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) |
20 | 19 | adantl 481 | . . . 4 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (-𝑥 + 𝑥) = (𝑥 + -𝑥)) |
21 | negid 11583 | . . . . 5 ⊢ (𝑥 ∈ ℂ → (𝑥 + -𝑥) = 0) | |
22 | 21 | adantl 481 | . . . 4 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑥 + -𝑥) = 0) |
23 | 20, 22 | eqtrd 2780 | . . 3 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (-𝑥 + 𝑥) = 0) |
24 | 5, 8, 10, 12, 13, 15, 17, 23 | isgrpd 18998 | . 2 ⊢ (0 ∈ ℂ → 𝑊 ∈ Grp) |
25 | 4 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → ℂ = (Base‘𝑊)) |
26 | 7 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → + = (+g‘𝑊)) |
27 | 2 | cnlmodlem3 25190 | . . . . 5 ⊢ (Scalar‘𝑊) = ℂfld |
28 | 27 | eqcomi 2749 | . . . 4 ⊢ ℂfld = (Scalar‘𝑊) |
29 | 28 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → ℂfld = (Scalar‘𝑊)) |
30 | 2 | cnlmod4 25191 | . . . . 5 ⊢ ( ·𝑠 ‘𝑊) = · |
31 | 30 | eqcomi 2749 | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) |
32 | 31 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → · = ( ·𝑠 ‘𝑊)) |
33 | cnfldbas 21391 | . . . 4 ⊢ ℂ = (Base‘ℂfld) | |
34 | 33 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → ℂ = (Base‘ℂfld)) |
35 | cnfldadd 21393 | . . . 4 ⊢ + = (+g‘ℂfld) | |
36 | 35 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → + = (+g‘ℂfld)) |
37 | cnfldmul 21395 | . . . 4 ⊢ · = (.r‘ℂfld) | |
38 | 37 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → · = (.r‘ℂfld)) |
39 | cnfld1 21429 | . . . 4 ⊢ 1 = (1r‘ℂfld) | |
40 | 39 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → 1 = (1r‘ℂfld)) |
41 | cnring 21426 | . . . 4 ⊢ ℂfld ∈ Ring | |
42 | 41 | a1i 11 | . . 3 ⊢ (𝑊 ∈ Grp → ℂfld ∈ Ring) |
43 | id 22 | . . 3 ⊢ (𝑊 ∈ Grp → 𝑊 ∈ Grp) | |
44 | mulcl 11268 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
45 | 44 | 3adant1 1130 | . . 3 ⊢ ((𝑊 ∈ Grp ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) |
46 | adddi 11273 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) | |
47 | 46 | adantl 481 | . . 3 ⊢ ((𝑊 ∈ Grp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 + 𝑧)) = ((𝑥 · 𝑦) + (𝑥 · 𝑧))) |
48 | adddir 11281 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) | |
49 | 48 | adantl 481 | . . 3 ⊢ ((𝑊 ∈ Grp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧))) |
50 | mulass 11272 | . . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) | |
51 | 50 | adantl 481 | . . 3 ⊢ ((𝑊 ∈ Grp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → ((𝑥 · 𝑦) · 𝑧) = (𝑥 · (𝑦 · 𝑧))) |
52 | mullid 11289 | . . . 4 ⊢ (𝑥 ∈ ℂ → (1 · 𝑥) = 𝑥) | |
53 | 52 | adantl 481 | . . 3 ⊢ ((𝑊 ∈ Grp ∧ 𝑥 ∈ ℂ) → (1 · 𝑥) = 𝑥) |
54 | 25, 26, 29, 32, 34, 36, 38, 40, 42, 43, 45, 47, 49, 51, 53 | islmodd 20886 | . 2 ⊢ (𝑊 ∈ Grp → 𝑊 ∈ LMod) |
55 | 1, 24, 54 | mp2b 10 | 1 ⊢ 𝑊 ∈ LMod |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ∪ cun 3974 {cpr 4650 〈cop 4654 ‘cfv 6573 (class class class)co 7448 ℂcc 11182 0cc0 11184 1c1 11185 + caddc 11187 · cmul 11189 -cneg 11521 ndxcnx 17240 Basecbs 17258 +gcplusg 17311 .rcmulr 17312 Scalarcsca 17314 ·𝑠 cvsca 17315 Grpcgrp 18973 1rcur 20208 Ringcrg 20260 LModclmod 20880 ℂfldccnfld 21387 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-addf 11263 ax-mulf 11264 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-plusg 17324 df-mulr 17325 df-starv 17326 df-sca 17327 df-vsca 17328 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-0g 17501 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-grp 18976 df-cmn 19824 df-mgp 20162 df-ur 20209 df-ring 20262 df-cring 20263 df-lmod 20882 df-cnfld 21388 |
This theorem is referenced by: cnstrcvs 25193 |
Copyright terms: Public domain | W3C validator |