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

Theorem vcdi 28109
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 28105 . . . . 5 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 475 . . . . . . . . 9 ((∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
65ralimi 3104 . . . . . . . 8 (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
76adantl 474 . . . . . . 7 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
87ralimi 3104 . . . . . 6 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
983ad2ant3 1115 . . . . 5 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
104, 9syl 17 . . . 4 (𝑊 ∈ CVecOLD → ∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
11 oveq1 6977 . . . . . . 7 (𝑥 = 𝐵 → (𝑥𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 6986 . . . . . 6 (𝑥 = 𝐵 → (𝑦𝑆(𝑥𝐺𝑧)) = (𝑦𝑆(𝐵𝐺𝑧)))
13 oveq2 6978 . . . . . . 7 (𝑥 = 𝐵 → (𝑦𝑆𝑥) = (𝑦𝑆𝐵))
1413oveq1d 6985 . . . . . 6 (𝑥 = 𝐵 → ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)))
1512, 14eqeq12d 2787 . . . . 5 (𝑥 = 𝐵 → ((𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ↔ (𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧))))
16 oveq1 6977 . . . . . 6 (𝑦 = 𝐴 → (𝑦𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝑧)))
17 oveq1 6977 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝐵) = (𝐴𝑆𝐵))
18 oveq1 6977 . . . . . . 7 (𝑦 = 𝐴 → (𝑦𝑆𝑧) = (𝐴𝑆𝑧))
1917, 18oveq12d 6988 . . . . . 6 (𝑦 = 𝐴 → ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)))
2016, 19eqeq12d 2787 . . . . 5 (𝑦 = 𝐴 → ((𝑦𝑆(𝐵𝐺𝑧)) = ((𝑦𝑆𝐵)𝐺(𝑦𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧))))
21 oveq2 6978 . . . . . . 7 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
2221oveq2d 6986 . . . . . 6 (𝑧 = 𝐶 → (𝐴𝑆(𝐵𝐺𝑧)) = (𝐴𝑆(𝐵𝐺𝐶)))
23 oveq2 6978 . . . . . . 7 (𝑧 = 𝐶 → (𝐴𝑆𝑧) = (𝐴𝑆𝐶))
2423oveq2d 6986 . . . . . 6 (𝑧 = 𝐶 → ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
2522, 24eqeq12d 2787 . . . . 5 (𝑧 = 𝐶 → ((𝐴𝑆(𝐵𝐺𝑧)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝑧)) ↔ (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2615, 20, 25rspc3v 3545 . . . 4 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (∀𝑥𝑋𝑦 ∈ ℂ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2710, 26syl5 34 . . 3 ((𝐵𝑋𝐴 ∈ ℂ ∧ 𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
28273com12 1103 . 2 ((𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋) → (𝑊 ∈ CVecOLD → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶))))
2928impcom 399 1 ((𝑊 ∈ CVecOLD ∧ (𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋)) → (𝐴𝑆(𝐵𝐺𝐶)) = ((𝐴𝑆𝐵)𝐺(𝐴𝑆𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 387  w3a 1068   = wceq 1507  wcel 2048  wral 3082   × cxp 5398  ran crn 5401  wf 6178  cfv 6182  (class class class)co 6970  1st c1st 7492  2nd c2nd 7493  cc 10325  1c1 10328   + caddc 10330   · cmul 10332  AbelOpcablo 28088  CVecOLDcvc 28102
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ral 3087  df-rex 3088  df-rab 3091  df-v 3411  df-sbc 3678  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-sn 4436  df-pr 4438  df-op 4442  df-uni 4707  df-br 4924  df-opab 4986  df-mpt 5003  df-id 5305  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-iota 6146  df-fun 6184  df-fn 6185  df-f 6186  df-fv 6190  df-ov 6973  df-1st 7494  df-2nd 7495  df-vc 28103
This theorem is referenced by:  nvdi  28174
  Copyright terms: Public domain W3C validator