| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > eleigvec | Structured version Visualization version GIF version | ||
| Description: Membership in the set of eigenvectors of a Hilbert space operator. (Contributed by NM, 11-Mar-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| eleigvec | ⊢ (𝑇: ℋ⟶ ℋ → (𝐴 ∈ (eigvec‘𝑇) ↔ (𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eigvecval 32499 | . . 3 ⊢ (𝑇: ℋ⟶ ℋ → (eigvec‘𝑇) = {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)}) | |
| 2 | 1 | eleq2d 2846 | . 2 ⊢ (𝑇: ℋ⟶ ℋ → (𝐴 ∈ (eigvec‘𝑇) ↔ 𝐴 ∈ {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)})) |
| 3 | eldif 4049 | . . . . 5 ⊢ (𝐴 ∈ ( ℋ ∖ 0ℋ) ↔ (𝐴 ∈ ℋ ∧ ¬ 𝐴 ∈ 0ℋ)) | |
| 4 | elch0 31857 | . . . . . . 7 ⊢ (𝐴 ∈ 0ℋ ↔ 𝐴 = 0ℎ) | |
| 5 | 4 | necon3bbii 3002 | . . . . . 6 ⊢ (¬ 𝐴 ∈ 0ℋ ↔ 𝐴 ≠ 0ℎ) |
| 6 | 5 | anbi2i 635 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ ¬ 𝐴 ∈ 0ℋ) ↔ (𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ)) |
| 7 | 3, 6 | bitri 278 | . . . 4 ⊢ (𝐴 ∈ ( ℋ ∖ 0ℋ) ↔ (𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ)) |
| 8 | 7 | anbi1i 636 | . . 3 ⊢ ((𝐴 ∈ ( ℋ ∖ 0ℋ) ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴)) ↔ ((𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ) ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 9 | fveq2 6885 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑇‘𝑦) = (𝑇‘𝐴)) | |
| 10 | oveq2 7428 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ·ℎ 𝑦) = (𝑥 ·ℎ 𝐴)) | |
| 11 | 9, 10 | eqeq12d 2776 | . . . . 5 ⊢ (𝑦 = 𝐴 → ((𝑇‘𝑦) = (𝑥 ·ℎ 𝑦) ↔ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 12 | 11 | rexbidv 3186 | . . . 4 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦) ↔ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 13 | 12 | elrab 3644 | . . 3 ⊢ (𝐴 ∈ {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)} ↔ (𝐴 ∈ ( ℋ ∖ 0ℋ) ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 14 | df-3an 1105 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴)) ↔ ((𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ) ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) | |
| 15 | 8, 13, 14 | 3bitr4i 306 | . 2 ⊢ (𝐴 ∈ {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)} ↔ (𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 16 | 2, 15 | bitrdi 290 | 1 ⊢ (𝑇: ℋ⟶ ℋ → (𝐴 ∈ (eigvec‘𝑇) ↔ (𝐴 ∈ ℋ ∧ 𝐴 ≠ 0ℎ ∧ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 {crab 3412 ∖ cdif 4045 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ℂcc 11199 ℋchba 31522 ·ℎ csm 31524 0ℎc0v 31527 0ℋc0h 31538 eigveccei 31562 |
| 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 7751 ax-hilex 31602 ax-hv0cl 31606 |
| 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-ne 2956 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 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 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 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8850 df-ch0 31856 df-eigvec 32456 |
| This theorem is used by: eleigvec2 32561 eigvalcl 32564 |
| Copyright terms: Public domain | W3C validator |