Theorem cnopc 32276

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.

Step	Hyp	Ref	Expression
1		elcnop 32220	. . . 4 ⊢ (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤)))
2	1	simprbi 502	. . 3 ⊢ (𝑇 ∈ ContOp → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤))
3		oveq2 7420	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → (𝑦 −ℎ 𝑧) = (𝑦 −ℎ 𝐴))
4	3	fveq2d 6885	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘(𝑦 −ℎ 𝑧)) = (normℎ‘(𝑦 −ℎ 𝐴)))
5	4	breq1d 5118	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 ↔ (normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥))
6		fveq2 6881	. . . . . . . . 9 ⊢ (𝑧 = 𝐴 → (𝑇‘𝑧) = (𝑇‘𝐴))
7	6	oveq2d 7428	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → ((𝑇‘𝑦) −ℎ (𝑇‘𝑧)) = ((𝑇‘𝑦) −ℎ (𝑇‘𝐴)))
8	7	fveq2d 6885	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) = (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))))
9	8	breq1d 5118	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤))
10	5, 9	imbi12d 347	. . . . 5 ⊢ (𝑧 = 𝐴 → (((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
11	10	rexralbidv 3230	. . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
12		breq2 5112	. . . . . 6 ⊢ (𝑤 = 𝐵 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))
13	12	imbi2d 343	. . . . 5 ⊢ (𝑤 = 𝐵 → (((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
14	13	rexralbidv 3230	. . . 4 ⊢ (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
15	11, 14	rspc2v 3591	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
16	2, 15	syl5com 32	. 2 ⊢ (𝑇 ∈ ContOp → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
17	16	3impib 1133	1 ⊢ ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∀wral 3078  ∃wrex 3088   class class class wbr 5108  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412   < clt 11249  ℝ⁺crp 13022   ℋchba 31282  norm_ℎcno 31286   −_ℎ cmv 31288  ContOpccop 31309

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-hilex 31362

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8824  df-cnop 32203

This theorem is used by:  nmcopexi  32390