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

Theorem ellnop 32453
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 6882 . . . . . 6 (𝑡 = 𝑇 → (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)))
2 fveq1 6882 . . . . . . . 8 (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
32oveq2d 7434 . . . . . . 7 (𝑡 = 𝑇 → (𝑥 ·ℎ (𝑡‘𝑦)) = (𝑥 ·ℎ (𝑇‘𝑦)))
4 fveq1 6882 . . . . . . 7 (𝑡 = 𝑇 → (𝑡‘𝑧) = (𝑇‘𝑧))
53, 4oveq12d 7436 . . . . . 6 (𝑡 = 𝑇 → ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧)))
61, 5eqeq12d 2777 . . . . 5 (𝑡 = 𝑇 → ((𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
76ralbidv 3186 . . . 4 (𝑡 = 𝑇 → (∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
872ralbidv 3227 . . 3 (𝑡 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
9 df-lnop 32436 . . 3 LinOp = {𝑡 ∈ ( ℋ ↑m ℋ) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑡‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑡‘𝑦)) +ℎ (𝑡‘𝑧))}
108, 9elrab2 3649 . 2 (𝑇 ∈ LinOp ↔ (𝑇 ∈ ( ℋ ↑m ℋ) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·ℎ 𝑦) +ℎ 𝑧)) = ((𝑥 ·ℎ (𝑇‘𝑦)) +ℎ (𝑇‘𝑧))))
11 ax-hilex 31594 . . . 4 ℋ ∈ V
1211, 11elmap 8892 . . 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 2145  ∀wral 3077  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ↑m cmap 8840  ℂcc 11191   ℋchba 31514   +ℎ cva 31515   ·ℎ csm 31516  LinOpclo 31542
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-hilex 31594
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-map 8842  df-lnop 32436
This theorem is used by:  lnopf  32454  lnopl  32509  unoplin  32515  hmoplin  32537  lnopmi  32595  lnophsi  32596  lnopcoi  32598  cnlnadjlem6  32667  adjlnop  32681
  Copyright terms: Public domain W3C validator