Theorem nvi 30966

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 2763	. . . . . 6 ⊢ (1st ‘𝑈) = (1st ‘𝑈)
2		nvi.6	. . . . . 6 ⊢ 𝑁 = (normCV‘𝑈)
3	1, 2	nvop2 30960	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st ‘𝑈), 𝑁⟩)
4		nvi.2	. . . . . . 7 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
5		nvi.4	. . . . . . 7 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
6	1, 4, 5	nvvop 30961	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (1st ‘𝑈) = ⟨𝐺, 𝑆⟩)
7	6	opeq1d 4844	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → ⟨(1st ‘𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
8	3, 7	eqtrd 2798	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9		id 23	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
10	8, 9	eqeltrrd 2864	. . 3 ⊢ (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11		nvi.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
12	11, 4	bafval 30956	. . . 4 ⊢ 𝑋 = ran 𝐺
13		eqid 2763	. . . 4 ⊢ (GId‘𝐺) = (GId‘𝐺)
14	12, 13	isnv 30964	. . 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 30958	. . . . . . 7 ⊢ (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
18	17	eqeq2d 2774	. . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑥 = 𝑍 ↔ 𝑥 = (GId‘𝐺)))
19	18	imbi2d 343	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20	19	3anbi1d 1468	. . . 4 ⊢ (𝑈 ∈ NrmCVec → ((((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
21	20	ralbidv 3188	. . 3 ⊢ (𝑈 ∈ NrmCVec → (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) ↔ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))
22	21	3anbi3d 1470	. 2 ⊢ (𝑈 ∈ NrmCVec → ((⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))))
23	15, 22	mpbird 260	1 ⊢ (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))))

Syntax hints:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ⟨cop 4595   class class class wbr 5109  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  1^st c1st 7980  ℂcc 11093  ℝcr 11094  0cc0 11095   + caddc 11098   · cmul 11100   ≤ cle 11239  abscabs 15281  GIdcgi 30842  CVec_OLDcvc 30910  NrmCVeccnv 30936   +_𝑣 cpv 30937  BaseSetcba 30938   ·_𝑠OLD cns 30939  0_veccn0v 30940  norm_CVcnmcv 30942

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-1st 7982  df-2nd 7983  df-vc 30911  df-nv 30944  df-va 30947  df-ba 30948  df-sm 30949  df-0v 30950  df-nmcv 30952

This theorem is referenced by:  nvvc  30967  nvf  31012  nvs  31015  nvz  31021  nvtri  31022