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

Theorem vcidOLD 27759
Description: Identity element for the scalar product of a complex vector space. (Contributed by NM, 3-Nov-2006.) Obsolete as of 21-Sep-2021. Use clmvs1 23112 together with cvsclm 23145 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 27756 . . 3 (𝑊 ∈ CVecOLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5 simpl 468 . . . . 5 (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → (1𝑆𝑥) = 𝑥)
65ralimi 3101 . . . 4 (∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
763ad2ant3 1129 . . 3 ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
84, 7syl 17 . 2 (𝑊 ∈ CVecOLD → ∀𝑥𝑋 (1𝑆𝑥) = 𝑥)
9 oveq2 6801 . . . 4 (𝑥 = 𝐴 → (1𝑆𝑥) = (1𝑆𝐴))
10 id 22 . . . 4 (𝑥 = 𝐴𝑥 = 𝐴)
119, 10eqeq12d 2786 . . 3 (𝑥 = 𝐴 → ((1𝑆𝑥) = 𝑥 ↔ (1𝑆𝐴) = 𝐴))
1211rspccva 3459 . 2 ((∀𝑥𝑋 (1𝑆𝑥) = 𝑥𝐴𝑋) → (1𝑆𝐴) = 𝐴)
138, 12sylan 569 1 ((𝑊 ∈ CVecOLD𝐴𝑋) → (1𝑆𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1071   = wceq 1631  wcel 2145  wral 3061   × cxp 5247  ran crn 5250  wf 6027  cfv 6031  (class class class)co 6793  1st c1st 7313  2nd c2nd 7314  cc 10136  1c1 10139   + caddc 10141   · cmul 10143  AbelOpcablo 27738  CVecOLDcvc 27753
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-fv 6039  df-ov 6796  df-1st 7315  df-2nd 7316  df-vc 27754
This theorem is referenced by:  vc2OLD  27763  vc0  27769  vcm  27771  nvsid  27822
  Copyright terms: Public domain W3C validator