HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  cnopc Structured version   Visualization version   GIF version

Theorem cnopc 29692
Description: Basic continuity property of a continuous Hilbert space operator. (Contributed by NM, 2-Feb-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Assertion
Ref Expression
cnopc ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑇,𝑦

Proof of Theorem cnopc
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elcnop 29636 . . . 4 (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤)))
21simprbi 499 . . 3 (𝑇 ∈ ContOp → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤))
3 oveq2 7166 . . . . . . . 8 (𝑧 = 𝐴 → (𝑦 𝑧) = (𝑦 𝐴))
43fveq2d 6676 . . . . . . 7 (𝑧 = 𝐴 → (norm‘(𝑦 𝑧)) = (norm‘(𝑦 𝐴)))
54breq1d 5078 . . . . . 6 (𝑧 = 𝐴 → ((norm‘(𝑦 𝑧)) < 𝑥 ↔ (norm‘(𝑦 𝐴)) < 𝑥))
6 fveq2 6672 . . . . . . . . 9 (𝑧 = 𝐴 → (𝑇𝑧) = (𝑇𝐴))
76oveq2d 7174 . . . . . . . 8 (𝑧 = 𝐴 → ((𝑇𝑦) − (𝑇𝑧)) = ((𝑇𝑦) − (𝑇𝐴)))
87fveq2d 6676 . . . . . . 7 (𝑧 = 𝐴 → (norm‘((𝑇𝑦) − (𝑇𝑧))) = (norm‘((𝑇𝑦) − (𝑇𝐴))))
98breq1d 5078 . . . . . 6 (𝑧 = 𝐴 → ((norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤 ↔ (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤))
105, 9imbi12d 347 . . . . 5 (𝑧 = 𝐴 → (((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
1110rexralbidv 3303 . . . 4 (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
12 breq2 5072 . . . . . 6 (𝑤 = 𝐵 → ((norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤 ↔ (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
1312imbi2d 343 . . . . 5 (𝑤 = 𝐵 → (((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1413rexralbidv 3303 . . . 4 (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1511, 14rspc2v 3635 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
162, 15syl5com 31 . 2 (𝑇 ∈ ContOp → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
17163impib 1112 1 ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3140  wrex 3141   class class class wbr 5068  wf 6353  cfv 6357  (class class class)co 7158   < clt 10677  +crp 12392  chba 28698  normcno 28702   cmv 28704  ContOpccop 28725
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-hilex 28778
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-map 8410  df-cnop 29619
This theorem is referenced by:  nmcopexi  29806
  Copyright terms: Public domain W3C validator