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

Theorem vcidOLD 30953
Description: Identity element for the scalar product of a complex vector space. (Contributed by NM, 3-Nov-2006.) Obsolete theorem, use clmvs1 25289 together with cvsclm 25322 instead. (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
vciOLD.1 𝐺 = (1st𝑊)
vciOLD.2 𝑆 = (2nd𝑊)
vciOLD.3 𝑋 = ran 𝐺
Assertion
Ref Expression
vcidOLD ((𝑊 ∈ CVecOLD𝐴𝑋) → (1𝑆𝐴) = 𝐴)

Proof of Theorem vcidOLD
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vciOLD.1 . . . 4 𝐺 = (1st𝑊)
2 vciOLD.2 . . . 4 𝑆 = (2nd𝑊)
3 vciOLD.3 . . . 4 𝑋 = ran 𝐺
41, 2, 3vciOLD 30950 . . 3 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 488 . . . . 5 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → (1𝑆𝑥) = 𝑥)
65ralimi 3105 . . . 4 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
763ad2ant3 1153 . . 3 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
84, 7syl 18 . 2 (𝑊 ∈ CVecOLD → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
9 oveq2 7431 . . . 4 (𝑥 = 𝐴 → (1𝑆𝑥) = (1𝑆𝐴))
10 id 23 . . . 4 (𝑥 = 𝐴𝑥 = 𝐴)
119, 10eqeq12d 2782 . . 3 (𝑥 = 𝐴 → ((1𝑆𝑥) = 𝑥 ↔ (1𝑆𝐴) = 𝐴))
1211rspccva 3583 . 2 ((∀𝑥𝑋 (1𝑆𝑥) = 𝑥𝐴𝑋) → (1𝑆𝐴) = 𝐴)
138, 12sylan 592 1 ((𝑊 ∈ CVecOLD𝐴𝑋) → (1𝑆𝐴) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3082   × cxp 5664  ran crn 5667  wf 6539  cfv 6543  (class class class)co 7423  1st c1st 7993  2nd c2nd 7994  cc 11116  1c1 11119   + caddc 11121   · cmul 11123  AbelOpcablo 30933  CVecOLDcvc 30947
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-1st 7995  df-2nd 7996  df-vc 30948
This theorem is used by:  vc2OLD  30957  vc0  30963  vcm  30965  nvsid  31016
  Copyright terms: Public domain W3C validator