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 31933

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 6833	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)))
2		fveq1 6833	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
3	2	oveq2d 7374	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑥 ·_ℎ (𝑡‘𝑦)) = (𝑥 ·_ℎ (𝑇‘𝑦)))
4		fveq1 6833	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
5	3, 4	oveq12d 7376	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
6	1, 5	eqeq12d 2752	. . . . 5 ⊢ (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
7	6	ralbidv 3159	. . . 4 ⊢ (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
8	7	2ralbidv 3200	. . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
9		df-lnop 31916	. . 3 ⊢ LinOp = {𝑡 ∈ ( ℋ ↑_m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧))}
10	8, 9	elrab2 3649	. 2 ⊢ (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
11		ax-hilex 31074	. . . 4 ⊢ ℋ ∈ V
12	11, 11	elmap 8809	. . 3 ⊢ (𝑇 ∈ ( ℋ ↑_m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
13	12	anbi1i 624	. 2 ⊢ ((𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
14	10, 13	bitri 275	1 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ↑_m cmap 8763 ℂcc 11024 ℋchba 30994 +_ℎ cva 30995 ·_ℎ csm 30996 LinOpclo 31022

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-hilex 31074

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-map 8765 df-lnop 31916

This theorem is referenced by: lnopf 31934 lnopl 31989 unoplin 31995 hmoplin 32017 lnopmi 32075 lnophsi 32076 lnopcoi 32078 cnlnadjlem6 32147 adjlnop 32161

W3C validator