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

Theorem lnfnl 30012
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.
StepHypRef Expression
1 ellnfn 29964 . . . . . 6 (𝑇 ∈ LinFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
21simprbi 500 . . . . 5 (𝑇 ∈ LinFn → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
3 oveq1 7220 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · 𝑦) = (𝐴 · 𝑦))
43fvoveq1d 7235 . . . . . . 7 (𝑥 = 𝐴 → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝑦) + 𝑧)))
5 oveq1 7220 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · (𝑇𝑦)) = (𝐴 · (𝑇𝑦)))
65oveq1d 7228 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)))
74, 6eqeq12d 2753 . . . . . 6 (𝑥 = 𝐴 → ((𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧))))
8 oveq2 7221 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
98fvoveq1d 7235 . . . . . . 7 (𝑦 = 𝐵 → (𝑇‘((𝐴 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝑧)))
10 fveq2 6717 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑇𝑦) = (𝑇𝐵))
1110oveq2d 7229 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · (𝑇𝑦)) = (𝐴 · (𝑇𝐵)))
1211oveq1d 7228 . . . . . . 7 (𝑦 = 𝐵 → ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)))
139, 12eqeq12d 2753 . . . . . 6 (𝑦 = 𝐵 → ((𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧))))
14 oveq2 7221 . . . . . . . 8 (𝑧 = 𝐶 → ((𝐴 · 𝐵) + 𝑧) = ((𝐴 · 𝐵) + 𝐶))
1514fveq2d 6721 . . . . . . 7 (𝑧 = 𝐶 → (𝑇‘((𝐴 · 𝐵) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝐶)))
16 fveq2 6717 . . . . . . . 8 (𝑧 = 𝐶 → (𝑇𝑧) = (𝑇𝐶))
1716oveq2d 7229 . . . . . . 7 (𝑧 = 𝐶 → ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
1815, 17eqeq12d 2753 . . . . . 6 (𝑧 = 𝐶 → ((𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
197, 13, 18rspc3v 3550 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
202, 19syl5 34 . . . 4 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
21203expb 1122 . . 3 ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
2221impcom 411 . 2 ((𝑇 ∈ LinFn ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
2322anassrs 471 1 (((𝑇 ∈ LinFn ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wf 6376  cfv 6380  (class class class)co 7213  cc 10727   + caddc 10732   · cmul 10734  chba 29000   + cva 29001   · csm 29002  LinFnclf 29035
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523  ax-cnex 10785  ax-hilex 29080
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-map 8510  df-lnfn 29929
This theorem is referenced by:  lnfnli  30121
  Copyright terms: Public domain W3C validator