Theorem lnfnl 32563

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 32515	. . . . . 6 ⊢ (𝑇 ∈ LinFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧))))
2	1	simprbi 503	. . . . 5 ⊢ (𝑇 ∈ LinFn → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)))
3		oveq1 7450	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ·ℎ 𝑦) = (𝐴 ·ℎ 𝑦))
4	3	fvoveq1d 7465	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)))
5		oveq1 7450	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 · (𝑇‘𝑦)) = (𝐴 · (𝑇‘𝑦)))
6	5	oveq1d 7458	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)))
7	4, 6	eqeq12d 2779	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧))))
8		oveq2 7451	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 ·ℎ 𝑦) = (𝐴 ·ℎ 𝐵))
9	8	fvoveq1d 7465	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)))
10		fveq2 6908	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑇‘𝑦) = (𝑇‘𝐵))
11	10	oveq2d 7459	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝐴 · (𝑇‘𝑦)) = (𝐴 · (𝑇‘𝐵)))
12	11	oveq1d 7458	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)))
13	9, 12	eqeq12d 2779	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑇‘((𝐴 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝑦)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧))))
14		oveq2 7451	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → ((𝐴 ·ℎ 𝐵) +ℎ 𝑧) = ((𝐴 ·ℎ 𝐵) +ℎ 𝐶))
15	14	fveq2d 6912	. . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)))
16		fveq2 6908	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝑇‘𝑧) = (𝑇‘𝐶))
17	16	oveq2d 7459	. . . . . . 7 ⊢ (𝑧 = 𝐶 → ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))
18	15, 17	eqeq12d 2779	. . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝑧)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝑧)) ↔ (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
19	7, 13, 18	rspc3v 3595	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 · (𝑇‘𝑦)) + (𝑇‘𝑧)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
20	2, 19	syl5 35	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
21	20	3expb 1138	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶))))
22	21	impcom 413	. 2 ⊢ ((𝑇 ∈ LinFn ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))
23	22	anassrs 473	1 ⊢ (((𝑇 ∈ LinFn ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 ·ℎ 𝐵) +ℎ 𝐶)) = ((𝐴 · (𝑇‘𝐵)) + (𝑇‘𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  ℂcc 11225   + caddc 11230   · cmul 11232   ℋchba 31551   +_ℎ cva 31552   ·_ℎ csm 31553  LinFnclf 31586

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-hilex 31631

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-lnfn 32480

This theorem is used by:  lnfnli  32672