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 32627

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 11239	. . 3 ⊢ 1 ∈ ℂ
2		lnfnl.1	. . . 4 ⊢ 𝑇 ∈ LinFn
3	2	lnfnli 32624	. . 3 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
4	1, 3	mp3an1 1477	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)))
5		ax-hvmulid 31590	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 ·_ℎ 𝐴) = 𝐴)
6	5	fvoveq1d 7434	. . 3 ⊢ (𝐴 ∈ ℋ → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
7	6	adantr 486	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘((1 ·_ℎ 𝐴) +_ℎ 𝐵)) = (𝑇‘(𝐴 +_ℎ 𝐵)))
8	2	lnfnfi 32625	. . . . . 6 ⊢ 𝑇: ℋ⟶ℂ
9	8	ffvelcdmi 7075	. . . . 5 ⊢ (𝐴 ∈ ℋ → (𝑇‘𝐴) ∈ ℂ)
10	9	mullidd 11308	. . . 4 ⊢ (𝐴 ∈ ℋ → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
11	10	adantr 486	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (1 · (𝑇‘𝐴)) = (𝑇‘𝐴))
12	11	oveq1d 7427	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((1 · (𝑇‘𝐴)) + (𝑇‘𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))
13	4, 7, 12	3eqtr3d 2804	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑇‘(𝐴 +_ℎ 𝐵)) = ((𝑇‘𝐴) + (𝑇‘𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6531 (class class class)co 7412 ℂcc 11179 1c1 11182 + caddc 11184 · cmul 11186 ℋchba 31503 +_ℎ cva 31504 ·_ℎ csm 31505 LinFnclf 31538

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-mulcl 11243 ax-mulcom 11245 ax-mulass 11247 ax-distr 11248 ax-1rid 11251 ax-cnre 11254 ax-hilex 31583 ax-hvmulid 31590

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-map 8833 df-lnfn 32432

This theorem is used by: lnfnaddmuli 32629 nlelshi 32644

W3C validator