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

Theorem nvi 28394
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
StepHypRef Expression
1 eqid 2824 . . . . . 6 (1st𝑈) = (1st𝑈)
2 nvi.6 . . . . . 6 𝑁 = (normCV𝑈)
31, 2nvop2 28388 . . . . 5 (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st𝑈), 𝑁⟩)
4 nvi.2 . . . . . . 7 𝐺 = ( +𝑣𝑈)
5 nvi.4 . . . . . . 7 𝑆 = ( ·𝑠OLD𝑈)
61, 4, 5nvvop 28389 . . . . . 6 (𝑈 ∈ NrmCVec → (1st𝑈) = ⟨𝐺, 𝑆⟩)
76opeq1d 4812 . . . . 5 (𝑈 ∈ NrmCVec → ⟨(1st𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
83, 7eqtrd 2859 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9 id 22 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
108, 9eqeltrrd 2917 . . 3 (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11 nvi.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
1211, 4bafval 28384 . . . 4 𝑋 = ran 𝐺
13 eqid 2824 . . . 4 (GId‘𝐺) = (GId‘𝐺)
1412, 13isnv 28392 . . 3 (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
1510, 14sylib 220 . 2 (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
16 nvi.5 . . . . . . . 8 𝑍 = (0vec𝑈)
174, 160vfval 28386 . . . . . . 7 (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
1817eqeq2d 2835 . . . . . 6 (𝑈 ∈ NrmCVec → (𝑥 = 𝑍𝑥 = (GId‘𝐺)))
1918imbi2d 343 . . . . 5 (𝑈 ∈ NrmCVec → (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20193anbi1d 1436 . . . 4 (𝑈 ∈ NrmCVec → ((((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
2120ralbidv 3200 . . 3 (𝑈 ∈ NrmCVec → (∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
22213anbi3d 1438 . 2 (𝑈 ∈ NrmCVec → ((⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))) ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))))))
2315, 22mpbird 259 1 (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1083   = wceq 1536  wcel 2113  wral 3141  cop 4576   class class class wbr 5069  wf 6354  cfv 6358  (class class class)co 7159  1st c1st 7690  cc 10538  cr 10539  0cc0 10540   + caddc 10543   · cmul 10545  cle 10679  abscabs 14596  GIdcgi 28270  CVecOLDcvc 28338  NrmCVeccnv 28364   +𝑣 cpv 28365  BaseSetcba 28366   ·𝑠OLD cns 28367  0veccn0v 28368  normCVcnmcv 28370
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7162  df-oprab 7163  df-1st 7692  df-2nd 7693  df-vc 28339  df-nv 28372  df-va 28375  df-ba 28376  df-sm 28377  df-0v 28378  df-nmcv 28380
This theorem is referenced by:  nvvc  28395  nvf  28440  nvs  28443  nvz  28449  nvtri  28450
  Copyright terms: Public domain W3C validator