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

Theorem cnopc 30275
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 30219 . . . 4 (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤)))
21simprbi 497 . . 3 (𝑇 ∈ ContOp → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤))
3 oveq2 7283 . . . . . . . 8 (𝑧 = 𝐴 → (𝑦 𝑧) = (𝑦 𝐴))
43fveq2d 6778 . . . . . . 7 (𝑧 = 𝐴 → (norm‘(𝑦 𝑧)) = (norm‘(𝑦 𝐴)))
54breq1d 5084 . . . . . 6 (𝑧 = 𝐴 → ((norm‘(𝑦 𝑧)) < 𝑥 ↔ (norm‘(𝑦 𝐴)) < 𝑥))
6 fveq2 6774 . . . . . . . . 9 (𝑧 = 𝐴 → (𝑇𝑧) = (𝑇𝐴))
76oveq2d 7291 . . . . . . . 8 (𝑧 = 𝐴 → ((𝑇𝑦) − (𝑇𝑧)) = ((𝑇𝑦) − (𝑇𝐴)))
87fveq2d 6778 . . . . . . 7 (𝑧 = 𝐴 → (norm‘((𝑇𝑦) − (𝑇𝑧))) = (norm‘((𝑇𝑦) − (𝑇𝐴))))
98breq1d 5084 . . . . . 6 (𝑧 = 𝐴 → ((norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤 ↔ (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤))
105, 9imbi12d 345 . . . . 5 (𝑧 = 𝐴 → (((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
1110rexralbidv 3230 . . . 4 (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
12 breq2 5078 . . . . . 6 (𝑤 = 𝐵 → ((norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤 ↔ (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
1312imbi2d 341 . . . . 5 (𝑤 = 𝐵 → (((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1413rexralbidv 3230 . . . 4 (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1511, 14rspc2v 3570 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
162, 15syl5com 31 . 2 (𝑇 ∈ ContOp → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
17163impib 1115 1 ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (norm‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  wrex 3065   class class class wbr 5074  wf 6429  cfv 6433  (class class class)co 7275   < clt 11009  +crp 12730  chba 29281  normcno 29285   cmv 29287  ContOpccop 29308
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-hilex 29361
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-map 8617  df-cnop 30202
This theorem is referenced by:  nmcopexi  30389
  Copyright terms: Public domain W3C validator