Theorem lnophm 31024

Description: A linear operator is Hermitian if 𝑥 ·_ih (𝑇‘𝑥) takes only real values. Remark in [ReedSimon] p. 195. (Contributed by NM, 24-Jan-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
lnophm	⊢ ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) → 𝑇 ∈ HrmOp)

Distinct variable group:   𝑥,𝑇

Proof of Theorem lnophm

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2820	. 2 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ HrmOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp))
2		eleq1 2820	. . . . . 6 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
3		id 22	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4		fveq2 6847	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑇‘𝑥) = (𝑇‘𝑦))
5	3, 4	oveq12d 7380	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ·ih (𝑇‘𝑥)) = (𝑦 ·ih (𝑇‘𝑦)))
6	5	eleq1d 2817	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ))
7	6	cbvralvw 3223	. . . . . . 7 ⊢ (∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ)
8		fveq1 6846	. . . . . . . . . 10 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
9	8	oveq2d 7378	. . . . . . . . 9 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (𝑇‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
10	9	eleq1d 2817	. . . . . . . 8 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
11	10	ralbidv 3170	. . . . . . 7 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
12	7, 11	bitrid 282	. . . . . 6 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
13	2, 12	anbi12d 631	. . . . 5 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) ↔ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)))
14		eleq1 2820	. . . . . 6 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
15		fveq1 6846	. . . . . . . . 9 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
16	15	oveq2d 7378	. . . . . . . 8 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
17	16	eleq1d 2817	. . . . . . 7 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
18	17	ralbidv 3170	. . . . . 6 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
19	14, 18	anbi12d 631	. . . . 5 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((( I ↾ ℋ) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ) ↔ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)))
20		idlnop 30997	. . . . . 6 ⊢ ( I ↾ ℋ) ∈ LinOp
21		fvresi 7124	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
22	21	oveq2d 7378	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih 𝑦))
23		hiidrcl 30100	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih 𝑦) ∈ ℝ)
24	22, 23	eqeltrd 2832	. . . . . . 7 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
25	24	rgen 3062	. . . . . 6 ⊢ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ
26	20, 25	pm3.2i 471	. . . . 5 ⊢ (( I ↾ ℋ) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
27	13, 19, 26	elimhyp 4556	. . . 4 ⊢ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)
28	27	simpli 484	. . 3 ⊢ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp
29	27	simpri 486	. . 3 ⊢ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ
30	28, 29	lnophmi 31023	. 2 ⊢ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp
31	1, 30	dedth 4549	1 ⊢ ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) → 𝑇 ∈ HrmOp)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3060  ifcif 4491   I cid 5535   ↾ cres 5640  ‘cfv 6501  (class class class)co 7362  ℝcr 11059   ℋchba 29924   ·_ih csp 29927  LinOpclo 29952  HrmOpcho 29955

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-resscn 11117  ax-1cn 11118  ax-icn 11119  ax-addcl 11120  ax-addrcl 11121  ax-mulcl 11122  ax-mulrcl 11123  ax-mulcom 11124  ax-addass 11125  ax-mulass 11126  ax-distr 11127  ax-i2m1 11128  ax-1ne0 11129  ax-1rid 11130  ax-rnegex 11131  ax-rrecex 11132  ax-cnre 11133  ax-pre-lttri 11134  ax-pre-lttrn 11135  ax-pre-ltadd 11136  ax-pre-mulgt0 11137  ax-hilex 30004  ax-hfvadd 30005  ax-hvcom 30006  ax-hvass 30007  ax-hv0cl 30008  ax-hvaddid 30009  ax-hfvmul 30010  ax-hvmulid 30011  ax-hvmulass 30012  ax-hvdistr1 30013  ax-hvdistr2 30014  ax-hvmul0 30015  ax-hfi 30084  ax-his1 30087  ax-his2 30088  ax-his3 30089  ax-his4 30090

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3351  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-po 5550  df-so 5551  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 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-riota 7318  df-ov 7365  df-oprab 7366  df-mpo 7367  df-er 8655  df-map 8774  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11200  df-mnf 11201  df-xr 11202  df-ltxr 11203  df-le 11204  df-sub 11396  df-neg 11397  df-div 11822  df-2 12225  df-3 12226  df-4 12227  df-cj 14996  df-re 14997  df-im 14998  df-hvsub 29976  df-lnop 30846  df-unop 30848  df-hmop 30849

This theorem is referenced by: (None)