Theorem idcnop 31910

Description: The identity function (restricted to Hilbert space) is a continuous operator. (Contributed by NM, 7-Feb-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
idcnop	⊢ ( I ↾ ℋ) ∈ ContOp

Proof of Theorem idcnop

Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oi 6838	. . 3 ⊢ ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
2		f1of 6800	. . 3 ⊢ (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ⟶ ℋ)
3	1, 2	ax-mp 5	. 2 ⊢ ( I ↾ ℋ): ℋ⟶ ℋ
4		id 22	. . . 4 ⊢ (𝑦 ∈ ℝ+ → 𝑦 ∈ ℝ+)
5		fvresi 7147	. . . . . . . . 9 ⊢ (𝑤 ∈ ℋ → (( I ↾ ℋ)‘𝑤) = 𝑤)
6		fvresi 7147	. . . . . . . . 9 ⊢ (𝑥 ∈ ℋ → (( I ↾ ℋ)‘𝑥) = 𝑥)
7	5, 6	oveqan12rd 7407	. . . . . . . 8 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥)) = (𝑤 −ℎ 𝑥))
8	7	fveq2d 6862	. . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) = (normℎ‘(𝑤 −ℎ 𝑥)))
9	8	breq1d 5117	. . . . . 6 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
10	9	biimprd 248	. . . . 5 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
11	10	ralrimiva 3125	. . . 4 ⊢ (𝑥 ∈ ℋ → ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
12		breq2 5111	. . . . 5 ⊢ (𝑧 = 𝑦 → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
13	12	rspceaimv 3594	. . . 4 ⊢ ((𝑦 ∈ ℝ+ ∧ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
14	4, 11, 13	syl2anr 597	. . 3 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℝ+) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
15	14	rgen2 3177	. 2 ⊢ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)
16		elcnop 31786	. 2 ⊢ (( I ↾ ℋ) ∈ ContOp ↔ (( I ↾ ℋ): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)))
17	3, 15, 16	mpbir2an 711	1 ⊢ ( I ↾ ℋ) ∈ ContOp

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   class class class wbr 5107   I cid 5532   ↾ cres 5640  ⟶wf 6507  –1-1-onto→wf1o 6510  ‘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-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-cnop 31769

This theorem is referenced by:  nmcopex  31958  nmcoplb  31959