Theorem lnopl 32339

Description: Basic linearity property of a linear Hilbert space operator. (Contributed by NM, 22-Jan-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
lnopl	⊢ (((𝑇 ∈ LinOp ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶)))

Proof of Theorem lnopl

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ellnop 32283	. . . . . 6 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
2	1	simprbi 503	. . . . 5 ⊢ (𝑇 ∈ LinOp → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
3		oveq1 7426	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ·ℎ 𝑦) = (𝐴 ·ℎ 𝑦))
4	3	fvoveq1d 7441	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)))
5		oveq1 7426	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ·ℎ (𝑇‘𝑦)) = (𝐴 ·ℎ (𝑇‘𝑦)))
6	5	oveq1d 7434	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)) = ((𝐴 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
7	4, 6	eqeq12d 2781	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
8		oveq2 7427	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 ·ℎ 𝑦) = (𝐴 ·ℎ 𝐵))
9	8	fvoveq1d 7441	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)))
10		fveq2 6885	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑇‘𝑦) = (𝑇‘𝐵))
11	10	oveq2d 7435	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 ·ℎ (𝑇‘𝑦)) = (𝐴 ·ℎ (𝑇‘𝐵)))
12	11	oveq1d 7434	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐴 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝑧)))
13	9, 12	eqeq12d 2781	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝑧))))
14		oveq2 7427	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → ((𝐴 ·ℎ 𝐵) +ℎ 𝑧) = ((𝐴 ·ℎ 𝐵) +ℎ 𝐶))
15	14	fveq2d 6889	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)))
16		fveq2 6885	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝑇‘𝑧) = (𝑇‘𝐶))
17	16	oveq2d 7435	. . . . . . 7 ⊢ (𝑧 = 𝐶 → ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝑧)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶)))
18	15, 17	eqeq12d 2781	. . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶))))
19	7, 13, 18	rspc3v 3599	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶))))
20	2, 19	syl5 35	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinOp → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶))))
21	20	3expb 1138	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinOp → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶))))
22	21	impcom 413	. 2 ⊢ ((𝑇 ∈ LinOp ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶)))
23	22	anassrs 473	1 ⊢ (((𝑇 ∈ LinOp ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 ·ℎ (𝑇‘𝐵)) +ℎ (𝑇‘𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  ℂcc 11115   ℋchba 31344   +_ℎ cva 31345   ·_ℎ csm 31346  LinOpclo 31372

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-hilex 31424

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-lnop 32266

This theorem is used by:  lnop0  32391  lnopmul  32392  lnopli  32393