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

Theorem nvi 30752
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 2752 . . . . . 6 (1st𝑈) = (1st𝑈)
2 nvi.6 . . . . . 6 𝑁 = (normCV𝑈)
31, 2nvop2 30746 . . . . 5 (𝑈 ∈ NrmCVec → 𝑈 = ⟨(1st𝑈), 𝑁⟩)
4 nvi.2 . . . . . . 7 𝐺 = ( +𝑣𝑈)
5 nvi.4 . . . . . . 7 𝑆 = ( ·𝑠OLD𝑈)
61, 4, 5nvvop 30747 . . . . . 6 (𝑈 ∈ NrmCVec → (1st𝑈) = ⟨𝐺, 𝑆⟩)
76opeq1d 4827 . . . . 5 (𝑈 ∈ NrmCVec → ⟨(1st𝑈), 𝑁⟩ = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
83, 7eqtrd 2787 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 = ⟨⟨𝐺, 𝑆⟩, 𝑁⟩)
9 id 22 . . . 4 (𝑈 ∈ NrmCVec → 𝑈 ∈ NrmCVec)
108, 9eqeltrrd 2853 . . 3 (𝑈 ∈ NrmCVec → ⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec)
11 nvi.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
1211, 4bafval 30742 . . . 4 𝑋 = ran 𝐺
13 eqid 2752 . . . 4 (GId‘𝐺) = (GId‘𝐺)
1412, 13isnv 30750 . . 3 (⟨⟨𝐺, 𝑆⟩, 𝑁⟩ ∈ NrmCVec ↔ (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
1510, 14sylib 220 . 2 (𝑈 ∈ NrmCVec → (⟨𝐺, 𝑆⟩ ∈ CVecOLD𝑁:𝑋⟶ℝ ∧ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
16 nvi.5 . . . . . . . 8 𝑍 = (0vec𝑈)
174, 160vfval 30744 . . . . . . 7 (𝑈 ∈ NrmCVec → 𝑍 = (GId‘𝐺))
1817eqeq2d 2763 . . . . . 6 (𝑈 ∈ NrmCVec → (𝑥 = 𝑍𝑥 = (GId‘𝐺)))
1918imbi2d 342 . . . . 5 (𝑈 ∈ NrmCVec → (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺))))
20193anbi1d 1451 . . . 4 (𝑈 ∈ NrmCVec → ((((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
2120ralbidv 3175 . . 3 (𝑈 ∈ NrmCVec → (∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦))) ↔ ∀𝑥𝑋 (((𝑁𝑥) = 0 → 𝑥 = (GId‘𝐺)) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁𝑥)) ∧ ∀𝑦𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁𝑥) + (𝑁𝑦)))))
22213anbi3d 1453 . 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 1095   = wceq 1550  wcel 2132  wral 3066  cop 4578   class class class wbr 5090  wf 6502  cfv 6506  (class class class)co 7381  1st c1st 7953  cc 11057  cr 11058  0cc0 11059   + caddc 11062   · cmul 11064  cle 11203  abscabs 15233  GIdcgi 30628  CVecOLDcvc 30696  NrmCVeccnv 30722   +𝑣 cpv 30723  BaseSetcba 30724   ·𝑠OLD cns 30725  0veccn0v 30726  normCVcnmcv 30728
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pr 5380  ax-un 7703
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-ov 7384  df-oprab 7385  df-1st 7955  df-2nd 7956  df-vc 30697  df-nv 30730  df-va 30733  df-ba 30734  df-sm 30735  df-0v 30736  df-nmcv 30738
This theorem is referenced by:  nvvc  30753  nvf  30798  nvs  30801  nvz  30807  nvtri  30808
  Copyright terms: Public domain W3C validator