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 30220

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 6773	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)))
2		fveq1 6773	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
3	2	oveq2d 7291	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑥 ·_ℎ (𝑡‘𝑦)) = (𝑥 ·_ℎ (𝑇‘𝑦)))
4		fveq1 6773	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
5	3, 4	oveq12d 7293	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
6	1, 5	eqeq12d 2754	. . . . 5 ⊢ (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
7	6	ralbidv 3112	. . . 4 ⊢ (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
8	7	2ralbidv 3129	. . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
9		df-lnop 30203	. . 3 ⊢ LinOp = {𝑡 ∈ ( ℋ ↑_m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑡‘𝑦)) +_ℎ (𝑡‘𝑧))}
10	8, 9	elrab2 3627	. 2 ⊢ (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
11		ax-hilex 29361	. . . 4 ⊢ ℋ ∈ V
12	11, 11	elmap 8659	. . 3 ⊢ (𝑇 ∈ ( ℋ ↑_m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
13	12	anbi1i 624	. 2 ⊢ ((𝑇 ∈ ( ℋ ↑_m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
14	10, 13	bitri 274	1 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ↑_m cmap 8615 ℂcc 10869 ℋchba 29281 +_ℎ cva 29282 ·_ℎ csm 29283 LinOpclo 29309

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-hilex 29361

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-map 8617 df-lnop 30203

This theorem is referenced by: lnopf 30221 lnopl 30276 unoplin 30282 hmoplin 30304 lnopmi 30362 lnophsi 30363 lnopcoi 30365 cnlnadjlem6 30434 adjlnop 30448

W3C validator