ellnop - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > ellnop		Structured version Visualization version GIF version

Theorem ellnop 31951

Description: Property defining a linear Hilbert space operator. (Contributed by NM, 18-Jan-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

**Assertion**
Ref	Expression
ellnop	⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))

Distinct variable group: 𝑥,𝑦,𝑧,𝑇

Proof of Theorem ellnop Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq1 6830	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)))
2		fveq1 6830	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
3	2	oveq2d 7376	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑥 ·_ℎ (𝑡‘𝑦)) = (𝑥 ·_ℎ (𝑇‘𝑦)))
4		fveq1 6830	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
5	3, 4	oveq12d 7378	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
6	1, 5	eqeq12d 2757	. . . . 5 ⊢ (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
7	6	ralbidv 3164	. . . 4 ⊢ (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
8	7	2ralbidv 3205	. . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
9		df-lnop 31934	. . 3 ⊢ LinOp = {𝑡 ∈ ( ℋ ↑_m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧))}
10	8, 9	elrab2 3634	. 2 ⊢ (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
11		ax-hilex 31092	. . . 4 ⊢ ℋ ∈ V
12	11, 11	elmap 8813	. . 3 ⊢ (𝑇 ∈ ( ℋ ↑_m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
13	12	anbi1i 631	. 2 ⊢ ((𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
14	10, 13	bitri 277	1 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∀wral 3055 ⟶wf 6485 ‘cfv 6489 (class class class)co 7360 ↑_m cmap 8767 ℂcc 11031 ℋchba 31012 +_ℎ cva 31013 ·_ℎ csm 31014 LinOpclo 31040

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-hilex 31092

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3726 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8769 df-lnop 31934

This theorem is referenced by: lnopf 31952 lnopl 32007 unoplin 32013 hmoplin 32035 lnopmi 32093 lnophsi 32094 lnopcoi 32096 cnlnadjlem6 32165 adjlnop 32179

W3C validator