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

Theorem vcdi 30594
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 30590 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 482 . . . . . . . . 9 ((∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
65ralimi 3081 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
76adantl 481 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
87ralimi 3081 . . . . . 6 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
983ad2ant3 1134 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
104, 9syl 17 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
11 oveq1 7438 . . . . . . 7 (𝑥 = 𝐵 → (𝑥𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7447 . . . . . 6 (𝑥 = 𝐵 → (𝑦𝑆(𝑥𝐺𝑧)) = (𝑦𝑆(𝐵𝐺𝑧)))
13 oveq2 7439 . . . . . . 7 (𝑥 = 𝐵 → (𝑦𝑆𝑥) = (𝑦𝑆𝐵))
1413oveq1d 7446 . . . . . 6 (𝑥 = 𝐵 → ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)))
1512, 14eqeq12d 2751 . . . . 5 (𝑥 = 𝐵 → ((𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ↔ (𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧))))
16 oveq1 7438 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝑧)))
17 oveq1 7438 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝐵) = (𝐴𝑆𝐵))
18 oveq1 7438 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝑧) = (𝐴𝑆𝑧))
1917, 18oveq12d 7449 . . . . . 6 (𝑦 = 𝐴 → ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)))
2016, 19eqeq12d 2751 . . . . 5 (𝑦 = 𝐴 → ((𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧))))
21 oveq2 7439 . . . . . . 7 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
2221oveq2d 7447 . . . . . 6 (𝑧 = 𝐶 → (𝐴𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝐶)))
23 oveq2 7439 . . . . . . 7 (𝑧 = 𝐶 → (𝐴𝑆𝑧) = (𝐴𝑆𝐶))
2423oveq2d 7447 . . . . . 6 (𝑧 = 𝐶 → ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
2522, 24eqeq12d 2751 . . . . 5 (𝑧 = 𝐶 → ((𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2615, 20, 25rspc3v 3638 . . . 4 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2710, 26syl5 34 . . 3 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
28273com12 1122 . 2 ((𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2928impcom 407 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059   × cxp 5687  ran crn 5690  wf 6559  cfv 6563  (class class class)co 7431  1st c1st 8011  2nd c2nd 8012  cc 11151  1c1 11154   + caddc 11156   · cmul 11158  AbelOpcablo 30573  CVecOLDcvc 30587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-ov 7434  df-1st 8013  df-2nd 8014  df-vc 30588
This theorem is referenced by:  nvdi  30659
  Copyright terms: Public domain W3C validator