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

Theorem lnfnl 31608
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 31560 . . . . . 6 (𝑇 ∈ LinFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
21simprbi 496 . . . . 5 (𝑇 ∈ LinFn → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
3 oveq1 7408 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · 𝑦) = (𝐴 · 𝑦))
43fvoveq1d 7423 . . . . . . 7 (𝑥 = 𝐴 → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝑦) + 𝑧)))
5 oveq1 7408 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · (𝑇𝑦)) = (𝐴 · (𝑇𝑦)))
65oveq1d 7416 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)))
74, 6eqeq12d 2740 . . . . . 6 (𝑥 = 𝐴 → ((𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧))))
8 oveq2 7409 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
98fvoveq1d 7423 . . . . . . 7 (𝑦 = 𝐵 → (𝑇‘((𝐴 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝑧)))
10 fveq2 6881 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑇𝑦) = (𝑇𝐵))
1110oveq2d 7417 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · (𝑇𝑦)) = (𝐴 · (𝑇𝐵)))
1211oveq1d 7416 . . . . . . 7 (𝑦 = 𝐵 → ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)))
139, 12eqeq12d 2740 . . . . . 6 (𝑦 = 𝐵 → ((𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧))))
14 oveq2 7409 . . . . . . . 8 (𝑧 = 𝐶 → ((𝐴 · 𝐵) + 𝑧) = ((𝐴 · 𝐵) + 𝐶))
1514fveq2d 6885 . . . . . . 7 (𝑧 = 𝐶 → (𝑇‘((𝐴 · 𝐵) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝐶)))
16 fveq2 6881 . . . . . . . 8 (𝑧 = 𝐶 → (𝑇𝑧) = (𝑇𝐶))
1716oveq2d 7417 . . . . . . 7 (𝑧 = 𝐶 → ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
1815, 17eqeq12d 2740 . . . . . 6 (𝑧 = 𝐶 → ((𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
197, 13, 18rspc3v 3619 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
202, 19syl5 34 . . . 4 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
21203expb 1117 . . 3 ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
2221impcom 407 . 2 ((𝑇 ∈ LinFn ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
2322anassrs 467 1 (((𝑇 ∈ LinFn ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1084   = wceq 1533  wcel 2098  wral 3053  wf 6529  cfv 6533  (class class class)co 7401  cc 11103   + caddc 11108   · cmul 11110  chba 30596   + cva 30597   · csm 30598  LinFnclf 30631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718  ax-cnex 11161  ax-hilex 30676
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ral 3054  df-rex 3063  df-rab 3425  df-v 3468  df-sbc 3770  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-br 5139  df-opab 5201  df-id 5564  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7404  df-oprab 7405  df-mpo 7406  df-map 8817  df-lnfn 31525
This theorem is referenced by:  lnfnli  31717
  Copyright terms: Public domain W3C validator