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

Theorem nvss 26832
Description: Structure of the class of all normed complex vectors spaces. (Contributed by NM, 28-Nov-2006.) (Revised by Mario Carneiro, 1-May-2015.) (New usage is discouraged.)
Assertion
Ref Expression
nvss NrmCVec ⊆ (CVecOLD × V)

Proof of Theorem nvss
Dummy variables 𝑔 𝑠 𝑛 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2676 . . . . . . 7 (𝑤 = ⟨𝑔, 𝑠⟩ → (𝑤 ∈ CVecOLD ↔ ⟨𝑔, 𝑠⟩ ∈ CVecOLD))
21biimpar 501 . . . . . 6 ((𝑤 = ⟨𝑔, 𝑠⟩ ∧ ⟨𝑔, 𝑠⟩ ∈ CVecOLD) → 𝑤 ∈ CVecOLD)
323ad2antr1 1219 . . . . 5 ((𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦))))) → 𝑤 ∈ CVecOLD)
43exlimivv 1847 . . . 4 (∃𝑔𝑠(𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦))))) → 𝑤 ∈ CVecOLD)
5 vex 3176 . . . 4 𝑛 ∈ V
64, 5jctir 559 . . 3 (∃𝑔𝑠(𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦))))) → (𝑤 ∈ CVecOLD𝑛 ∈ V))
76ssopab2i 4928 . 2 {⟨𝑤, 𝑛⟩ ∣ ∃𝑔𝑠(𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦)))))} ⊆ {⟨𝑤, 𝑛⟩ ∣ (𝑤 ∈ CVecOLD𝑛 ∈ V)}
8 df-nv 26831 . . 3 NrmCVec = {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦))))}
9 dfoprab2 6599 . . 3 {⟨⟨𝑔, 𝑠⟩, 𝑛⟩ ∣ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦))))} = {⟨𝑤, 𝑛⟩ ∣ ∃𝑔𝑠(𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦)))))}
108, 9eqtri 2632 . 2 NrmCVec = {⟨𝑤, 𝑛⟩ ∣ ∃𝑔𝑠(𝑤 = ⟨𝑔, 𝑠⟩ ∧ (⟨𝑔, 𝑠⟩ ∈ CVecOLD𝑛:ran 𝑔⟶ℝ ∧ ∀𝑥 ∈ ran 𝑔(((𝑛𝑥) = 0 → 𝑥 = (GId‘𝑔)) ∧ ∀𝑦 ∈ ℂ (𝑛‘(𝑦𝑠𝑥)) = ((abs‘𝑦) · (𝑛𝑥)) ∧ ∀𝑦 ∈ ran 𝑔(𝑛‘(𝑥𝑔𝑦)) ≤ ((𝑛𝑥) + (𝑛𝑦)))))}
11 df-xp 5044 . 2 (CVecOLD × V) = {⟨𝑤, 𝑛⟩ ∣ (𝑤 ∈ CVecOLD𝑛 ∈ V)}
127, 10, 113sstr4i 3607 1 NrmCVec ⊆ (CVecOLD × V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031   = wceq 1475  wex 1695  wcel 1977  wral 2896  Vcvv 3173  wss 3540  cop 4131   class class class wbr 4583  {copab 4642   × cxp 5036  ran crn 5039  wf 5800  cfv 5804  (class class class)co 6549  {coprab 6550  cc 9813  cr 9814  0cc0 9815   + caddc 9818   · cmul 9820  cle 9954  abscabs 13822  GIdcgi 26728  CVecOLDcvc 26797  NrmCVeccnv 26823
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644  df-xp 5044  df-oprab 6553  df-nv 26831
This theorem is referenced by:  nvvcop  26833  nvrel  26841  nvvop  26848  nvex  26850
  Copyright terms: Public domain W3C validator