isclmi0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isclmi0		Structured version Visualization version GIF version

Theorem isclmi0 24167

Description: Properties that determine a subcomplex module. (Contributed by NM, 5-Nov-2006.) (Revised by AV, 4-Oct-2021.)

**Hypotheses**
Ref	Expression
isclmp.t	⊢ · = ( ·_𝑠 ‘𝑊)
isclmp.a	⊢ + = (+_g‘𝑊)
isclmp.v	⊢ 𝑉 = (Base‘𝑊)
isclmp.s	⊢ 𝑆 = (Scalar‘𝑊)
isclmp.k	⊢ 𝐾 = (Base‘𝑆)
isclmi0.1	⊢ 𝑆 = (ℂ_fld ↾_s 𝐾)
isclmi0.2	⊢ 𝑊 ∈ Grp
isclmi0.3	⊢ 𝐾 ∈ (SubRing‘ℂ_fld)
isclmi0.4	⊢ (𝑥 ∈ 𝑉 → (1 · 𝑥) = 𝑥)
isclmi0.5	⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (𝑦 · 𝑥) ∈ 𝑉)
isclmi0.6	⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
isclmi0.7	⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)))
isclmi0.8	⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))

**Assertion**
Ref	Expression
isclmi0	⊢ 𝑊 ∈ ℂMod

Distinct variable groups: 𝑥,𝐾,𝑦,𝑧 𝑥,𝑆,𝑦,𝑧 𝑥,𝑉,𝑦,𝑧 𝑥,𝑊,𝑦,𝑧 𝑥, + ,𝑦,𝑧 𝑥, · ,𝑦,𝑧

**Proof of Theorem isclmi0**
Step	Hyp	Ref	Expression
1		isclmi0.2	. . 3 ⊢ 𝑊 ∈ Grp
2		isclmi0.1	. . 3 ⊢ 𝑆 = (ℂ_fld ↾_s 𝐾)
3		isclmi0.3	. . 3 ⊢ 𝐾 ∈ (SubRing‘ℂ_fld)
4	1, 2, 3	3pm3.2i 1337	. 2 ⊢ (𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld))
5		isclmi0.4	. . . 4 ⊢ (𝑥 ∈ 𝑉 → (1 · 𝑥) = 𝑥)
6		isclmi0.5	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (𝑦 · 𝑥) ∈ 𝑉)
7	6	ancoms 458	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → (𝑦 · 𝑥) ∈ 𝑉)
8		isclmi0.6	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
9	8	3com12 1121	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
10	9	3expa 1116	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
11	10	ralrimiva 3107	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
12		isclmi0.7	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)))
13		isclmi0.8	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))
14	12, 13	jca 511	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
15	14	3comr 1123	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
16	15	3expa 1116	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
17	16	ralrimiva 3107	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
18	7, 11, 17	3jca 1126	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
19	18	ralrimiva 3107	. . . 4 ⊢ (𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
20	5, 19	jca 511	. . 3 ⊢ (𝑥 ∈ 𝑉 → ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))))
21	20	rgen 3073	. 2 ⊢ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
22		isclmp.t	. . 3 ⊢ · = ( ·_𝑠 ‘𝑊)
23		isclmp.a	. . 3 ⊢ + = (+_g‘𝑊)
24		isclmp.v	. . 3 ⊢ 𝑉 = (Base‘𝑊)
25		isclmp.s	. . 3 ⊢ 𝑆 = (Scalar‘𝑊)
26		isclmp.k	. . 3 ⊢ 𝐾 = (Base‘𝑆)
27	22, 23, 24, 25, 26	isclmp 24166	. 2 ⊢ (𝑊 ∈ ℂMod ↔ ((𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld)) ∧ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))))
28	4, 21, 27	mpbir2an 707	1 ⊢ 𝑊 ∈ ℂMod

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ‘cfv 6418 (class class class)co 7255 1c1 10803 + caddc 10805 · cmul 10807 Basecbs 16840 ↾_s cress 16867 +_gcplusg 16888 Scalarcsca 16891 ·_𝑠 cvsca 16892 Grpcgrp 18492 SubRingcsubrg 19935 ℂ_fldccnfld 20510 ℂModcclm 24131

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-subg 18667 df-cmn 19303 df-mgp 19636 df-ur 19653 df-ring 19700 df-cring 19701 df-subrg 19937 df-lmod 20040 df-cnfld 20511 df-clm 24132

This theorem is referenced by: (None)

W3C validator