Theorem cnopc 32118

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 32062	. . . 4 ⊢ (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤)))
2	1	simprbi 501	. . 3 ⊢ (𝑇 ∈ ContOp → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤))
3		oveq2 7406	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → (𝑦 −ℎ 𝑧) = (𝑦 −ℎ 𝐴))
4	3	fveq2d 6873	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘(𝑦 −ℎ 𝑧)) = (normℎ‘(𝑦 −ℎ 𝐴)))
5	4	breq1d 5112	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 ↔ (normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥))
6		fveq2 6869	. . . . . . . . 9 ⊢ (𝑧 = 𝐴 → (𝑇‘𝑧) = (𝑇‘𝐴))
7	6	oveq2d 7414	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → ((𝑇‘𝑦) −ℎ (𝑇‘𝑧)) = ((𝑇‘𝑦) −ℎ (𝑇‘𝐴)))
8	7	fveq2d 6873	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) = (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))))
9	8	breq1d 5112	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤))
10	5, 9	imbi12d 346	. . . . 5 ⊢ (𝑧 = 𝐴 → (((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
11	10	rexralbidv 3230	. . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
12		breq2 5106	. . . . . 6 ⊢ (𝑤 = 𝐵 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))
13	12	imbi2d 342	. . . . 5 ⊢ (𝑤 = 𝐵 → (((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
14	13	rexralbidv 3230	. . . 4 ⊢ (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
15	11, 14	rspc2v 3594	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
16	2, 15	syl5com 31	. 2 ⊢ (𝑇 ∈ ContOp → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
17	16	3impib 1130	1 ⊢ ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  ∀wral 3078  ∃wrex 3088   class class class wbr 5102  ⟶wf 6519  ‘cfv 6523  (class class class)co 7398   < clt 11218  ℝ⁺crp 12995   ℋchba 31124  norm_ℎcno 31128   −_ℎ cmv 31130  ContOpccop 31151

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-hilex 31204

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fv 6531  df-ov 7401  df-oprab 7402  df-mpo 7403  df-map 8812  df-cnop 32045

This theorem is referenced by:  nmcopexi  32232