Theorem cnopc 31842

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 31786	. . . 4 ⊢ (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤)))
2	1	simprbi 496	. . 3 ⊢ (𝑇 ∈ ContOp → ∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤))
3		oveq2 7395	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → (𝑦 −ℎ 𝑧) = (𝑦 −ℎ 𝐴))
4	3	fveq2d 6862	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘(𝑦 −ℎ 𝑧)) = (normℎ‘(𝑦 −ℎ 𝐴)))
5	4	breq1d 5117	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 ↔ (normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥))
6		fveq2 6858	. . . . . . . . 9 ⊢ (𝑧 = 𝐴 → (𝑇‘𝑧) = (𝑇‘𝐴))
7	6	oveq2d 7403	. . . . . . . 8 ⊢ (𝑧 = 𝐴 → ((𝑇‘𝑦) −ℎ (𝑇‘𝑧)) = ((𝑇‘𝑦) −ℎ (𝑇‘𝐴)))
8	7	fveq2d 6862	. . . . . . 7 ⊢ (𝑧 = 𝐴 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) = (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))))
9	8	breq1d 5117	. . . . . 6 ⊢ (𝑧 = 𝐴 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤))
10	5, 9	imbi12d 344	. . . . 5 ⊢ (𝑧 = 𝐴 → (((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
11	10	rexralbidv 3203	. . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤)))
12		breq2 5111	. . . . . 6 ⊢ (𝑤 = 𝐵 → ((normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤 ↔ (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))
13	12	imbi2d 340	. . . . 5 ⊢ (𝑤 = 𝐵 → (((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
14	13	rexralbidv 3203	. . . 4 ⊢ (𝑤 = 𝐵 → (∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝑤) ↔ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
15	11, 14	rspc2v 3599	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → (∀𝑧 ∈ ℋ ∀𝑤 ∈ ℝ+ ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝑧)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝑧))) < 𝑤) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
16	2, 15	syl5com 31	. 2 ⊢ (𝑇 ∈ ContOp → ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵)))
17	16	3impib 1116	1 ⊢ ((𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ ℝ+ ∀𝑦 ∈ ℋ ((normℎ‘(𝑦 −ℎ 𝐴)) < 𝑥 → (normℎ‘((𝑇‘𝑦) −ℎ (𝑇‘𝐴))) < 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   class class class wbr 5107  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387   < clt 11208  ℝ⁺crp 12951   ℋchba 30848  norm_ℎcno 30852   −_ℎ cmv 30854  ContOpccop 30875

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-hilex 30928

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-cnop 31769

This theorem is referenced by:  nmcopexi  31956