Theorem lnophm 31998

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 2816	. 2 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ HrmOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp))
2		eleq1 2816	. . . . . 6 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
3		id 22	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑇‘𝑥) = (𝑇‘𝑦))
5	3, 4	oveq12d 7387	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ·ih (𝑇‘𝑥)) = (𝑦 ·ih (𝑇‘𝑦)))
6	5	eleq1d 2813	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ))
7	6	cbvralvw 3213	. . . . . . 7 ⊢ (∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ ↔ ∀𝑦 ∈ ℋ (𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ)
8		fveq1 6839	. . . . . . . . . 10 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
9	8	oveq2d 7385	. . . . . . . . 9 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (𝑇‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
10	9	eleq1d 2813	. . . . . . . 8 ⊢ (𝑇 = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (𝑇‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
11	10	ralbidv 3156	. . . . . . 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 2816	. . . . . 6 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
15		fveq1 6839	. . . . . . . . 9 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦))
16	15	oveq2d 7385	. . . . . . . 8 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)))
17	16	eleq1d 2813	. . . . . . 7 ⊢ (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) → ((𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ ↔ (𝑦 ·ih (if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ))‘𝑦)) ∈ ℝ))
18	17	ralbidv 3156	. . . . . 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 31971	. . . . . 6 ⊢ ( I ↾ ℋ) ∈ LinOp
21		fvresi 7129	. . . . . . . . 9 ⊢ (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
22	21	oveq2d 7385	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) = (𝑦 ·ih 𝑦))
23		hiidrcl 31074	. . . . . . . 8 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih 𝑦) ∈ ℝ)
24	22, 23	eqeltrd 2828	. . . . . . 7 ⊢ (𝑦 ∈ ℋ → (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
25	24	rgen 3046	. . . . . 6 ⊢ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ
26	20, 25	pm3.2i 470	. . . . 5 ⊢ (( I ↾ ℋ) ∈ LinOp ∧ ∀𝑦 ∈ ℋ (𝑦 ·ih (( I ↾ ℋ)‘𝑦)) ∈ ℝ)
27	13, 19, 26	elimhyp 4550	. . . 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 31997	. 2 ⊢ if((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ), 𝑇, ( I ↾ ℋ)) ∈ HrmOp
31	1, 30	dedth 4543	1 ⊢ ((𝑇 ∈ LinOp ∧ ∀𝑥 ∈ ℋ (𝑥 ·ih (𝑇‘𝑥)) ∈ ℝ) → 𝑇 ∈ HrmOp)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ifcif 4484   I cid 5525   ↾ cres 5633  ‘cfv 6499  (class class class)co 7369  ℝcr 11043   ℋchba 30898   ·_ih csp 30901  LinOpclo 30926  HrmOpcho 30929

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 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121  ax-hilex 30978  ax-hfvadd 30979  ax-hvcom 30980  ax-hvass 30981  ax-hv0cl 30982  ax-hvaddid 30983  ax-hfvmul 30984  ax-hvmulid 30985  ax-hvmulass 30986  ax-hvdistr1 30987  ax-hvdistr2 30988  ax-hvmul0 30989  ax-hfi 31058  ax-his1 31061  ax-his2 31062  ax-his3 31063  ax-his4 31064

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 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-div 11812  df-nn 12163  df-2 12225  df-3 12226  df-4 12227  df-cj 15041  df-re 15042  df-im 15043  df-hvsub 30950  df-lnop 31820  df-unop 31822  df-hmop 31823

This theorem is referenced by: (None)