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

Theorem adjmo 32443
Description: Every Hilbert space operator has at most one adjoint. (Contributed by NM, 18-Feb-2006.) (New usage is discouraged.)
Assertion
Ref Expression
adjmo ∃*𝑢(𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦))
Distinct variable group:   𝑥,𝑦,𝑢,𝑇

Proof of Theorem adjmo
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 r19.26-2 3147 . . . . . 6 (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)) ↔ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)))
2 eqtr2 2781 . . . . . . 7 (((𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)) → ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦))
322ralimi 3132 . . . . . 6 (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)) → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦))
41, 3sylbir 238 . . . . 5 ((∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)) → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦))
5 hoeq1 32441 . . . . . 6 ((𝑢: ℋ⟶ ℋ ∧ 𝑣: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦) ↔ 𝑢 = 𝑣))
65biimpa 482 . . . . 5 (((𝑢: ℋ⟶ ℋ ∧ 𝑣: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦)) → 𝑢 = 𝑣)
74, 6sylan2 605 . . . 4 (((𝑢: ℋ⟶ ℋ ∧ 𝑣: ℋ⟶ ℋ) ∧ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦))) → 𝑢 = 𝑣)
87an4s 673 . . 3 (((𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦)) ∧ (𝑣: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦))) → 𝑢 = 𝑣)
98gen2 1828 . 2 ∀𝑢∀𝑣(((𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦)) ∧ (𝑣: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦))) → 𝑢 = 𝑣)
10 feq1 6692 . . . 4 (𝑢 = 𝑣 → (𝑢: ℋ⟶ ℋ ↔ 𝑣: ℋ⟶ ℋ))
11 fveq1 6889 . . . . . . 7 (𝑢 = 𝑣 → (𝑢‘𝑥) = (𝑣‘𝑥))
1211oveq1d 7439 . . . . . 6 (𝑢 = 𝑣 → ((𝑢‘𝑥) ·ih 𝑦) = ((𝑣‘𝑥) ·ih 𝑦))
1312eqeq2d 2771 . . . . 5 (𝑢 = 𝑣 → ((𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ↔ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)))
14132ralbidv 3226 . . . 4 (𝑢 = 𝑣 → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦)))
1510, 14anbi12d 644 . . 3 (𝑢 = 𝑣 → ((𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦)) ↔ (𝑣: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦))))
1615mo4 2591 . 2 (∃*𝑢(𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦)) ↔ ∀𝑢∀𝑣(((𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦)) ∧ (𝑣: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑣‘𝑥) ·ih 𝑦))) → 𝑢 = 𝑣))
179, 16mpbir 234 1 ∃*𝑢(𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·ih (𝑇‘𝑦)) = ((𝑢‘𝑥) ·ih 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃*wmo 2562  ∀wral 3076  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424   ℋchba 31530   ·ih csp 31533
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-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-mulcom 11271  ax-addass 11272  ax-mulass 11273  ax-distr 11274  ax-i2m1 11275  ax-1ne0 11276  ax-1rid 11277  ax-rnegex 11278  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281  ax-pre-lttrn 11282  ax-pre-ltadd 11283  ax-hfvadd 31611  ax-hvcom 31612  ax-hvass 31613  ax-hv0cl 31614  ax-hvaddid 31615  ax-hfvmul 31616  ax-hvmulid 31617  ax-hvdistr2 31620  ax-hvmul0 31621  ax-hfi 31690  ax-his2 31694  ax-his3 31695  ax-his4 31696
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-po 5559  df-so 5560  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-er 8724  df-en 8981  df-dom 8982  df-sdom 8983  df-pnf 11352  df-mnf 11353  df-ltxr 11355  df-sub 11550  df-neg 11551  df-hvsub 31582
This theorem is used by:  funadj  32497  adjeu  32500  cnlnadjeui  32688
  Copyright terms: Public domain W3C validator