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

Theorem vcdi 30703
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 30699 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 485 . . . . . . . . 9 ((∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
65ralimi 3089 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
76adantl 484 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
87ralimi 3089 . . . . . 6 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
983ad2ant3 1144 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
104, 9syl 17 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
11 oveq1 7388 . . . . . . 7 (𝑥 = 𝐵 → (𝑥𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7397 . . . . . 6 (𝑥 = 𝐵 → (𝑦𝑆(𝑥𝐺𝑧)) = (𝑦𝑆(𝐵𝐺𝑧)))
13 oveq2 7389 . . . . . . 7 (𝑥 = 𝐵 → (𝑦𝑆𝑥) = (𝑦𝑆𝐵))
1413oveq1d 7396 . . . . . 6 (𝑥 = 𝐵 → ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)))
1512, 14eqeq12d 2768 . . . . 5 (𝑥 = 𝐵 → ((𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ↔ (𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧))))
16 oveq1 7388 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝑧)))
17 oveq1 7388 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝐵) = (𝐴𝑆𝐵))
18 oveq1 7388 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝑧) = (𝐴𝑆𝑧))
1917, 18oveq12d 7399 . . . . . 6 (𝑦 = 𝐴 → ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)))
2016, 19eqeq12d 2768 . . . . 5 (𝑦 = 𝐴 → ((𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧))))
21 oveq2 7389 . . . . . . 7 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
2221oveq2d 7397 . . . . . 6 (𝑧 = 𝐶 → (𝐴𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝐶)))
23 oveq2 7389 . . . . . . 7 (𝑧 = 𝐶 → (𝐴𝑆𝑧) = (𝐴𝑆𝐶))
2423oveq2d 7397 . . . . . 6 (𝑧 = 𝐶 → ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
2522, 24eqeq12d 2768 . . . . 5 (𝑧 = 𝐶 → ((𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2615, 20, 25rspc3v 3588 . . . 4 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2710, 26syl5 34 . . 3 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
28273com12 1132 . 2 ((𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2928impcom 410 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1095   = wceq 1550  wcel 2132  wral 3066   × cxp 5634  ran crn 5637  wf 6502  cfv 6506  (class class class)co 7381  1st c1st 7953  2nd c2nd 7954  cc 11057  1c1 11060   + caddc 11062   · cmul 11064  AbelOpcablo 30682  CVecOLDcvc 30696
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-sep 5236  ax-nul 5246  ax-pr 5380  ax-un 7703
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rab 3405  df-v 3446  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-fv 6514  df-ov 7384  df-1st 7955  df-2nd 7956  df-vc 30697
This theorem is referenced by:  nvdi  30768
  Copyright terms: Public domain W3C validator