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 25463

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 1358	. 2 ⊢ (𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld))
5		isclmi0.4	. . . 4 ⊢ (𝑥 ∈ 𝑉 → (1 · 𝑥) = 𝑥)
6		isclmi0.5	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (𝑦 · 𝑥) ∈ 𝑉)
7	6	ancoms 464	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → (𝑦 · 𝑥) ∈ 𝑉)
8		isclmi0.6	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
9	8	3com12 1141	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
10	9	3expa 1136	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
11	10	ralrimiva 3158	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
12		isclmi0.7	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)))
13		isclmi0.8	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))
14	12, 13	jca 521	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
15	14	3comr 1143	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
16	15	3expa 1136	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
17	16	ralrimiva 3158	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
18	7, 11, 17	3jca 1146	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
19	18	ralrimiva 3158	. . . 4 ⊢ (𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
20	5, 19	jca 521	. . 3 ⊢ (𝑥 ∈ 𝑉 → ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))))
21	20	rgen 3082	. 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 25462	. 2 ⊢ (𝑊 ∈ ℂMod ↔ ((𝑊 ∈ Grp ∧ 𝑆 = (ℂ_fld ↾_s 𝐾) ∧ 𝐾 ∈ (SubRing‘ℂ_fld)) ∧ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))))
28	4, 21, 27	mpbir2an 724	1 ⊢ 𝑊 ∈ ℂMod

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ‘cfv 6564 (class class class)co 7449 1c1 11238 + caddc 11240 · cmul 11242 Basecbs 17428 ↾_s cress 17449 +_gcplusg 17469 Scalarcsca 17472 ·_𝑠 cvsca 17473 Grpcgrp 19185 SubRingcsubrg 20863 ℂ_fldccnfld 21720 ℂModcclm 25427

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-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 ax-cnex 11293 ax-resscn 11294 ax-1cn 11295 ax-icn 11296 ax-addcl 11297 ax-addrcl 11298 ax-mulcl 11299 ax-mulrcl 11300 ax-mulcom 11301 ax-addass 11302 ax-mulass 11303 ax-distr 11304 ax-i2m1 11305 ax-1ne0 11306 ax-1rid 11307 ax-rnegex 11308 ax-rrecex 11309 ax-cnre 11310 ax-pre-lttri 11311 ax-pre-lttrn 11312 ax-pre-ltadd 11313 ax-pre-mulgt0 11314 ax-addf 11316 ax-mulf 11317

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 6328 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-riota 7406 df-ov 7452 df-oprab 7453 df-mpo 7454 df-om 7910 df-1st 8033 df-2nd 8034 df-frecs 8335 df-wrecs 8366 df-recs 8415 df-rdg 8454 df-1o 8512 df-er 8753 df-en 9010 df-dom 9011 df-sdom 9012 df-fin 9013 df-pnf 11382 df-mnf 11383 df-xr 11384 df-ltxr 11385 df-le 11386 df-sub 11580 df-neg 11581 df-nn 12374 df-2 12443 df-3 12444 df-4 12445 df-5 12446 df-6 12447 df-7 12448 df-8 12449 df-9 12450 df-n0 12645 df-z 12732 df-dec 12853 df-uz 13004 df-fz 13678 df-struct 17366 df-sets 17383 df-slot 17401 df-ndx 17413 df-base 17429 df-ress 17450 df-plusg 17482 df-mulr 17483 df-starv 17484 df-tset 17488 df-ple 17489 df-ds 17491 df-unif 17492 df-0g 17653 df-mgm 18857 df-sgrp 18949 df-mnd 18965 df-grp 19188 df-subg 19374 df-cmn 20038 df-mgp 20403 df-ur 20450 df-ring 20503 df-cring 20504 df-subrg 20864 df-lmod 21179 df-cnfld 21721 df-clm 25428

This theorem is used by: (None)

W3C validator