lnfnaddi - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > lnfnaddi		Structured version Visualization version GIF version

Theorem lnfnaddi 30306

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

**Hypothesis**
Ref	Expression
lnfnl.1	⊢ 𝑇 ∈ LinFn

**Assertion**
Ref	Expression
lnfnaddi	⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘(𝐴 +_ℎ 𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))

**Proof of Theorem lnfnaddi**
Step	Hyp	Ref	Expression
1		ax-1cn 10860	. . 3 ⊢ 1 ∈ ℂ
2		lnfnl.1	. . . 4 ⊢ 𝑇 ∈ LinFn
3	2	lnfnli 30303	. . 3 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
4	1, 3	mp3an1 1446	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
5		ax-hvmulid 29269	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 ·_ℎ 𝐴) = 𝐴)
6	5	fvoveq1d 7277	. . 3 ⊢ (𝐴 ∈ ℋ → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
7	6	adantr 480	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
8	2	lnfnfi 30304	. . . . . 6 ⊢ 𝑇: ℋ⟶ℂ
9	8	ffvelrni 6942	. . . . 5 ⊢ (𝐴 ∈ ℋ → (𝑇‘𝐴) ∈ ℂ)
10	9	mulid2d 10924	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
11	10	adantr 480	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
12	11	oveq1d 7270	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))
13	4, 7, 12	3eqtr3d 2786	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘(𝐴 +_ℎ 𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 1c1 10803 + caddc 10805 · cmul 10807 ℋchba 29182 +_ℎ cva 29183 ·_ℎ csm 29184 LinFnclf 29217

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-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-mulcl 10864 ax-mulcom 10866 ax-mulass 10868 ax-distr 10869 ax-1rid 10872 ax-cnre 10875 ax-hilex 29262 ax-hvmulid 29269

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-lnfn 30111

This theorem is referenced by: lnfnaddmuli 30308 nlelshi 30323

W3C validator