Theorem nvi 30774

Description: The properties of a normed complex vector space, which is a vector space accompanied by a norm. (Contributed by NM, 11-Nov-2006.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nvi.1	⊢ 𝑋 = (BaseSet‘𝑈)
nvi.2	⊢ 𝐺 = ( +𝑣 ‘𝑈)
nvi.4	⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
nvi.5	⊢ 𝑍 = (0vec‘𝑈)
nvi.6	⊢ 𝑁 = (normCV‘𝑈)

Assertion

Ref	Expression
nvi	⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))

Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑁,𝑦   𝑥,𝑈   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦

Allowed substitution hints:   𝑈(𝑦)   𝑍(𝑥,𝑦)

Proof of Theorem nvi

Step	Hyp	Ref	Expression
1		eqid 2761	. . . . . 6 ⊢ (1st ‘𝑈) = (1st ‘𝑈)
2		nvi.6	. . . . . 6 ⊢ 𝑁 = (normCV‘𝑈)
3	1, 2	nvop2 30768	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st ‘𝑈), 𝑁⟩)
4		nvi.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
5		nvi.4	. . . . . . 7 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
6	1, 4, 5	nvvop 30769	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (1st ‘𝑈) = ⟨𝐺, 𝑆⟩)
7	6	opeq1d 4834	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → ⟨(1st ‘𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
8	3, 7	eqtrd 2796	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9		id 22	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
10	8, 9	eqeltrrd 2862	. . 3 ⊢ (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11		nvi.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
12	11, 4	bafval 30764	. . . 4 ⊢ 𝑋 = ran 𝐺
13		eqid 2761	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
14	12, 13	isnv 30772	. . 3 ⊢ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
15	10, 14	sylib 220	. 2 ⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
16		nvi.5	. . . . . . . 8 ⊢ 𝑍 = (0vec‘𝑈)
17	4, 16	0vfval 30766	. . . . . . 7 ⊢ (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
18	17	eqeq2d 2772	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑥 = 𝑍 ↔ 𝑥 = (GId‘𝐺)))
19	18	imbi2d 342	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20	19	3anbi1d 1460	. . . 4 ⊢ (𝑈 ∈ NrmCVec → ((((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
21	20	ralbidv 3184	. . 3 ⊢ (𝑈 ∈ NrmCVec → (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
22	21	3anbi3d 1462	. 2 ⊢ (𝑈 ∈ NrmCVec → ((⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))
23	15, 22	mpbird 259	1 ⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))

Syntax hints:   → wi 4   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ⟨cop 4585   class class class wbr 5097  ⟶wf 6512  ‘cfv 6516  (class class class)co 7391  1^st c1st 7963  ℂcc 11065  ℝcr 11066  0cc0 11067   + caddc 11070   · cmul 11072   ≤ cle 11211  abscabs 15252  GIdcgi 30650  CVec_OLDcvc 30718  NrmCVeccnv 30744   +_𝑣 cpv 30745  BaseSetcba 30746   ·_𝑠OLD cns 30747  0_veccn0v 30748  norm_CVcnmcv 30750

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-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7713

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-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7394  df-oprab 7395  df-1st 7965  df-2nd 7966  df-vc 30719  df-nv 30752  df-va 30755  df-ba 30756  df-sm 30757  df-0v 30758  df-nmcv 30760

This theorem is referenced by:  nvvc  30775  nvf  30820  nvs  30823  nvz  30829  nvtri  30830