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

Theorem cnfnc 29120
Description: Basic continuity property of a continuous functional. (Contributed by NM, 11-Feb-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Assertion
Ref Expression
cnfnc ((𝑇 ∈ ContFn ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑇,𝑦

Proof of Theorem cnfnc
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elcnfn 29072 . . . 4 (𝑇 ∈ ContFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤)))
21simprbi 483 . . 3 (𝑇 ∈ ContFn → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤))
3 oveq2 6823 . . . . . . . 8 (𝑧 = 𝐴 → (𝑦 𝑧) = (𝑦 𝐴))
43fveq2d 6358 . . . . . . 7 (𝑧 = 𝐴 → (norm‘(𝑦 𝑧)) = (norm‘(𝑦 𝐴)))
54breq1d 4815 . . . . . 6 (𝑧 = 𝐴 → ((norm‘(𝑦 𝑧)) < 𝑥 ↔ (norm‘(𝑦 𝐴)) < 𝑥))
6 fveq2 6354 . . . . . . . . 9 (𝑧 = 𝐴 → (𝑇𝑧) = (𝑇𝐴))
76oveq2d 6831 . . . . . . . 8 (𝑧 = 𝐴 → ((𝑇𝑦) − (𝑇𝑧)) = ((𝑇𝑦) − (𝑇𝐴)))
87fveq2d 6358 . . . . . . 7 (𝑧 = 𝐴 → (abs‘((𝑇𝑦) − (𝑇𝑧))) = (abs‘((𝑇𝑦) − (𝑇𝐴))))
98breq1d 4815 . . . . . 6 (𝑧 = 𝐴 → ((abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤 ↔ (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤))
105, 9imbi12d 333 . . . . 5 (𝑧 = 𝐴 → (((norm‘(𝑦 𝑧)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
1110rexralbidv 3197 . . . 4 (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤)))
12 breq2 4809 . . . . . 6 (𝑤 = 𝐵 → ((abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤 ↔ (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
1312imbi2d 329 . . . . 5 (𝑤 = 𝐵 → (((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1413rexralbidv 3197 . . . 4 (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
1511, 14rspc2v 3462 . . 3 ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝑧)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
162, 15syl5com 31 . 2 (𝑇 ∈ ContFn → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵)))
17163impib 1109 1 ((𝑇 ∈ ContFn ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+𝑦 ∈ ℋ ((norm‘(𝑦 𝐴)) < 𝑥 → (abs‘((𝑇𝑦) − (𝑇𝐴))) < 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1072   = wceq 1632  wcel 2140  wral 3051  wrex 3052   class class class wbr 4805  wf 6046  cfv 6050  (class class class)co 6815  cc 10147   < clt 10287  cmin 10479  +crp 12046  abscabs 14194  chil 28107  normcno 28111   cmv 28113  ContFnccnfn 28141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-8 2142  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741  ax-sep 4934  ax-nul 4942  ax-pow 4993  ax-pr 5056  ax-un 7116  ax-cnex 10205  ax-hilex 28187
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-eu 2612  df-mo 2613  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3343  df-sbc 3578  df-dif 3719  df-un 3721  df-in 3723  df-ss 3730  df-nul 4060  df-if 4232  df-pw 4305  df-sn 4323  df-pr 4325  df-op 4329  df-uni 4590  df-br 4806  df-opab 4866  df-id 5175  df-xp 5273  df-rel 5274  df-cnv 5275  df-co 5276  df-dm 5277  df-rn 5278  df-iota 6013  df-fun 6052  df-fn 6053  df-f 6054  df-fv 6058  df-ov 6818  df-oprab 6819  df-mpt2 6820  df-map 8028  df-cnfn 29037
This theorem is referenced by:  nmcfnexi  29241
  Copyright terms: Public domain W3C validator