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

Theorem isvciOLD 31175
Description: Properties that determine a complex vector space. (Contributed by NM, 5-Nov-2006.) Obsolete version of iscvsi 25443. (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
isvciOLD.1 𝐺 ∈ AbelOp
isvciOLD.2 dom 𝐺 = (𝑋 × 𝑋)
isvciOLD.3 𝑆:(ℂ × 𝑋)⟶𝑋
isvciOLD.4 (𝑥 ∈ 𝑋 → (1𝑆𝑥) = 𝑥)
isvciOLD.5 ((𝑦 ∈ ℂ ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
isvciOLD.6 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
isvciOLD.7 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
isvciOLD.8 𝑊 = ⟨𝐺, 𝑆⟩
Assertion
Ref Expression
isvciOLD 𝑊 ∈ CVecOLD
Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝑆,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧
Allowed substitution hints:   𝑊(𝑥, 𝑦, 𝑧)

Proof of Theorem isvciOLD
StepHypRef Expression
1 isvciOLD.8 . 2 𝑊 = ⟨𝐺, 𝑆⟩
2 isvciOLD.1 . . 3 𝐺 ∈ AbelOp
3 isvciOLD.3 . . 3 𝑆:(ℂ × 𝑋)⟶𝑋
4 isvciOLD.4 . . . . 5 (𝑥 ∈ 𝑋 → (1𝑆𝑥) = 𝑥)
5 isvciOLD.5 . . . . . . . . . 10 ((𝑦 ∈ ℂ ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
653com12 1141 . . . . . . . . 9 ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ 𝑋) → (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
763expa 1136 . . . . . . . 8 (((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) ∧ 𝑧 ∈ 𝑋) → (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
87ralrimiva 3155 . . . . . . 7 ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) → ∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
9 isvciOLD.6 . . . . . . . . . . 11 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
10 isvciOLD.7 . . . . . . . . . . 11 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
119, 10jca 521 . . . . . . . . . 10 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
12113comr 1143 . . . . . . . . 9 ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
13123expa 1136 . . . . . . . 8 (((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
1413ralrimiva 3155 . . . . . . 7 ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) → ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
158, 14jca 521 . . . . . 6 ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) → (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
1615ralrimiva 3155 . . . . 5 (𝑥 ∈ 𝑋 → ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
174, 16jca 521 . . . 4 (𝑥 ∈ 𝑋 → ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
1817rgen 3079 . . 3 ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
19 ablogrpo 31142 . . . . . 6 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
202, 19ax-mp 5 . . . . 5 𝐺 ∈ GrpOp
21 isvciOLD.2 . . . . 5 dom 𝐺 = (𝑋 × 𝑋)
2220, 21grporn 31116 . . . 4 𝑋 = ran 𝐺
2322isvcOLD 31174 . . 3 (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
242, 3, 18, 23mpbir3an 1360 . 2 ⟨𝐺, 𝑆⟩ ∈ CVecOLD
251, 24eqeltri 2857 1 𝑊 ∈ CVecOLD
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ⟨cop 4590   × cxp 5649  dom cdm 5651  ⟶wf 6533  (class class class)co 7418  ℂcc 11191  1c1 11194   + caddc 11196   · cmul 11198  GrpOpcgr 31084  AbelOpcablo 31139  CVecOLDcvc 31153
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-grpo 31088  df-ablo 31140  df-vc 31154
This theorem is used by:  cncvcOLD  31178  hilvc  31757  hhssnv  31859
  Copyright terms: Public domain W3C validator