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 23995

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 1341	. 2 ⊢ (𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld))
5		isclmi0.4	. . . 4 ⊢ (𝑥 ∈ 𝑉 → (1 · 𝑥) = 𝑥)
6		isclmi0.5	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (𝑦 · 𝑥) ∈ 𝑉)
7	6	ancoms 462	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → (𝑦 · 𝑥) ∈ 𝑉)
8		isclmi0.6	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
9	8	3com12 1125	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
10	9	3expa 1120	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
11	10	ralrimiva 3105	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
12		isclmi0.7	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)))
13		isclmi0.8	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))
14	12, 13	jca 515	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
15	14	3comr 1127	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
16	15	3expa 1120	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
17	16	ralrimiva 3105	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
18	7, 11, 17	3jca 1130	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
19	18	ralrimiva 3105	. . . 4 ⊢ (𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
20	5, 19	jca 515	. . 3 ⊢ (𝑥 ∈ 𝑉 → ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))))
21	20	rgen 3071	. 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 23994	. 2 ⊢ (𝑊 ∈ ℂMod ↔ ((𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld)) ∧ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))))
28	4, 21, 27	mpbir2an 711	1 ⊢ 𝑊 ∈ ℂMod

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ∀wral 3061 ‘cfv 6380 (class class class)co 7213 1c1 10730 + caddc 10732 · cmul 10734 Basecbs 16760 ↾_s cress 16784 +_gcplusg 16802 Scalarcsca 16805 ·_𝑠 cvsca 16806 Grpcgrp 18365 SubRingcsubrg 19796 ℂ_fldccnfld 20363 ℂModcclm 23959

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 ax-addf 10808 ax-mulf 10809

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-1o 8202 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-fin 8630 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-2 11893 df-3 11894 df-4 11895 df-5 11896 df-6 11897 df-7 11898 df-8 11899 df-9 11900 df-n0 12091 df-z 12177 df-dec 12294 df-uz 12439 df-fz 13096 df-struct 16700 df-sets 16717 df-slot 16735 df-ndx 16745 df-base 16761 df-ress 16785 df-plusg 16815 df-mulr 16816 df-starv 16817 df-tset 16821 df-ple 16822 df-ds 16824 df-unif 16825 df-0g 16946 df-mgm 18114 df-sgrp 18163 df-mnd 18174 df-grp 18368 df-subg 18540 df-cmn 19172 df-mgp 19505 df-ur 19517 df-ring 19564 df-cring 19565 df-subrg 19798 df-lmod 19901 df-cnfld 20364 df-clm 23960

This theorem is referenced by: (None)

W3C validator