Theorem lnfnl 29341

Description: Basic linearity property of a linear functional. (Contributed by NM, 11-Feb-2006.) (New usage is discouraged.)

Assertion

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

Proof of Theorem lnfnl

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

Step	Hyp	Ref	Expression
1		ellnfn 29293	. . . . . 6 ⊢ (𝑇 ∈ LinFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧))))
2	1	simprbi 492	. . . . 5 ⊢ (𝑇 ∈ LinFn → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)))
3		oveq1 6917	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ·ℎ 𝑦) = (𝐴 ·ℎ 𝑦))
4	3	fvoveq1d 6932	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)))
5		oveq1 6917	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 · (𝑇‘𝑦)) = (𝐴 · (𝑇‘𝑦)))
6	5	oveq1d 6925	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)))
7	4, 6	eqeq12d 2840	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧))))
8		oveq2 6918	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 ·ℎ 𝑦) = (𝐴 ·ℎ 𝐵))
9	8	fvoveq1d 6932	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)))
10		fveq2 6437	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑇‘𝑦) = (𝑇‘𝐵))
11	10	oveq2d 6926	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 · (𝑇‘𝑦)) = (𝐴 · (𝑇‘𝐵)))
12	11	oveq1d 6925	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)))
13	9, 12	eqeq12d 2840	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧))))
14		oveq2 6918	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → ((𝐴 ·ℎ 𝐵) +ℎ 𝑧) = ((𝐴 ·ℎ 𝐵) +ℎ 𝐶))
15	14	fveq2d 6441	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)))
16		fveq2 6437	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝑇‘𝑧) = (𝑇‘𝐶))
17	16	oveq2d 6926	. . . . . . 7 ⊢ (𝑧 = 𝐶 → ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))
18	15, 17	eqeq12d 2840	. . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
19	7, 13, 18	rspc3v 3542	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
20	2, 19	syl5 34	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
21	20	3expb 1153	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
22	21	impcom 398	. 2 ⊢ ((𝑇 ∈ LinFn ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))
23	22	anassrs 461	1 ⊢ (((𝑇 ∈ LinFn ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))

Syntax hints:   → wi 4   ∧ wa 386   ∧ w3a 1111   = wceq 1656   ∈ wcel 2164  ∀wral 3117  ⟶wf 6123  ‘cfv 6127  (class class class)co 6910  ℂcc 10257   + caddc 10262   · cmul 10264   ℋchba 28327   +_ℎ cva 28328   ·_ℎ csm 28329  LinFnclf 28362

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-8 2166  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-sep 5007  ax-nul 5015  ax-pow 5067  ax-pr 5129  ax-un 7214  ax-cnex 10315  ax-hilex 28407

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4147  df-if 4309  df-pw 4382  df-sn 4400  df-pr 4402  df-op 4406  df-uni 4661  df-br 4876  df-opab 4938  df-id 5252  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-fv 6135  df-ov 6913  df-oprab 6914  df-mpt2 6915  df-map 8129  df-lnfn 29258

This theorem is referenced by:  lnfnli  29450