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

Theorem ellnop 32466
Description: Property defining a linear Hilbert space operator. (Contributed by NM, 18-Jan-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Assertion
Ref Expression
ellnop (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
Distinct variable group:   𝑥,𝑦,𝑧,𝑇

Proof of Theorem ellnop
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 fveq1 6885 . . . . . 6 (𝑡 = 𝑇 → (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)))
2 fveq1 6885 . . . . . . . 8 (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
32oveq2d 7437 . . . . . . 7 (𝑡 = 𝑇 → (𝑥 ·ℎ (𝑡‘𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
4 fveq1 6885 . . . . . . 7 (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
53, 4oveq12d 7439 . . . . . 6 (𝑡 = 𝑇 → ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
61, 5eqeq12d 2776 . . . . 5 (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
76ralbidv 3185 . . . 4 (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
872ralbidv 3226 . . 3 (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
9 df-lnop 32449 . . 3 LinOp = {𝑡 ∈ ( ℋ ↑m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧))}
108, 9elrab2 3648 . 2 (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
11 ax-hilex 31607 . . . 4 ℋ ∈ V
1211, 11elmap 8903 . . 3 (𝑇 ∈ ( ℋ ↑m ℋ) ↔ 𝑇: ℋ⟶ ℋ)
1312anbi1i 636 . 2 ((𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))) ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
1410, 13bitri 278 1 (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421   ↑m cmap 8851  ℂcc 11202   ℋchba 31527   +ℎ cva 31528   ·ℎ csm 31529  LinOpclo 31555
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-hilex 31607
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-map 8853  df-lnop 32449
This theorem is used by:  lnopf  32467  lnopl  32522  unoplin  32528  hmoplin  32550  lnopmi  32608  lnophsi  32609  lnopcoi  32611  cnlnadjlem6  32680  adjlnop  32694
  Copyright terms: Public domain W3C validator