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

Theorem lnfnl 29635
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 29587 . . . . . 6 (𝑇 ∈ LinFn ↔ (𝑇: ℋ⟶ℂ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧))))
21simprbi 497 . . . . 5 (𝑇 ∈ LinFn → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)))
3 oveq1 7152 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · 𝑦) = (𝐴 · 𝑦))
43fvoveq1d 7167 . . . . . . 7 (𝑥 = 𝐴 → (𝑇‘((𝑥 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝑦) + 𝑧)))
5 oveq1 7152 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥 · (𝑇𝑦)) = (𝐴 · (𝑇𝑦)))
65oveq1d 7160 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)))
74, 6eqeq12d 2834 . . . . . 6 (𝑥 = 𝐴 → ((𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧))))
8 oveq2 7153 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
98fvoveq1d 7167 . . . . . . 7 (𝑦 = 𝐵 → (𝑇‘((𝐴 · 𝑦) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝑧)))
10 fveq2 6663 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑇𝑦) = (𝑇𝐵))
1110oveq2d 7161 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · (𝑇𝑦)) = (𝐴 · (𝑇𝐵)))
1211oveq1d 7160 . . . . . . 7 (𝑦 = 𝐵 → ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)))
139, 12eqeq12d 2834 . . . . . 6 (𝑦 = 𝐵 → ((𝑇‘((𝐴 · 𝑦) + 𝑧)) = ((𝐴 · (𝑇𝑦)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧))))
14 oveq2 7153 . . . . . . . 8 (𝑧 = 𝐶 → ((𝐴 · 𝐵) + 𝑧) = ((𝐴 · 𝐵) + 𝐶))
1514fveq2d 6667 . . . . . . 7 (𝑧 = 𝐶 → (𝑇‘((𝐴 · 𝐵) + 𝑧)) = (𝑇‘((𝐴 · 𝐵) + 𝐶)))
16 fveq2 6663 . . . . . . . 8 (𝑧 = 𝐶 → (𝑇𝑧) = (𝑇𝐶))
1716oveq2d 7161 . . . . . . 7 (𝑧 = 𝐶 → ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
1815, 17eqeq12d 2834 . . . . . 6 (𝑧 = 𝐶 → ((𝑇‘((𝐴 · 𝐵) + 𝑧)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝑧)) ↔ (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
197, 13, 18rspc3v 3633 . . . . 5 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 · (𝑇𝑦)) + (𝑇𝑧)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
202, 19syl5 34 . . . 4 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
21203expb 1112 . . 3 ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇 ∈ LinFn → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶))))
2221impcom 408 . 2 ((𝑇 ∈ LinFn ∧ (𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ))) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
2322anassrs 468 1 (((𝑇 ∈ LinFn ∧ 𝐴 ∈ ℂ) ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → (𝑇‘((𝐴 · 𝐵) + 𝐶)) = ((𝐴 · (𝑇𝐵)) + (𝑇𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1079   = wceq 1528  wcel 2105  wral 3135  wf 6344  cfv 6348  (class class class)co 7145  cc 10523   + caddc 10528   · cmul 10530  chba 28623   + cva 28624   · csm 28625  LinFnclf 28658
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581  ax-hilex 28703
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-ov 7148  df-oprab 7149  df-mpo 7150  df-map 8397  df-lnfn 29552
This theorem is referenced by:  lnfnli  29744
  Copyright terms: Public domain W3C validator