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

Theorem isvclem 29047
Description: Lemma for isvcOLD 29049. (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 29029 . . 3 CVecOLD = {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))}
21eleq2i 2829 . 2 (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ ⟨𝐺, 𝑆⟩ ∈ {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))})
3 eleq1 2825 . . . 4 (𝑔 = 𝐺 → (𝑔 ∈ AbelOp ↔ 𝐺 ∈ AbelOp))
4 rneq 5862 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
5 isvclem.1 . . . . . 6 𝑋 = ran 𝐺
64, 5eqtr4di 2795 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
7 xpeq2 5626 . . . . . . 7 (ran 𝑔 = 𝑋 → (ℂ × ran 𝑔) = (ℂ × 𝑋))
87feq2d 6621 . . . . . 6 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶ran 𝑔))
9 feq3 6618 . . . . . 6 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × 𝑋)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
108, 9bitrd 278 . . . . 5 (ran 𝑔 = 𝑋 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
116, 10syl 17 . . . 4 (𝑔 = 𝐺 → (𝑠:(ℂ × ran 𝑔)⟶ran 𝑔𝑠:(ℂ × 𝑋)⟶𝑋))
12 oveq 7319 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑥𝑔𝑧) = (𝑥𝐺𝑧))
1312oveq2d 7329 . . . . . . . . . 10 (𝑔 = 𝐺 → (𝑦𝑠(𝑥𝑔𝑧)) = (𝑦𝑠(𝑥𝐺𝑧)))
14 oveq 7319 . . . . . . . . . 10 (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)))
1513, 14eqeq12d 2753 . . . . . . . . 9 (𝑔 = 𝐺 → ((𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
166, 15raleqbidv 3316 . . . . . . . 8 (𝑔 = 𝐺 → (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ↔ ∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧))))
17 oveq 7319 . . . . . . . . . . 11 (𝑔 = 𝐺 → ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)))
1817eqeq2d 2748 . . . . . . . . . 10 (𝑔 = 𝐺 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥))))
1918anbi1d 630 . . . . . . . . 9 (𝑔 = 𝐺 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
2019ralbidv 3171 . . . . . . . 8 (𝑔 = 𝐺 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))
2116, 20anbi12d 631 . . . . . . 7 (𝑔 = 𝐺 → ((∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
2221ralbidv 3171 . . . . . 6 (𝑔 = 𝐺 → (∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))
2322anbi2d 629 . . . . 5 (𝑔 = 𝐺 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
246, 23raleqbidv 3316 . . . 4 (𝑔 = 𝐺 → (∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))))
253, 11, 243anbi123d 1435 . . 3 (𝑔 = 𝐺 → ((𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))))
26 feq1 6616 . . . 4 (𝑠 = 𝑆 → (𝑠:(ℂ × 𝑋)⟶𝑋𝑆:(ℂ × 𝑋)⟶𝑋))
27 oveq 7319 . . . . . . 7 (𝑠 = 𝑆 → (1𝑠𝑥) = (1𝑆𝑥))
2827eqeq1d 2739 . . . . . 6 (𝑠 = 𝑆 → ((1𝑠𝑥) = 𝑥 ↔ (1𝑆𝑥) = 𝑥))
29 oveq 7319 . . . . . . . . . 10 (𝑠 = 𝑆 → (𝑦𝑠(𝑥𝐺𝑧)) = (𝑦𝑆(𝑥𝐺𝑧)))
30 oveq 7319 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠𝑥) = (𝑦𝑆𝑥))
31 oveq 7319 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠𝑧) = (𝑦𝑆𝑧))
3230, 31oveq12d 7331 . . . . . . . . . 10 (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)))
3329, 32eqeq12d 2753 . . . . . . . . 9 (𝑠 = 𝑆 → ((𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
3433ralbidv 3171 . . . . . . . 8 (𝑠 = 𝑆 → (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ↔ ∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧))))
35 oveq 7319 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦 + 𝑧)𝑠𝑥) = ((𝑦 + 𝑧)𝑆𝑥))
36 oveq 7319 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑧𝑠𝑥) = (𝑧𝑆𝑥))
3730, 36oveq12d 7331 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)))
3835, 37eqeq12d 2753 . . . . . . . . . 10 (𝑠 = 𝑆 → (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ↔ ((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥))))
39 oveq 7319 . . . . . . . . . . 11 (𝑠 = 𝑆 → ((𝑦 · 𝑧)𝑠𝑥) = ((𝑦 · 𝑧)𝑆𝑥))
40 oveq 7319 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑠𝑥)))
4136oveq2d 7329 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (𝑦𝑆(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
4240, 41eqtrd 2777 . . . . . . . . . . 11 (𝑠 = 𝑆 → (𝑦𝑠(𝑧𝑠𝑥)) = (𝑦𝑆(𝑧𝑆𝑥)))
4339, 42eqeq12d 2753 . . . . . . . . . 10 (𝑠 = 𝑆 → (((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)) ↔ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))
4438, 43anbi12d 631 . . . . . . . . 9 (𝑠 = 𝑆 → ((((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
4544ralbidv 3171 . . . . . . . 8 (𝑠 = 𝑆 → (∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))) ↔ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))
4634, 45anbi12d 631 . . . . . . 7 (𝑠 = 𝑆 → ((∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
4746ralbidv 3171 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))) ↔ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))
4828, 47anbi12d 631 . . . . 5 (𝑠 = 𝑆 → (((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
4948ralbidv 3171 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))) ↔ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5026, 493anbi23d 1438 . . 3 (𝑠 = 𝑆 → ((𝐺 ∈ AbelOp ∧ 𝑠:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑠(𝑥𝐺𝑧)) = ((𝑦𝑠𝑥)𝐺(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝐺(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥)))))) ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
5125, 50opelopabg 5469 . 2 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (⟨𝐺, 𝑆⟩ ∈ {⟨𝑔, 𝑠⟩ ∣ (𝑔 ∈ AbelOp ∧ 𝑠:(ℂ × ran 𝑔)⟶ran 𝑔 ∧ ∀𝑥 ∈ ran 𝑔((1𝑠𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ ran 𝑔(𝑦𝑠(𝑥𝑔𝑧)) = ((𝑦𝑠𝑥)𝑔(𝑦𝑠𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑠𝑥) = ((𝑦𝑠𝑥)𝑔(𝑧𝑠𝑥)) ∧ ((𝑦 · 𝑧)𝑠𝑥) = (𝑦𝑠(𝑧𝑠𝑥))))))} ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
522, 51bitrid 282 1 ((𝐺 ∈ V ∧ 𝑆 ∈ V) → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ↔ (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wcel 2105  wral 3062  Vcvv 3441  cop 4575  {copab 5147   × cxp 5603  ran crn 5606  wf 6459  (class class class)co 7313  cc 10939  1c1 10942   + caddc 10944   · cmul 10946  AbelOpcablo 29014  CVecOLDcvc 29028
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2708  ax-sep 5236  ax-nul 5243  ax-pr 5365
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-sb 2067  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3063  df-rab 3405  df-v 3443  df-dif 3899  df-un 3901  df-in 3903  df-ss 3913  df-nul 4267  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4849  df-br 5086  df-opab 5148  df-xp 5611  df-rel 5612  df-cnv 5613  df-co 5614  df-dm 5615  df-rn 5616  df-iota 6415  df-fun 6465  df-fn 6466  df-f 6467  df-fv 6471  df-ov 7316  df-vc 29029
This theorem is referenced by:  isvcOLD  29049
  Copyright terms: Public domain W3C validator