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 30121

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 6755	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)))
2		fveq1 6755	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
3	2	oveq2d 7271	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑥 ·_ℎ (𝑡‘𝑦)) = (𝑥 ·_ℎ (𝑇‘𝑦)))
4		fveq1 6755	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
5	3, 4	oveq12d 7273	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
6	1, 5	eqeq12d 2754	. . . . 5 ⊢ (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
7	6	ralbidv 3120	. . . 4 ⊢ (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
8	7	2ralbidv 3122	. . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
9		df-lnop 30104	. . 3 ⊢ LinOp = {𝑡 ∈ ( ℋ ↑_m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧))}
10	8, 9	elrab2 3620	. 2 ⊢ (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
11		ax-hilex 29262	. . . 4 ⊢ ℋ ∈ V
12	11, 11	elmap 8617	. . 3 ⊢ (𝑇 ∈ ( ℋ ↑_m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
13	12	anbi1i 623	. 2 ⊢ ((𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
14	10, 13	bitri 274	1 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ↑_m cmap 8573 ℂcc 10800 ℋchba 29182 +_ℎ cva 29183 ·_ℎ csm 29184 LinOpclo 29210

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-hilex 29262

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-map 8575 df-lnop 30104

This theorem is referenced by: lnopf 30122 lnopl 30177 unoplin 30183 hmoplin 30205 lnopmi 30263 lnophsi 30264 lnopcoi 30266 cnlnadjlem6 30335 adjlnop 30349

W3C validator