Theorem lnophm 32048

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 2827	. 2 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ HrmOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp))
2		eleq1 2827	. . . . . 6 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
3		id 22	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4		fveq2 6907	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑇‘𝑥) = (𝑇‘𝑦))
5	3, 4	oveq12d 7449	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ·ih (𝑇‘𝑥)) = (𝑦 ·ih (𝑇‘𝑦)))
6	5	eleq1d 2824	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ))
7	6	cbvralvw 3235	. . . . . . 7 ⊢ (∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ)
8		fveq1 6906	. . . . . . . . . 10 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
9	8	oveq2d 7447	. . . . . . . . 9 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (𝑇‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
10	9	eleq1d 2824	. . . . . . . 8 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
11	10	ralbidv 3176	. . . . . . 7 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
12	7, 11	bitrid 283	. . . . . 6 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
13	2, 12	anbi12d 632	. . . . 5 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) ↔ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)))
14		eleq1 2827	. . . . . 6 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
15		fveq1 6906	. . . . . . . . 9 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
16	15	oveq2d 7447	. . . . . . . 8 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
17	16	eleq1d 2824	. . . . . . 7 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
18	17	ralbidv 3176	. . . . . 6 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
19	14, 18	anbi12d 632	. . . . 5 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((( I ↾ ℋ) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ) ↔ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)))
20		idlnop 32021	. . . . . 6 ⊢ ( I ↾ ℋ) ∈ LinOp
21		fvresi 7193	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
22	21	oveq2d 7447	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih 𝑦))
23		hiidrcl 31124	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih 𝑦) ∈ ℝ)
24	22, 23	eqeltrd 2839	. . . . . . 7 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
25	24	rgen 3061	. . . . . 6 ⊢ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ
26	20, 25	pm3.2i 470	. . . . 5 ⊢ (( I ↾ ℋ) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
27	13, 19, 26	elimhyp 4596	. . . 4 ⊢ (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ)
28	27	simpli 483	. . 3 ⊢ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp
29	27	simpri 485	. . 3 ⊢ ∀𝑦 ∈ ℋ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ
30	28, 29	lnophmi 32047	. 2 ⊢ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp
31	1, 30	dedth 4589	1 ⊢ ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) → 𝑇 ∈ HrmOp)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ifcif 4531   I cid 5582   ↾ cres 5691  ‘cfv 6563  (class class class)co 7431  ℝcr 11152   ℋchba 30948   ·_ih csp 30951  LinOpclo 30976  HrmOpcho 30979

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-hilex 31028  ax-hfvadd 31029  ax-hvcom 31030  ax-hvass 31031  ax-hv0cl 31032  ax-hvaddid 31033  ax-hfvmul 31034  ax-hvmulid 31035  ax-hvmulass 31036  ax-hvdistr1 31037  ax-hvdistr2 31038  ax-hvmul0 31039  ax-hfi 31108  ax-his1 31111  ax-his2 31112  ax-his3 31113  ax-his4 31114

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-po 5597  df-so 5598  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-er 8744  df-map 8867  df-en 8985  df-dom 8986  df-sdom 8987  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-2 12327  df-3 12328  df-4 12329  df-cj 15135  df-re 15136  df-im 15137  df-hvsub 31000  df-lnop 31870  df-unop 31872  df-hmop 31873

This theorem is referenced by: (None)