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

Theorem vcass 31080
Description: Associative 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
vcass ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶𝑋)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶)))

Proof of Theorem vcass
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vciOLD.1 . . . . . 6 𝐺 = (1st𝑊)
2 vciOLD.2 . . . . . 6 𝑆 = (2nd𝑊)
3 vciOLD.3 . . . . . 6 𝑋 = ran 𝐺
41, 2, 3vciOLD 31074 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpr 490 . . . . . . . . . . 11 ((((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
65ralimi 3099 . . . . . . . . . 10 (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
76adantl 487 . . . . . . . . 9 ((∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
87ralimi 3099 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
98adantl 487 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
109ralimi 3099 . . . . . 6 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
11103ad2ant3 1153 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
124, 11syl 18 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
13 oveq2 7424 . . . . . 6 (𝑥 = 𝐶 → ((𝑦 · 𝑧)𝑆𝑥) = ((𝑦 · 𝑧)𝑆𝐶))
14 oveq2 7424 . . . . . . 7 (𝑥 = 𝐶 → (𝑧𝑆𝑥) = (𝑧𝑆𝐶))
1514oveq2d 7432 . . . . . 6 (𝑥 = 𝐶 → (𝑦𝑆(𝑧𝑆𝑥)) = (𝑦𝑆(𝑧𝑆𝐶)))
1613, 15eqeq12d 2776 . . . . 5 (𝑥 = 𝐶 → (((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶))))
17 oveq1 7423 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 · 𝑧) = (𝐴 · 𝑧))
1817oveq1d 7431 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 · 𝑧)𝑆𝐶) = ((𝐴 · 𝑧)𝑆𝐶))
19 oveq1 7423 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝑧𝑆𝐶)))
2018, 19eqeq12d 2776 . . . . 5 (𝑦 = 𝐴 → (((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶))))
21 oveq2 7424 . . . . . . 7 (𝑧 = 𝐵 → (𝐴 · 𝑧) = (𝐴 · 𝐵))
2221oveq1d 7431 . . . . . 6 (𝑧 = 𝐵 → ((𝐴 · 𝑧)𝑆𝐶) = ((𝐴 · 𝐵)𝑆𝐶))
23 oveq1 7423 . . . . . . 7 (𝑧 = 𝐵 → (𝑧𝑆𝐶) = (𝐵𝑆𝐶))
2423oveq2d 7432 . . . . . 6 (𝑧 = 𝐵 → (𝐴𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝐵𝑆𝐶)))
2522, 24eqeq12d 2776 . . . . 5 (𝑧 = 𝐵 → (((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2616, 20, 25rspc3v 3592 . . . 4 ((𝐶𝑋𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2712, 26syl5 35 . . 3 ((𝐶𝑋𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
28273coml 1145 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶𝑋) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2928impcom 413 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶𝑋)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3076   × cxp 5653  ran crn 5656  wf 6531  cfv 6535  (class class class)co 7416  1st c1st 7990  2nd c2nd 7991  cc 11147  1c1 11150   + caddc 11152   · cmul 11154  AbelOpcablo 31057  CVecOLDcvc 31071
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-fv 6543  df-ov 7419  df-1st 7992  df-2nd 7993  df-vc 31072
This theorem is used by:  vcz  31088  nvsass  31141
  Copyright terms: Public domain W3C validator