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

Theorem vcass 31228
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 31222 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpr 490 . . . . . . . . . . 11 ((((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
65ralimi 3106 . . . . . . . . . 10 (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
76adantl 487 . . . . . . . . 9 ((∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
87ralimi 3106 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
98adantl 487 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
109ralimi 3106 . . . . . 6 (∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
11103ad2ant3 1154 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
124, 11syl 18 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
13 oveq2 7458 . . . . . 6 (𝑥 = 𝐶 → ((𝑦 · 𝑧)𝑆𝑥) = ((𝑦 · 𝑧)𝑆𝐶))
14 oveq2 7458 . . . . . . 7 (𝑥 = 𝐶 → (𝑧𝑆𝑥) = (𝑧𝑆𝐶))
1514oveq2d 7466 . . . . . 6 (𝑥 = 𝐶 → (𝑦𝑆(𝑧𝑆𝑥)) = (𝑦𝑆(𝑧𝑆𝐶)))
1613, 15eqeq12d 2782 . . . . 5 (𝑥 = 𝐶 → (((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶))))
17 oveq1 7457 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 · 𝑧) = (𝐴 · 𝑧))
1817oveq1d 7465 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 · 𝑧)𝑆𝐶) = ((𝐴 · 𝑧)𝑆𝐶))
19 oveq1 7457 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝑧𝑆𝐶)))
2018, 19eqeq12d 2782 . . . . 5 (𝑦 = 𝐴 → (((𝑦 · 𝑧)𝑆𝐶) = (𝑦𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶))))
21 oveq2 7458 . . . . . . 7 (𝑧 = 𝐵 → (𝐴 · 𝑧) = (𝐴 · 𝐵))
2221oveq1d 7465 . . . . . 6 (𝑧 = 𝐵 → ((𝐴 · 𝑧)𝑆𝐶) = ((𝐴 · 𝐵)𝑆𝐶))
23 oveq1 7457 . . . . . . 7 (𝑧 = 𝐵 → (𝑧𝑆𝐶) = (𝐵𝑆𝐶))
2423oveq2d 7466 . . . . . 6 (𝑧 = 𝐵 → (𝐴𝑆(𝑧𝑆𝐶)) = (𝐴𝑆(𝐵𝑆𝐶)))
2522, 24eqeq12d 2782 . . . . 5 (𝑧 = 𝐵 → (((𝐴 · 𝑧)𝑆𝐶) = (𝐴𝑆(𝑧𝑆𝐶)) ↔ ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2616, 20, 25rspc3v 3594 . . . 4 ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ ℂ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2712, 26syl5 35 . . 3 ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
28273coml 1146 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (𝑊 ∈ CVecOLD → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶))))
2928impcom 413 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → ((𝐴 · 𝐵)𝑆𝐶) = (𝐴𝑆(𝐵𝑆𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083   × cxp 5655  ran crn 5658  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033  ℂcc 11236  1c1 11239   + caddc 11241   · cmul 11243  AbelOpcablo 31205  CVecOLDcvc 31219
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573  df-ov 7453  df-1st 8034  df-2nd 8035  df-vc 31220
This theorem is used by:  vcz  31236  nvsass  31289
  Copyright terms: Public domain W3C validator