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 32103

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 11085	. . 3 ⊢ 1 ∈ ℂ
2		lnfnl.1	. . . 4 ⊢ 𝑇 ∈ LinFn
3	2	lnfnli 32100	. . 3 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
4	1, 3	mp3an1 1451	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
5		ax-hvmulid 31066	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 ·_ℎ 𝐴) = 𝐴)
6	5	fvoveq1d 7380	. . 3 ⊢ (𝐴 ∈ ℋ → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
7	6	adantr 480	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
8	2	lnfnfi 32101	. . . . . 6 ⊢ 𝑇: ℋ⟶ℂ
9	8	ffvelcdmi 7027	. . . . 5 ⊢ (𝐴 ∈ ℋ → (𝑇‘𝐴) ∈ ℂ)
10	9	mullidd 11151	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
11	10	adantr 480	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
12	11	oveq1d 7373	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))
13	4, 7, 12	3eqtr3d 2780	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘(𝐴 +_ℎ 𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6490 (class class class)co 7358 ℂcc 11025 1c1 11028 + caddc 11030 · cmul 11032 ℋchba 30979 +_ℎ cva 30980 ·_ℎ csm 30981 LinFnclf 31014

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-mulcl 11089 ax-mulcom 11091 ax-mulass 11093 ax-distr 11094 ax-1rid 11097 ax-cnre 11100 ax-hilex 31059 ax-hvmulid 31066

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 df-ov 7361 df-oprab 7362 df-mpo 7363 df-map 8766 df-lnfn 31908

This theorem is referenced by: lnfnaddmuli 32105 nlelshi 32120

W3C validator