vcidOLD - Metamath Proof Explorer

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

Theorem vcidOLD 30713

Description: Identity element for the scalar product of a complex vector space. (Contributed by NM, 3-Nov-2006.) Obsolete theorem, use clmvs1 25135 together with cvsclm 25168 instead. (New usage is discouraged.) (Proof modification is discouraged.)

**Hypotheses**
Ref	Expression
vciOLD.1	⊢ 𝐺 = (1^st ‘𝑊)
vciOLD.2	⊢ 𝑆 = (2^nd ‘𝑊)
vciOLD.3	⊢ 𝑋 = ran 𝐺

**Assertion**
Ref	Expression
vcidOLD	⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴)

Proof of Theorem vcidOLD Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vciOLD.1	. . . 4 ⊢ 𝐺 = (1^st ‘𝑊)
2		vciOLD.2	. . . 4 ⊢ 𝑆 = (2^nd ‘𝑊)
3		vciOLD.3	. . . 4 ⊢ 𝑋 = ran 𝐺
4	1, 2, 3	vciOLD 30710	. . 3 ⊢ (𝑊 ∈ CVec_OLD → (𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))))
5		simpl 486	. . . . 5 ⊢ (((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → (1𝑆𝑥) = 𝑥)
6	5	ralimi 3098	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥))))) → ∀𝑥 ∈ 𝑋 (1𝑆𝑥) = 𝑥)
7	6	3ad2ant3 1147	. . 3 ⊢ ((𝐺 ∈ AbelOp ∧ 𝑆:(ℂ × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ((1𝑆𝑥) = 𝑥 ∧ ∀𝑦 ∈ ℂ (∀𝑧 ∈ 𝑋 (𝑦𝑆(𝑥𝐺𝑧)) = ((𝑦𝑆𝑥)𝐺(𝑦𝑆𝑧)) ∧ ∀𝑧 ∈ ℂ (((𝑦 + 𝑧)𝑆𝑥) = ((𝑦𝑆𝑥)𝐺(𝑧𝑆𝑥)) ∧ ((𝑦 · 𝑧)𝑆𝑥) = (𝑦𝑆(𝑧𝑆𝑥)))))) → ∀𝑥 ∈ 𝑋 (1𝑆𝑥) = 𝑥)
8	4, 7	syl 17	. 2 ⊢ (𝑊 ∈ CVec_OLD → ∀𝑥 ∈ 𝑋 (1𝑆𝑥) = 𝑥)
9		oveq2 7400	. . . 4 ⊢ (𝑥 = 𝐴 → (1𝑆𝑥) = (1𝑆𝐴))
10		id 22	. . . 4 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
11	9, 10	eqeq12d 2777	. . 3 ⊢ (𝑥 = 𝐴 → ((1𝑆𝑥) = 𝑥 ↔ (1𝑆𝐴) = 𝐴))
12	11	rspccva 3580	. 2 ⊢ ((∀𝑥 ∈ 𝑋 (1𝑆𝑥) = 𝑥 ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴)
13	8, 12	sylan 589	1 ⊢ ((𝑊 ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∀wral 3075 × cxp 5643 ran crn 5646 ⟶wf 6513 ‘cfv 6517 (class class class)co 7392 1^st c1st 7964 2^nd c2nd 7965 ℂcc 11068 1c1 11071 + caddc 11073 · cmul 11075 AbelOpcablo 30693 CVec_OLDcvc 30707

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pr 5389 ax-un 7714

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-fv 6525 df-ov 7395 df-1st 7966 df-2nd 7967 df-vc 30708

This theorem is referenced by: vc2OLD 30717 vc0 30723 vcm 30725 nvsid 30776

W3C validator