Theorem nvi 30903

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 2769	. . . . . 6 ⊢ (1st ‘𝑈) = (1st ‘𝑈)
2		nvi.6	. . . . . 6 ⊢ 𝑁 = (normCV‘𝑈)
3	1, 2	nvop2 30897	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st ‘𝑈), 𝑁⟩)
4		nvi.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
5		nvi.4	. . . . . . 7 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
6	1, 4, 5	nvvop 30898	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (1st ‘𝑈) = ⟨𝐺, 𝑆⟩)
7	6	opeq1d 4845	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → ⟨(1st ‘𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
8	3, 7	eqtrd 2804	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9		id 23	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
10	8, 9	eqeltrrd 2870	. . 3 ⊢ (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11		nvi.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
12	11, 4	bafval 30893	. . . 4 ⊢ 𝑋 = ran 𝐺
13		eqid 2769	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
14	12, 13	isnv 30901	. . 3 ⊢ (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
15	10, 14	sylib 221	. 2 ⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
16		nvi.5	. . . . . . . 8 ⊢ 𝑍 = (0vec‘𝑈)
17	4, 16	0vfval 30895	. . . . . . 7 ⊢ (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
18	17	eqeq2d 2780	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑥 = 𝑍 ↔ 𝑥 = (GId‘𝐺)))
19	18	imbi2d 343	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20	19	3anbi1d 1466	. . . 4 ⊢ (𝑈 ∈ NrmCVec → ((((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
21	20	ralbidv 3194	. . 3 ⊢ (𝑈 ∈ NrmCVec → (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
22	21	3anbi3d 1468	. 2 ⊢ (𝑈 ∈ NrmCVec → ((⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))
23	15, 22	mpbird 260	1 ⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))

Syntax hints:   → wi 4   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085  ⟨cop 4597   class class class wbr 5110  ⟶wf 6530  ‘cfv 6534  (class class class)co 7408  1^st c1st 7980  ℂcc 11094  ℝcr 11095  0cc0 11096   + caddc 11099   · cmul 11101   ≤ cle 11240  abscabs 15281  GIdcgi 30779  CVec_OLDcvc 30847  NrmCVeccnv 30873   +_𝑣 cpv 30874  BaseSetcba 30875   ·_𝑠OLD cns 30876  0_veccn0v 30877  norm_CVcnmcv 30879

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-ov 7411  df-oprab 7412  df-1st 7982  df-2nd 7983  df-vc 30848  df-nv 30881  df-va 30884  df-ba 30885  df-sm 30886  df-0v 30887  df-nmcv 30889

This theorem is referenced by:  nvvc  30904  nvf  30949  nvs  30952  nvz  30958  nvtri  30959