Theorem vcdir 30927

Description: Distributive law for the scalar product of a complex vector space. (Contributed by NM, 3-Nov-2006.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
vcdir	⊢ ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶)))

Proof of Theorem vcdir

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vciOLD.1	. . . . . 6 ⊢ 𝐺 = (1st ‘𝑊)
2		vciOLD.2	. . . . . 6 ⊢ 𝑆 = (2nd ‘𝑊)
3		vciOLD.3	. . . . . 6 ⊢ 𝑋 = ran 𝐺
4	1, 2, 3	vciOLD 30922	. . . . 5 ⊢ (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5		simpl 487	. . . . . . . . . . 11 ⊢ ((((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
6	5	ralimi 3102	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
7	6	adantl 486	. . . . . . . . 9 ⊢ ((∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
8	7	ralimi 3102	. . . . . . . 8 ⊢ (∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
9	8	adantl 486	. . . . . . 7 ⊢ (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
10	9	ralimi 3102	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
11	10	3ad2ant3 1153	. . . . 5 ⊢ ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
12	4, 11	syl 18	. . . 4 ⊢ (𝑊 ∈ CVecOLD → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
13		oveq2 7418	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦 + 𝑧)𝑆𝐶))
14		oveq2 7418	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑦𝑆𝑥) = (𝑦𝑆𝐶))
15		oveq2 7418	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑧𝑆𝑥) = (𝑧𝑆𝐶))
16	14, 15	oveq12d 7428	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) = ((𝑦𝑆𝐶)𝐺(𝑧𝑆𝐶)))
17	13, 16	eqeq12d 2779	. . . . 5 ⊢ (𝑥 = 𝐶 → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ↔ ((𝑦 + 𝑧)𝑆𝐶) = ((𝑦𝑆𝐶)𝐺(𝑧𝑆𝐶))))
18		oveq1 7417	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑦 + 𝑧) = (𝐴 + 𝑧))
19	18	oveq1d 7425	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝑦 + 𝑧)𝑆𝐶) = ((𝐴 + 𝑧)𝑆𝐶))
20		oveq1 7417	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑦𝑆𝐶) = (𝐴𝑆𝐶))
21	20	oveq1d 7425	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝑦𝑆𝐶)𝐺(𝑧𝑆𝐶)) = ((𝐴𝑆𝐶)𝐺(𝑧𝑆𝐶)))
22	19, 21	eqeq12d 2779	. . . . 5 ⊢ (𝑦 = 𝐴 → (((𝑦 + 𝑧)𝑆𝐶) = ((𝑦𝑆𝐶)𝐺(𝑧𝑆𝐶)) ↔ ((𝐴 + 𝑧)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝑧𝑆𝐶))))
23		oveq2 7418	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝐴 + 𝑧) = (𝐴 + 𝐵))
24	23	oveq1d 7425	. . . . . 6 ⊢ (𝑧 = 𝐵 → ((𝐴 + 𝑧)𝑆𝐶) = ((𝐴 + 𝐵)𝑆𝐶))
25		oveq1 7417	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝑧𝑆𝐶) = (𝐵𝑆𝐶))
26	25	oveq2d 7426	. . . . . 6 ⊢ (𝑧 = 𝐵 → ((𝐴𝑆𝐶)𝐺(𝑧𝑆𝐶)) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶)))
27	24, 26	eqeq12d 2779	. . . . 5 ⊢ (𝑧 = 𝐵 → (((𝐴 + 𝑧)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝑧𝑆𝐶)) ↔ ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶))))
28	17, 22, 27	rspc3v 3597	. . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) → ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶))))
29	12, 28	syl5 35	. . 3 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑊 ∈ CVecOLD → ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶))))
30	29	3coml 1145	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (𝑊 ∈ CVecOLD → ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶))))
31	30	impcom 412	1 ⊢ ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → ((𝐴 + 𝐵)𝑆𝐶) = ((𝐴𝑆𝐶)𝐺(𝐵𝑆𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∀wral 3079   × cxp 5659  ran crn 5662  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  1^st c1st 7980  2^nd c2nd 7981  ℂcc 11102  1c1 11105   + caddc 11107   · cmul 11109  AbelOpcablo 30905  CVec_OLDcvc 30919

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-1st 7982  df-2nd 7983  df-vc 30920

This theorem is used by:  vc2OLD  30929  vc0  30935  vcm  30937  nvdir  30992