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

Theorem vcdi 31173
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
vcdi ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))

Proof of Theorem vcdi
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 31169 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 488 . . . . . . . . 9 ((∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
65ralimi 3099 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
76adantl 487 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
87ralimi 3099 . . . . . 6 (∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
983ad2ant3 1153 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
104, 9syl 18 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
11 oveq1 7428 . . . . . . 7 (𝑥 = 𝐵 → (𝑥𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7437 . . . . . 6 (𝑥 = 𝐵 → (𝑦𝑆(𝑥𝐺𝑧)) = (𝑦𝑆(𝐵𝐺𝑧)))
13 oveq2 7429 . . . . . . 7 (𝑥 = 𝐵 → (𝑦𝑆𝑥) = (𝑦𝑆𝐵))
1413oveq1d 7436 . . . . . 6 (𝑥 = 𝐵 → ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)))
1512, 14eqeq12d 2776 . . . . 5 (𝑥 = 𝐵 → ((𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ↔ (𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧))))
16 oveq1 7428 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝑧)))
17 oveq1 7428 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝐵) = (𝐴𝑆𝐵))
18 oveq1 7428 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝑧) = (𝐴𝑆𝑧))
1917, 18oveq12d 7439 . . . . . 6 (𝑦 = 𝐴 → ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)))
2016, 19eqeq12d 2776 . . . . 5 (𝑦 = 𝐴 → ((𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧))))
21 oveq2 7429 . . . . . . 7 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
2221oveq2d 7437 . . . . . 6 (𝑧 = 𝐶 → (𝐴𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝐶)))
23 oveq2 7429 . . . . . . 7 (𝑧 = 𝐶 → (𝐴𝑆𝑧) = (𝐴𝑆𝐶))
2423oveq2d 7437 . . . . . 6 (𝑧 = 𝐶 → ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
2522, 24eqeq12d 2776 . . . . 5 (𝑧 = 𝐶 → ((𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2615, 20, 25rspc3v 3591 . . . 4 ((𝐵 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ ℂ ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2710, 26syl5 35 . . 3 ((𝐵 ∈ 𝑋 ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
28273com12 1141 . 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 1569   ∈ wcel 2144  ∀wral 3076   × cxp 5648  ran crn 5651  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421  1st c1st 8000  2nd c2nd 8001  ℂcc 11202  1c1 11205   + caddc 11207   · cmul 11209  AbelOpcablo 31152  CVecOLDcvc 31166
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fv 6547  df-ov 7424  df-1st 8002  df-2nd 8003  df-vc 31167
This theorem is used by:  nvdi  31238
  Copyright terms: Public domain W3C validator