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

Theorem ellnop 32517
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 6915 . . . . . 6 (𝑡 = 𝑇 → (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)))
2 fveq1 6915 . . . . . . . 8 (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
32oveq2d 7467 . . . . . . 7 (𝑡 = 𝑇 → (𝑥 ·ℎ (𝑡‘𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
4 fveq1 6915 . . . . . . 7 (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
53, 4oveq12d 7469 . . . . . 6 (𝑡 = 𝑇 → ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
61, 5eqeq12d 2779 . . . . 5 (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
76ralbidv 3189 . . . 4 (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
872ralbidv 3230 . . 3 (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
9 df-lnop 32500 . . 3 LinOp = {𝑡 ∈ ( ℋ ↑m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧))}
108, 9elrab2 3652 . 2 (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
11 ax-hilex 31658 . . . 4 ℋ ∈ V
1211, 11elmap 8937 . . 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 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  ℂcc 11237   ℋchba 31578   +ℎ cva 31579   ·ℎ csm 31580  LinOpclo 31606
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-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-hilex 31658
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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-lnop 32500
This theorem is used by:  lnopf  32518  lnopl  32573  unoplin  32579  hmoplin  32601  lnopmi  32659  lnophsi  32660  lnopcoi  32662  cnlnadjlem6  32731  adjlnop  32745
  Copyright terms: Public domain W3C validator