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

Theorem isvclem 30513
Description: Lemma for isvcOLD 30515. (Contributed by NM, 31-May-2008.) (New usage is discouraged.)
Hypothesis
Ref Expression
isvclem.1 𝑋 = ran 𝐺
Assertion
Ref Expression
isvclem ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝑆,𝑦,𝑧   𝑥,𝑋,𝑧
Allowed substitution hint:   𝑋(𝑦)

Proof of Theorem isvclem
Dummy variables 𝑔 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-vc 30495 . . 3 CVecOLD = {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))}
21eleq2i 2821 . 2 (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ ⟨𝐺, 𝑆⟩ ∈ {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))})
3 eleq1 2817 . . . 4 (𝑔 = 𝐺 → (𝑔 ∈ AbelOp ↔ 𝐺 ∈ AbelOp))
4 rneq 5903 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
5 isvclem.1 . . . . . 6 𝑋 = ran 𝐺
64, 5eqtr4di 2783 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
7 xpeq2 5662 . . . . . . 7 (ran 𝑔 = 𝑋 → (ℂ × ran 𝑔) = (ℂ × 𝑋))
87feq2d 6675 . . . . . 6 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶ran 𝑔))
9 feq3 6671 . . . . . 6 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × 𝑋)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
108, 9bitrd 279 . . . . 5 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
116, 10syl 17 . . . 4 (𝑔 = 𝐺 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
12 oveq 7396 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑥𝑔𝑧) = (𝑥𝐺𝑧))
1312oveq2d 7406 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑦𝑠(𝑥𝑔𝑧)) = (𝑦𝑠(𝑥𝐺𝑧)))
14 oveq 7396 . . . . . . . . . 10 (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)))
1513, 14eqeq12d 2746 . . . . . . . . 9 (𝑔 = 𝐺 → ((𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
166, 15raleqbidv 3321 . . . . . . . 8 (𝑔 = 𝐺 → (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ ∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
17 oveq 7396 . . . . . . . . . . 11 (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)))
1817eqeq2d 2741 . . . . . . . . . 10 (𝑔 = 𝐺 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥))))
1918anbi1d 631 . . . . . . . . 9 (𝑔 = 𝐺 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
2019ralbidv 3157 . . . . . . . 8 (𝑔 = 𝐺 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
2116, 20anbi12d 632 . . . . . . 7 (𝑔 = 𝐺 → ((∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
2221ralbidv 3157 . . . . . 6 (𝑔 = 𝐺 → (∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
2322anbi2d 630 . . . . 5 (𝑔 = 𝐺 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
246, 23raleqbidv 3321 . . . 4 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
253, 11, 243anbi123d 1438 . . 3 (𝑔 = 𝐺 → ((𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))))
26 feq1 6669 . . . 4 (𝑠 = 𝑆 → (𝑠:(ℂ × 𝑋)⟶𝑋𝑆:(ℂ × 𝑋)⟶𝑋))
27 oveq 7396 . . . . . . 7 (𝑠 = 𝑆 → (1𝑠𝑥) = (1𝑆𝑥))
2827eqeq1d 2732 . . . . . 6 (𝑠 = 𝑆 → ((1𝑠𝑥) = 𝑥 ↔ (1𝑆𝑥) = 𝑥))
29 oveq 7396 . . . . . . . . . 10 (𝑠 = 𝑆 → (𝑦𝑠(𝑥𝐺𝑧)) = (𝑦𝑆(𝑥𝐺𝑧)))
30 oveq 7396 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠𝑥) = (𝑦𝑆𝑥))
31 oveq 7396 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠𝑧) = (𝑦𝑆𝑧))
3230, 31oveq12d 7408 . . . . . . . . . 10 (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
3329, 32eqeq12d 2746 . . . . . . . . 9 (𝑠 = 𝑆 → ((𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
3433ralbidv 3157 . . . . . . . 8 (𝑠 = 𝑆 → (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
35 oveq 7396 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦 + 𝑧)𝑆𝑥))
36 oveq 7396 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑧𝑠𝑥) = (𝑧𝑆𝑥))
3730, 36oveq12d 7408 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
3835, 37eqeq12d 2746 . . . . . . . . . 10 (𝑠 = 𝑆 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥))))
39 oveq 7396 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦 · 𝑧)𝑠𝑥) = ((𝑦 · 𝑧)𝑆𝑥))
40 oveq 7396 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑠𝑥)))
4136oveq2d 7406 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑦𝑆(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
4240, 41eqtrd 2765 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
4339, 42eqeq12d 2746 . . . . . . . . . 10 (𝑠 = 𝑆 → (((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
4438, 43anbi12d 632 . . . . . . . . 9 (𝑠 = 𝑆 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
4544ralbidv 3157 . . . . . . . 8 (𝑠 = 𝑆 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
4634, 45anbi12d 632 . . . . . . 7 (𝑠 = 𝑆 → ((∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
4746ralbidv 3157 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
4828, 47anbi12d 632 . . . . 5 (𝑠 = 𝑆 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
4948ralbidv 3157 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5026, 493anbi23d 1441 . . 3 (𝑠 = 𝑆 → ((𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
5125, 50opelopabg 5501 . 2 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (⟨𝐺, 𝑆⟩ ∈ {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))} ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
522, 51bitrid 283 1 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3045  Vcvv 3450  cop 4598  {copab 5172   × cxp 5639  ran crn 5642  wf 6510  (class class class)co 7390  cc 11073  1c1 11076   + caddc 11078   · cmul 11080  AbelOpcablo 30480  CVecOLDcvc 30494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-ov 7393  df-vc 30495
This theorem is referenced by:  isvcOLD  30515
  Copyright terms: Public domain W3C validator