vciOLD - Metamath Proof Explorer

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

Theorem vciOLD 30319

Description: Obsolete version of cvsi 25008. The properties of a complex vector space, which is an Abelian group (i.e. the vectors, with the operation of vector addition) accompanied by a scalar multiplication operation on the field of complex numbers. The variable 𝑊 was chosen because V is already used for the universal class. (Contributed by NM, 3-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.)

**Hypotheses**
Ref	Expression
vciOLD.1	⊢ 𝐺 = (1^st ‘𝑊)
vciOLD.2	⊢ 𝑆 = (2^nd ‘𝑊)
vciOLD.3	⊢ 𝑋 = ran 𝐺

**Assertion**
Ref	Expression
vciOLD	⊢ (𝑊 ∈ CVec_OLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))

Distinct variable groups: 𝑥,𝑦,𝑧,𝐺 𝑥,𝑆,𝑦,𝑧 𝑥,𝑋,𝑦,𝑧 Allowed substitution hints: 𝑊(𝑥,𝑦,𝑧)

Proof of Theorem vciOLD Dummy variables 𝑔 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vciOLD.1	. . . . 5 ⊢ 𝐺 = (1^st ‘𝑊)
2	1	eqeq2i 2739	. . . 4 ⊢ (𝑔 = 𝐺 ↔ 𝑔 = (1^st ‘𝑊))
3		eleq1 2815	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ AbelOp ↔ 𝐺 ∈ AbelOp))
4		rneq 5928	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
5		vciOLD.3	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
6	4, 5	eqtr4di 2784	. . . . . 6 ⊢ (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
7		xpeq2 5690	. . . . . . . 8 ⊢ (ran 𝑔 = 𝑋 → (ℂ × ran 𝑔) = (ℂ × 𝑋))
8	7	feq2d 6696	. . . . . . 7 ⊢ (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ↔ 𝑠:(ℂ × 𝑋)⟶ran 𝑔))
9		feq3 6693	. . . . . . 7 ⊢ (ran 𝑔 = 𝑋 → (𝑠:(ℂ × 𝑋)⟶ran 𝑔 ↔ 𝑠:(ℂ × 𝑋)⟶𝑋))
10	8, 9	bitrd 279	. . . . . 6 ⊢ (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ↔ 𝑠:(ℂ × 𝑋)⟶𝑋))
11	6, 10	syl 17	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ↔ 𝑠:(ℂ × 𝑋)⟶𝑋))
12		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → (𝑥𝑔𝑧) = (𝑥𝐺𝑧))
13	12	oveq2d 7420	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑦𝑠(𝑥𝑔𝑧)) = (𝑦𝑠(𝑥𝐺𝑧)))
14		oveq 7410	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)))
15	13, 14	eqeq12d 2742	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
16	6, 15	raleqbidv 3336	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ ∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
17		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)))
18	17	eqeq2d 2737	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥))))
19	18	anbi1d 629	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
20	19	ralbidv 3171	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
21	16, 20	anbi12d 630	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
22	21	ralbidv 3171	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
23	22	anbi2d 628	. . . . . 6 ⊢ (𝑔 = 𝐺 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
24	6, 23	raleqbidv 3336	. . . . 5 ⊢ (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
25	3, 11, 24	3anbi123d 1432	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))))
26	2, 25	sylbir 234	. . 3 ⊢ (𝑔 = (1^st ‘𝑊) → ((𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))))
27		vciOLD.2	. . . . 5 ⊢ 𝑆 = (2^nd ‘𝑊)
28	27	eqeq2i 2739	. . . 4 ⊢ (𝑠 = 𝑆 ↔ 𝑠 = (2^nd ‘𝑊))
29		feq1 6691	. . . . 5 ⊢ (𝑠 = 𝑆 → (𝑠:(ℂ × 𝑋)⟶𝑋 ↔ 𝑆:(ℂ × 𝑋)⟶𝑋))
30		oveq 7410	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (1𝑠𝑥) = (1𝑆𝑥))
31	30	eqeq1d 2728	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((1𝑠𝑥) = 𝑥 ↔ (1𝑆𝑥) = 𝑥))
32		oveq 7410	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (𝑦𝑠(𝑥𝐺𝑧)) = (𝑦𝑆(𝑥𝐺𝑧)))
33		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (𝑦𝑠𝑥) = (𝑦𝑆𝑥))
34		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (𝑦𝑠𝑧) = (𝑦𝑆𝑧))
35	33, 34	oveq12d 7422	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
36	32, 35	eqeq12d 2742	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → ((𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
37	36	ralbidv 3171	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
38		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦 + 𝑧)𝑆𝑥))
39		oveq 7410	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑆 → (𝑧𝑠𝑥) = (𝑧𝑆𝑥))
40	33, 39	oveq12d 7422	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
41	38, 40	eqeq12d 2742	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥))))
42		oveq 7410	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → ((𝑦 · 𝑧)𝑠𝑥) = ((𝑦 · 𝑧)𝑆𝑥))
43	39	oveq2d 7420	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑠(𝑧𝑆𝑥)))
44		oveq 7410	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑆𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
45	43, 44	eqtrd 2766	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
46	42, 45	eqeq12d 2742	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
47	41, 46	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
48	47	ralbidv 3171	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
49	37, 48	anbi12d 630	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
50	49	ralbidv 3171	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
51	31, 50	anbi12d 630	. . . . . 6 ⊢ (𝑠 = 𝑆 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
52	51	ralbidv 3171	. . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
53	29, 52	3anbi23d 1435	. . . 4 ⊢ (𝑠 = 𝑆 → ((𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
54	28, 53	sylbir 234	. . 3 ⊢ (𝑠 = (2^nd ‘𝑊) → ((𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
55	26, 54	elopabi 8044	. 2 ⊢ (𝑊 ∈ {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))} → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
56		df-vc 30317	. 2 ⊢ CVec_OLD = {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))}
57	55, 56	eleq2s 2845	1 ⊢ (𝑊 ∈ CVec_OLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3055 {copab 5203 × cxp 5667 ran crn 5670 ⟶wf 6532 ‘cfv 6536 (class class class)co 7404 1^st c1st 7969 2^nd c2nd 7970 ℂcc 11107 1c1 11110 + caddc 11112 · cmul 11114 AbelOpcablo 30302 CVec_OLDcvc 30316

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pr 5420 ax-un 7721

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-ov 7407 df-1st 7971 df-2nd 7972 df-vc 30317

This theorem is referenced by: vcsm 30320 vcidOLD 30322 vcdi 30323 vcdir 30324 vcass 30325 vcablo 30327

W3C validator