Theorem cnfnc 32072

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.

Step	Hyp	Ref	Expression
1		elcnfn 32024	. . . 4 ⊢ (𝑇 ∈ ContFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤)))
2	1	simprbi 500	. . 3 ⊢ (𝑇 ∈ ContFn → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤))
3		oveq2 7393	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → (𝑦 −ℎ 𝑧) = (𝑦 −ℎ 𝐴))
4	3	fveq2d 6860	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘(𝑦 −ℎ 𝑧)) = (normℎ‘(𝑦 −ℎ 𝐴)))
5	4	breq1d 5104	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 ↔ (normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥))
6		fveq2 6856	. . . . . . . . 9 ⊢ (𝑧 = 𝐴 → (𝑇‘𝑧) = (𝑇‘𝐴))
7	6	oveq2d 7401	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → ((𝑇‘𝑦) − (𝑇‘𝑧)) = ((𝑇‘𝑦) − (𝑇‘𝐴)))
8	7	fveq2d 6860	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) = (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))))
9	8	breq1d 5104	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤 ↔ (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤))
10	5, 9	imbi12d 346	. . . . 5 ⊢ (𝑧 = 𝐴 → (((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤)))
11	10	rexralbidv 3222	. . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤)))
12		breq2 5098	. . . . . 6 ⊢ (𝑤 = 𝐵 → ((abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤 ↔ (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵))
13	12	imbi2d 342	. . . . 5 ⊢ (𝑤 = 𝐵 → (((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵)))
14	13	rexralbidv 3222	. . . 4 ⊢ (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵)))
15	11, 14	rspc2v 3587	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵)))
16	2, 15	syl5com 31	. 2 ⊢ (𝑇 ∈ ContFn → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵)))
17	16	3impib 1125	1 ⊢ ((𝑇 ∈ ContFn ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (abs‘((𝑇‘𝑦) − (𝑇‘𝐴))) < 𝐵))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1095   = wceq 1554   ∈ wcel 2136  ∀wral 3070  ∃wrex 3080   class class class wbr 5094  ⟶wf 6506  ‘cfv 6510  (class class class)co 7385  ℂcc 11061   < clt 11206   − cmin 11404  ℝ⁺crp 12983  abscabs 15237   ℋchba 31061  norm_ℎcno 31065   −_ℎ cmv 31067  ContFnccnfn 31095

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-pow 5316  ax-pr 5384  ax-un 7707  ax-cnex 11119  ax-hilex 31141

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5095  df-opab 5157  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-fv 6518  df-ov 7388  df-oprab 7389  df-mpo 7390  df-map 8798  df-cnfn 31989

This theorem is referenced by:  nmcfnexi  32193