Theorem idcnop 32583

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 6863	. . 3 ⊢ ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
2		f1of 6824	. . 3 ⊢ (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ⟶ ℋ)
3	1, 2	ax-mp 5	. 2 ⊢ ( I ↾ ℋ): ℋ⟶ ℋ
4		id 23	. . . 4 ⊢ (𝑦 ∈ ℝ+ → 𝑦 ∈ ℝ+)
5		fvresi 7178	. . . . . . . . 9 ⊢ (𝑤 ∈ ℋ → (( I ↾ ℋ)‘𝑤) = 𝑤)
6		fvresi 7178	. . . . . . . . 9 ⊢ (𝑥 ∈ ℋ → (( I ↾ ℋ)‘𝑥) = 𝑥)
7	5, 6	oveqan12rd 7440	. . . . . . . 8 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥)) = (𝑤 −ℎ 𝑥))
8	7	fveq2d 6889	. . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) = (normℎ‘(𝑤 −ℎ 𝑥)))
9	8	breq1d 5112	. . . . . 6 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
10	9	biimprd 251	. . . . 5 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
11	10	ralrimiva 3154	. . . 4 ⊢ (𝑥 ∈ ℋ → ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
12		breq2 5106	. . . . 5 ⊢ (𝑧 = 𝑦 → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
13	12	rspceaimv 3582	. . . 4 ⊢ ((𝑦 ∈ ℝ+ ∧ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
14	4, 11, 13	syl2anr 609	. . 3 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℝ+) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
15	14	rgen2 3202	. 2 ⊢ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)
16		elcnop 32459	. 2 ⊢ (( I ↾ ℋ) ∈ ContOp ↔ (( I ↾ ℋ): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)))
17	3, 15, 16	mpbir2an 724	1 ⊢ ( I ↾ ℋ) ∈ ContOp

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   class class class wbr 5102   I cid 5544   ↾ cres 5652  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   < clt 11343  ℝ⁺crp 13120   ℋchba 31521  norm_ℎcno 31525   −_ℎ cmv 31527  ContOpccop 31548

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-hilex 31601

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-cnop 32442

This theorem is used by:  nmcopex  32631  nmcoplb  32632