Theorem elcnop 31945

Description: Property defining a continuous Hilbert space operator. (Contributed by NM, 28-Jan-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
elcnop	⊢ (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))

Distinct variable group:   𝑥,𝑤,𝑦,𝑧,𝑇

Proof of Theorem elcnop

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq1 6841	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑤) = (𝑇‘𝑤))
2		fveq1 6841	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑥) = (𝑇‘𝑥))
3	1, 2	oveq12d 7386	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → ((𝑡‘𝑤) −ℎ (𝑡‘𝑥)) = ((𝑇‘𝑤) −ℎ (𝑇‘𝑥)))
4	3	fveq2d 6846	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) = (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))))
5	4	breq1d 5110	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) < 𝑦 ↔ (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦))
6	5	imbi2d 340	. . . . 5 ⊢ (𝑡 = 𝑇 → (((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) < 𝑦) ↔ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))
7	6	rexralbidv 3204	. . . 4 ⊢ (𝑡 = 𝑇 → (∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) < 𝑦) ↔ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))
8	7	2ralbidv 3202	. . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) < 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))
9		df-cnop 31928	. . 3 ⊢ ContOp = {𝑡 ∈ ( ℋ ↑m ℋ) ∣ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑡‘𝑤) −ℎ (𝑡‘𝑥))) < 𝑦)}
10	8, 9	elrab2 3651	. 2 ⊢ (𝑇 ∈ ContOp ↔ (𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))
11		ax-hilex 31087	. . . 4 ⊢ ℋ ∈ V
12	11, 11	elmap 8821	. . 3 ⊢ (𝑇 ∈ ( ℋ ↑m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
13	12	anbi1i 625	. 2 ⊢ ((𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))
14	10, 13	bitri 275	1 ⊢ (𝑇 ∈ ContOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((𝑇‘𝑤) −ℎ (𝑇‘𝑥))) < 𝑦)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   class class class wbr 5100  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368   ↑_m cmap 8775   < clt 11178  ℝ⁺crp 12917   ℋchba 31007  norm_ℎcno 31011   −_ℎ cmv 31013  ContOpccop 31034

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-hilex 31087

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-map 8777  df-cnop 31928

This theorem is referenced by:  cnopc  32001  0cnop  32067  idcnop  32069  lnopconi  32122