iscvsi - Metamath Proof Explorer

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

Theorem iscvsi 24292

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

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

**Assertion**
Ref	Expression
iscvsi	⊢ 𝑊 ∈ ℂVec

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

**Proof of Theorem iscvsi**
Step	Hyp	Ref	Expression
1		iscvsi.1	. . 3 ⊢ 𝑊 ∈ Grp
2		iscvsi.3	. . . 4 ⊢ 𝑆 ∈ DivRing
3		iscvsi.2	. . . 4 ⊢ 𝑆 = (ℂ_fld ↾_s 𝐾)
4	2, 3	pm3.2i 471	. . 3 ⊢ (𝑆 ∈ DivRing ∧ 𝑆 = (ℂ_fld ↾_s 𝐾))
5		iscvsi.4	. . 3 ⊢ 𝐾 ∈ (SubRing‘ℂ_fld)
6	1, 4, 5	3pm3.2i 1338	. 2 ⊢ (𝑊 ∈ Grp ∧ (𝑆 ∈ DivRing ∧ 𝑆 = (ℂ_fld ↾_s 𝐾)) ∧ 𝐾 ∈ (SubRing‘ℂ_fld))
7		iscvsi.5	. . . 4 ⊢ (𝑥 ∈ 𝑉 → (1 · 𝑥) = 𝑥)
8		iscvsi.6	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (𝑦 · 𝑥) ∈ 𝑉)
9	8	ancoms 459	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → (𝑦 · 𝑥) ∈ 𝑉)
10		iscvsi.7	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
11	10	3com12 1122	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
12	11	3expa 1117	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝑉) → (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
13	12	ralrimiva 3103	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)))
14		iscvsi.8	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)))
15		iscvsi.9	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))
16	14, 15	jca 512	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾 ∧ 𝑥 ∈ 𝑉) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
17	16	3comr 1124	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
18	17	3expa 1117	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 ∈ 𝐾) → (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
19	18	ralrimiva 3103	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))
20	9, 13, 19	3jca 1127	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝐾) → ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
21	20	ralrimiva 3103	. . . 4 ⊢ (𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
22	7, 21	jca 512	. . 3 ⊢ (𝑥 ∈ 𝑉 → ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥))))))
23	22	rgen 3074	. 2 ⊢ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))
24		iscvsp.t	. . 3 ⊢ · = ( ·_𝑠 ‘𝑊)
25		iscvsp.a	. . 3 ⊢ + = (+_g‘𝑊)
26		iscvsp.v	. . 3 ⊢ 𝑉 = (Base‘𝑊)
27		iscvsp.s	. . 3 ⊢ 𝑆 = (Scalar‘𝑊)
28		iscvsp.k	. . 3 ⊢ 𝐾 = (Base‘𝑆)
29	24, 25, 26, 27, 28	iscvsp 24291	. 2 ⊢ (𝑊 ∈ ℂVec ↔ ((𝑊 ∈ Grp ∧ (𝑆 ∈ DivRing ∧ 𝑆 = (ℂ_fld ↾_s 𝐾)) ∧ 𝐾 ∈ (SubRing‘ℂ_fld)) ∧ ∀𝑥 ∈ 𝑉 ((1 · 𝑥) = 𝑥 ∧ ∀𝑦 ∈ 𝐾 ((𝑦 · 𝑥) ∈ 𝑉 ∧ ∀𝑧 ∈ 𝑉 (𝑦 · (𝑥 + 𝑧)) = ((𝑦 · 𝑥) + (𝑦 · 𝑧)) ∧ ∀𝑧 ∈ 𝐾 (((𝑧 + 𝑦) · 𝑥) = ((𝑧 · 𝑥) + (𝑦 · 𝑥)) ∧ ((𝑧 · 𝑦) · 𝑥) = (𝑧 · (𝑦 · 𝑥)))))))
30	6, 23, 29	mpbir2an 708	1 ⊢ 𝑊 ∈ ℂVec

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ‘cfv 6433 (class class class)co 7275 1c1 10872 + caddc 10874 · cmul 10876 Basecbs 16912 ↾_s cress 16941 +_gcplusg 16962 Scalarcsca 16965 ·_𝑠 cvsca 16966 Grpcgrp 18577 DivRingcdr 19991 SubRingcsubrg 20020 ℂ_fldccnfld 20597 ℂVecccvs 24286

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-fz 13240 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-grp 18580 df-subg 18752 df-cmn 19388 df-mgp 19721 df-ur 19738 df-ring 19785 df-cring 19786 df-subrg 20022 df-lmod 20125 df-lvec 20365 df-cnfld 20598 df-clm 24226 df-cvs 24287

This theorem is referenced by: (None)

W3C validator