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

Theorem vcass 30860
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 30854 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpr 489 . . . . . . . . . . 11 ((((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
65ralimi 3108 . . . . . . . . . 10 (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
76adantl 486 . . . . . . . . 9 ((∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
87ralimi 3108 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
98adantl 486 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
109ralimi 3108 . . . . . 6 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
11103ad2ant3 1151 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
124, 11syl 18 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
13 oveq2 7419 . . . . . 6 (𝑥 = 𝐶 → ((𝑦 · 𝑧)𝑆𝑥) = ((𝑦 · 𝑧)𝑆𝐶))
14 oveq2 7419 . . . . . . 7 (𝑥 = 𝐶 → (𝑧𝑆𝑥) = (𝑧𝑆𝐶))
1514oveq2d 7427 . . . . . 6 (𝑥 = 𝐶 → (𝑦𝑆(𝑧𝑆𝑥)) = (𝑦𝑆(𝑧𝑆𝐶)))
1613, 15eqeq12d 2785 . . . . 5 (𝑥 = 𝐶 → (((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶))))
17 oveq1 7418 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 · 𝑧) = (𝐴 · 𝑧))
1817oveq1d 7426 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 · 𝑧)𝑆𝐶) = ((𝐴 · 𝑧)𝑆𝐶))
19 oveq1 7418 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝑧𝑆𝐶)))
2018, 19eqeq12d 2785 . . . . 5 (𝑦 = 𝐴 → (((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶))))
21 oveq2 7419 . . . . . . 7 (𝑧 = 𝐵 → (𝐴 · 𝑧) = (𝐴 · 𝐵))
2221oveq1d 7426 . . . . . 6 (𝑧 = 𝐵 → ((𝐴 · 𝑧)𝑆𝐶) = ((𝐴 · 𝐵)𝑆𝐶))
23 oveq1 7418 . . . . . . 7 (𝑧 = 𝐵 → (𝑧𝑆𝐶) = (𝐵𝑆𝐶))
2423oveq2d 7427 . . . . . 6 (𝑧 = 𝐵 → (𝐴𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝐵𝑆𝐶)))
2522, 24eqeq12d 2785 . . . . 5 (𝑧 = 𝐵 → (((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2616, 20, 25rspc3v 3606 . . . 4 ((𝐶𝑋𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2712, 26syl5 35 . . 3 ((𝐶𝑋𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
28273coml 1143 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶𝑋) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2928impcom 412 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶𝑋)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1567  wcel 2149  wral 3085   × cxp 5660  ran crn 5663  wf 6533  cfv 6537  (class class class)co 7411  1st c1st 7984  2nd c2nd 7985  cc 11098  1c1 11101   + caddc 11103   · cmul 11105  AbelOpcablo 30837  CVecOLDcvc 30851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-1st 7986  df-2nd 7987  df-vc 30852
This theorem is referenced by:  vcz  30868  nvsass  30921
  Copyright terms: Public domain W3C validator