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

Theorem nvi 30703
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 2739 . . . . . 6 (1st𝑈) = (1st𝑈)
2 nvi.6 . . . . . 6 𝑁 = (normCV𝑈)
31, 2nvop2 30697 . . . . 5 (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st𝑈), 𝑁⟩)
4 nvi.2 . . . . . . 7 𝐺 = ( +𝑣𝑈)
5 nvi.4 . . . . . . 7 𝑆 = ( ·𝑠OLD𝑈)
61, 4, 5nvvop 30698 . . . . . 6 (𝑈 ∈ NrmCVec → (1st𝑈) = ⟨𝐺, 𝑆⟩)
76opeq1d 4810 . . . . 5 (𝑈 ∈ NrmCVec → ⟨(1st𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
83, 7eqtrd 2774 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9 id 22 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
108, 9eqeltrrd 2840 . . 3 (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11 nvi.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
1211, 4bafval 30693 . . . 4 𝑋 = ran 𝐺
13 eqid 2739 . . . 4 (GId‘𝐺) = (GId‘𝐺)
1412, 13isnv 30701 . . 3 (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
1510, 14sylib 219 . 2 (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
16 nvi.5 . . . . . . . 8 𝑍 = (0vec𝑈)
174, 160vfval 30695 . . . . . . 7 (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
1817eqeq2d 2750 . . . . . 6 (𝑈 ∈ NrmCVec → (𝑥 = 𝑍𝑥 = (GId‘𝐺)))
1918imbi2d 341 . . . . 5 (𝑈 ∈ NrmCVec → (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20193anbi1d 1448 . . . 4 (𝑈 ∈ NrmCVec → ((((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
2120ralbidv 3162 . . 3 (𝑈 ∈ NrmCVec → (∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
22213anbi3d 1450 . 2 (𝑈 ∈ NrmCVec → ((⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))) ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))))))
2315, 22mpbird 258 1 (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1092   = wceq 1547  wcel 2119  wral 3053  cop 4561   class class class wbr 5072  wf 6481  cfv 6485  (class class class)co 7356  1st c1st 7929  cc 11027  cr 11028  0cc0 11029   + caddc 11032   · cmul 11034  cle 11171  abscabs 15187  GIdcgi 30579  CVecOLDcvc 30647  NrmCVeccnv 30673   +𝑣 cpv 30674  BaseSetcba 30675   ·𝑠OLD cns 30676  0veccn0v 30677  normCVcnmcv 30679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-1st 7931  df-2nd 7932  df-vc 30648  df-nv 30681  df-va 30684  df-ba 30685  df-sm 30686  df-0v 30687  df-nmcv 30689
This theorem is referenced by:  nvvc  30704  nvf  30749  nvs  30752  nvz  30758  nvtri  30759
  Copyright terms: Public domain W3C validator