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

Theorem isvciOLD 30913
Description: Properties that determine a complex vector space. (Contributed by NM, 5-Nov-2006.) Obsolete version of iscvsi 25269. (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 3157 . . . . . . 7 ((𝑥𝑋𝑦 ∈ ℂ) → ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
9 isvciOLD.6 . . . . . . . . . . 11 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥𝑋) → ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
10 isvciOLD.7 . . . . . . . . . . 11 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥𝑋) → ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))
119, 10jca 520 . . . . . . . . . 10 ((𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ ∧ 𝑥𝑋) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
12113comr 1143 . . . . . . . . 9 ((𝑥𝑋𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
13123expa 1136 . . . . . . . 8 (((𝑥𝑋𝑦 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
1413ralrimiva 3157 . . . . . . 7 ((𝑥𝑋𝑦 ∈ ℂ) → ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
158, 14jca 520 . . . . . 6 ((𝑥𝑋𝑦 ∈ ℂ) → (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
1615ralrimiva 3157 . . . . 5 (𝑥𝑋 → ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
174, 16jca 520 . . . 4 (𝑥𝑋 → ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
1817rgen 3081 . . 3 𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
19 ablogrpo 30880 . . . . . 6 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
202, 19ax-mp 5 . . . . 5 𝐺 ∈ GrpOp
21 isvciOLD.2 . . . . 5 dom 𝐺 = (𝑋 × 𝑋)
2220, 21grporn 30854 . . . 4 𝑋 = ran 𝐺
2322isvcOLD 30912 . . 3 (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
242, 3, 18, 23mpbir3an 1360 . 2 𝐺, 𝑆⟩ ∈ CVecOLD
251, 24eqeltri 2859 1 𝑊 ∈ CVecOLD
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  wral 3079  cop 4596   × cxp 5661  dom cdm 5663  wf 6534  (class class class)co 7412  cc 11099  1c1 11102   + caddc 11104   · cmul 11106  GrpOpcgr 30822  AbelOpcablo 30877  CVecOLDcvc 30891
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-cnex 11157
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-grpo 30826  df-ablo 30878  df-vc 30892
This theorem is referenced by:  cncvcOLD  30916  hilvc  31495  hhssnv  31597
  Copyright terms: Public domain W3C validator