Theorem nmopun 31958

Description: Norm of a unitary Hilbert space operator. (Contributed by NM, 25-Feb-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
nmopun	⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → (normop‘𝑇) = 1)

Proof of Theorem nmopun

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

Step	Hyp	Ref	Expression
1		unoplin 31864	. . . . 5 ⊢ (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2		lnopf 31803	. . . . 5 ⊢ (𝑇 ∈ LinOp → 𝑇: ℋ⟶ ℋ)
3	1, 2	syl 17	. . . 4 ⊢ (𝑇 ∈ UniOp → 𝑇: ℋ⟶ ℋ)
4		nmopval 31800	. . . 4 ⊢ (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
5	3, 4	syl 17	. . 3 ⊢ (𝑇 ∈ UniOp → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
6	5	adantl 481	. 2 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
7		nmopsetretHIL 31808	. . . . . . 7 ⊢ (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ)
8		ressxr 11159	. . . . . . 7 ⊢ ℝ ⊆ ℝ*
9	7, 8	sstrdi 3948	. . . . . 6 ⊢ (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
10	3, 9	syl 17	. . . . 5 ⊢ (𝑇 ∈ UniOp → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
11	10	adantl 481	. . . 4 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ*)
12		1xr 11174	. . . 4 ⊢ 1 ∈ ℝ*
13	11, 12	jctir 520	. . 3 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → ({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*))
14		vex 3440	. . . . . . 7 ⊢ 𝑧 ∈ V
15		eqeq1 2733	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 = (normℎ‘(𝑇‘𝑦)) ↔ 𝑧 = (normℎ‘(𝑇‘𝑦))))
16	15	anbi2d 630	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦)))))
17	16	rexbidv 3153	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦)))))
18	14, 17	elab 3635	. . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦))))
19		unopnorm 31861	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦))
20	19	eqeq2d 2740	. . . . . . . . . 10 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (𝑧 = (normℎ‘(𝑇‘𝑦)) ↔ 𝑧 = (normℎ‘𝑦)))
21	20	anbi2d 630	. . . . . . . . 9 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘𝑦))))
22		breq1 5095	. . . . . . . . . 10 ⊢ (𝑧 = (normℎ‘𝑦) → (𝑧 ≤ 1 ↔ (normℎ‘𝑦) ≤ 1))
23	22	biimparc 479	. . . . . . . . 9 ⊢ (((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘𝑦)) → 𝑧 ≤ 1)
24	21, 23	biimtrdi 253	. . . . . . . 8 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦))) → 𝑧 ≤ 1))
25	24	rexlimdva 3130	. . . . . . 7 ⊢ (𝑇 ∈ UniOp → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦))) → 𝑧 ≤ 1))
26	25	imp 406	. . . . . 6 ⊢ ((𝑇 ∈ UniOp ∧ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑧 = (normℎ‘(𝑇‘𝑦)))) → 𝑧 ≤ 1)
27	18, 26	sylan2b 594	. . . . 5 ⊢ ((𝑇 ∈ UniOp ∧ 𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}) → 𝑧 ≤ 1)
28	27	ralrimiva 3121	. . . 4 ⊢ (𝑇 ∈ UniOp → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 ≤ 1)
29	28	adantl 481	. . 3 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 ≤ 1)
30		hne0 31491	. . . . . . . . . . 11 ⊢ ( ℋ ≠ 0ℋ ↔ ∃𝑦 ∈ ℋ 𝑦 ≠ 0ℎ)
31		norm1hex 31195	. . . . . . . . . . 11 ⊢ (∃𝑦 ∈ ℋ 𝑦 ≠ 0ℎ ↔ ∃𝑦 ∈ ℋ (normℎ‘𝑦) = 1)
32	30, 31	sylbb 219	. . . . . . . . . 10 ⊢ ( ℋ ≠ 0ℋ → ∃𝑦 ∈ ℋ (normℎ‘𝑦) = 1)
33	32	adantr 480	. . . . . . . . 9 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ (normℎ‘𝑦) = 1)
34		1le1 11748	. . . . . . . . . . . . . 14 ⊢ 1 ≤ 1
35		breq1 5095	. . . . . . . . . . . . . 14 ⊢ ((normℎ‘𝑦) = 1 → ((normℎ‘𝑦) ≤ 1 ↔ 1 ≤ 1))
36	34, 35	mpbiri 258	. . . . . . . . . . . . 13 ⊢ ((normℎ‘𝑦) = 1 → (normℎ‘𝑦) ≤ 1)
37	36	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((normℎ‘𝑦) = 1 → (normℎ‘𝑦) ≤ 1))
38	19	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (normℎ‘𝑦) = 1) → (normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦))
39		eqeq2 2741	. . . . . . . . . . . . . . . 16 ⊢ ((normℎ‘𝑦) = 1 → ((normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦) ↔ (normℎ‘(𝑇‘𝑦)) = 1))
40	39	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (normℎ‘𝑦) = 1) → ((normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦) ↔ (normℎ‘(𝑇‘𝑦)) = 1))
41	38, 40	mpbid 232	. . . . . . . . . . . . . 14 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (normℎ‘𝑦) = 1) → (normℎ‘(𝑇‘𝑦)) = 1)
42	41	eqcomd 2735	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (normℎ‘𝑦) = 1) → 1 = (normℎ‘(𝑇‘𝑦)))
43	42	ex 412	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((normℎ‘𝑦) = 1 → 1 = (normℎ‘(𝑇‘𝑦))))
44	37, 43	jcad 512	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((normℎ‘𝑦) = 1 → ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦)))))
45	44	adantll 714	. . . . . . . . . 10 ⊢ ((( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) ∧ 𝑦 ∈ ℋ) → ((normℎ‘𝑦) = 1 → ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦)))))
46	45	reximdva 3142	. . . . . . . . 9 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → (∃𝑦 ∈ ℋ (normℎ‘𝑦) = 1 → ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦)))))
47	33, 46	mpd 15	. . . . . . . 8 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦))))
48		1ex 11111	. . . . . . . . 9 ⊢ 1 ∈ V
49		eqeq1 2733	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → (𝑥 = (normℎ‘(𝑇‘𝑦)) ↔ 1 = (normℎ‘(𝑇‘𝑦))))
50	49	anbi2d 630	. . . . . . . . . 10 ⊢ (𝑥 = 1 → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦)))))
51	50	rexbidv 3153	. . . . . . . . 9 ⊢ (𝑥 = 1 → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦)))))
52	48, 51	elab 3635	. . . . . . . 8 ⊢ (1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 1 = (normℎ‘(𝑇‘𝑦))))
53	47, 52	sylibr 234	. . . . . . 7 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
54	53	adantr 480	. . . . . 6 ⊢ ((( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
55		breq2 5096	. . . . . . 7 ⊢ (𝑤 = 1 → (𝑧 < 𝑤 ↔ 𝑧 < 1))
56	55	rspcev 3577	. . . . . 6 ⊢ ((1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 < 𝑤)
57	54, 56	sylan 580	. . . . 5 ⊢ (((( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 < 𝑤)
58	57	ex 412	. . . 4 ⊢ ((( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 < 𝑤))
59	58	ralrimiva 3121	. . 3 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 < 𝑤))
60		supxr2 13216	. . 3 ⊢ ((({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*) ∧ (∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 ≤ 1 ∧ ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}𝑧 < 𝑤))) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ) = 1)
61	13, 29, 59, 60	syl12anc 836	. 2 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ) = 1)
62	6, 61	eqtrd 2764	1 ⊢ (( ℋ ≠ 0ℋ ∧ 𝑇 ∈ UniOp) → (normop‘𝑇) = 1)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2707   ≠ wne 2925  ∀wral 3044  ∃wrex 3053   ⊆ wss 3903   class class class wbr 5092  ⟶wf 6478  ‘cfv 6482  supcsup 9330  ℝcr 11008  1c1 11010  ℝ^*cxr 11148   < clt 11149   ≤ cle 11150   ℋchba 30863  norm_ℎcno 30867  0_ℎc0v 30868  0_ℋc0h 30879  norm_opcnop 30889  LinOpclo 30891  UniOpcuo 30893

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-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086  ax-pre-sup 11087  ax-hilex 30943  ax-hfvadd 30944  ax-hvcom 30945  ax-hvass 30946  ax-hv0cl 30947  ax-hvaddid 30948  ax-hfvmul 30949  ax-hvmulid 30950  ax-hvmulass 30951  ax-hvdistr1 30952  ax-hvdistr2 30953  ax-hvmul0 30954  ax-hfi 31023  ax-his1 31026  ax-his2 31027  ax-his3 31028  ax-his4 31029

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  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-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-sup 9332  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-div 11778  df-nn 12129  df-2 12191  df-3 12192  df-4 12193  df-n0 12385  df-z 12472  df-uz 12736  df-rp 12894  df-seq 13909  df-exp 13969  df-cj 15006  df-re 15007  df-im 15008  df-sqrt 15142  df-abs 15143  df-grpo 30437  df-gid 30438  df-ablo 30489  df-vc 30503  df-nv 30536  df-va 30539  df-ba 30540  df-sm 30541  df-0v 30542  df-nmcv 30544  df-hnorm 30912  df-hba 30913  df-hvsub 30915  df-hlim 30916  df-sh 31151  df-ch 31165  df-ch0 31197  df-nmop 31783  df-lnop 31785  df-unop 31787

This theorem is referenced by:  unopbd  31959  unierri  32048