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

Theorem hfsmval 32386
Description: Value of the sum of two Hilbert space functionals. (Contributed by NM, 23-May-2006.) (Revised by Mario Carneiro, 23-Aug-2014.) (New usage is discouraged.)
Assertion
Ref Expression
hfsmval ((𝑆: ℋ⟶ℂ ∧ 𝑇: ℋ⟶ℂ) → (𝑆 +fn 𝑇) = (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑇‘𝑥))))
Distinct variable groups:   𝑥,𝑆   𝑥,𝑇

Proof of Theorem hfsmval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnex 11318 . . 3 ℂ ∈ V
2 ax-hilex 31647 . . 3 ℋ ∈ V
31, 2elmap 8935 . 2 (𝑆 ∈ (ℂ ↑m ℋ) ↔ 𝑆: ℋ⟶ℂ)
41, 2elmap 8935 . 2 (𝑇 ∈ (ℂ ↑m ℋ) ↔ 𝑇: ℋ⟶ℂ)
5 fveq1 6913 . . . . 5 (𝑓 = 𝑆 → (𝑓‘𝑥) = (𝑆‘𝑥))
65oveq1d 7464 . . . 4 (𝑓 = 𝑆 → ((𝑓‘𝑥) + (𝑔‘𝑥)) = ((𝑆‘𝑥) + (𝑔‘𝑥)))
76mpteq2dv 5203 . . 3 (𝑓 = 𝑆 → (𝑥 ∈ ℋ ↦ ((𝑓‘𝑥) + (𝑔‘𝑥))) = (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑔‘𝑥))))
8 fveq1 6913 . . . . 5 (𝑔 = 𝑇 → (𝑔‘𝑥) = (𝑇‘𝑥))
98oveq2d 7465 . . . 4 (𝑔 = 𝑇 → ((𝑆‘𝑥) + (𝑔‘𝑥)) = ((𝑆‘𝑥) + (𝑇‘𝑥)))
109mpteq2dv 5203 . . 3 (𝑔 = 𝑇 → (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑔‘𝑥))) = (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑇‘𝑥))))
11 df-hfsum 32381 . . 3 +fn = (𝑓 ∈ (ℂ ↑m ℋ), 𝑔 ∈ (ℂ ↑m ℋ) ↦ (𝑥 ∈ ℋ ↦ ((𝑓‘𝑥) + (𝑔‘𝑥))))
122mptex 7258 . . 3 (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑇‘𝑥))) ∈ V
137, 10, 11, 12ovmpo 7610 . 2 ((𝑆 ∈ (ℂ ↑m ℋ) ∧ 𝑇 ∈ (ℂ ↑m ℋ)) → (𝑆 +fn 𝑇) = (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑇‘𝑥))))
143, 4, 13syl2anbr 611 1 ((𝑆: ℋ⟶ℂ ∧ 𝑇: ℋ⟶ℂ) → (𝑆 +fn 𝑇) = (𝑥 ∈ ℋ ↦ ((𝑆‘𝑥) + (𝑇‘𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5190  ⟶wf 6560  ‘cfv 6564  (class class class)co 7449   ↑m cmap 8883  ℂcc 11235   + caddc 11240   ℋchba 31567   +fn chfs 31589
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-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-cnex 11293  ax-hilex 31647
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-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-ov 7452  df-oprab 7453  df-mpo 7454  df-map 8885  df-hfsum 32381
This theorem is used by:  hfsval  32391
  Copyright terms: Public domain W3C validator