Theorem idcnop 30392

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 6784	. . 3 ⊢ ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
2		f1of 6746	. . 3 ⊢ (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ⟶ ℋ)
3	1, 2	ax-mp 5	. 2 ⊢ ( I ↾ ℋ): ℋ⟶ ℋ
4		id 22	. . . 4 ⊢ (𝑦 ∈ ℝ+ → 𝑦 ∈ ℝ+)
5		fvresi 7077	. . . . . . . . 9 ⊢ (𝑤 ∈ ℋ → (( I ↾ ℋ)‘𝑤) = 𝑤)
6		fvresi 7077	. . . . . . . . 9 ⊢ (𝑥 ∈ ℋ → (( I ↾ ℋ)‘𝑥) = 𝑥)
7	5, 6	oveqan12rd 7327	. . . . . . . 8 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥)) = (𝑤 −ℎ 𝑥))
8	7	fveq2d 6808	. . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) = (normℎ‘(𝑤 −ℎ 𝑥)))
9	8	breq1d 5091	. . . . . 6 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
10	9	biimprd 248	. . . . 5 ⊢ ((𝑥 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
11	10	ralrimiva 3139	. . . 4 ⊢ (𝑥 ∈ ℋ → ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
12		breq2 5085	. . . . 5 ⊢ (𝑧 = 𝑦 → ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 ↔ (normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦))
13	12	rspceaimv 3570	. . . 4 ⊢ ((𝑦 ∈ ℝ+ ∧ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑦 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
14	4, 11, 13	syl2anr 598	. . 3 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℝ+) → ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦))
15	14	rgen2 3190	. 2 ⊢ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)
16		elcnop 30268	. 2 ⊢ (( I ↾ ℋ) ∈ ContOp ↔ (( I ↾ ℋ): ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℝ+ ∃𝑧 ∈ ℝ+ ∀𝑤 ∈ ℋ ((normℎ‘(𝑤 −ℎ 𝑥)) < 𝑧 → (normℎ‘((( I ↾ ℋ)‘𝑤) −ℎ (( I ↾ ℋ)‘𝑥))) < 𝑦)))
17	3, 15, 16	mpbir2an 709	1 ⊢ ( I ↾ ℋ) ∈ ContOp

Syntax hints:   → wi 4   ∧ wa 397   ∈ wcel 2104  ∀wral 3061  ∃wrex 3070   class class class wbr 5081   I cid 5499   ↾ cres 5602  ⟶wf 6454  –1-1-onto→wf1o 6457  ‘cfv 6458  (class class class)co 7307   < clt 11059  ℝ⁺crp 12780   ℋchba 29330  norm_ℎcno 29334   −_ℎ cmv 29336  ContOpccop 29357

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620  ax-hilex 29410

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ral 3062  df-rex 3071  df-rab 3333  df-v 3439  df-sbc 3722  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-br 5082  df-opab 5144  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-f1 6463  df-fo 6464  df-f1o 6465  df-fv 6466  df-ov 7310  df-oprab 7311  df-mpo 7312  df-map 8648  df-cnop 30251

This theorem is referenced by:  nmcopex  30440  nmcoplb  30441