| 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 32528 | . . 3 ⊢ (𝑇: ℋ⟶ ℋ → (eigvec‘𝑇) = {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)}) | |
| 2 | 1 | eleq2d 2850 | . 2 ⊢ (𝑇: ℋ⟶ ℋ → (𝐴 ∈ (eigvec‘𝑇) ↔ 𝐴 ∈ {𝑦 ∈ ( ℋ ∖ 0ℋ) ∣ ∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦)})) |
| 3 | eldif 4052 | . . . . 5 ⊢ (𝐴 ∈ ( ℋ ∖ 0ℋ) ↔ (𝐴 ∈ ℋ ∧ ¬ 𝐴 ∈ 0ℋ)) | |
| 4 | elch0 31886 | . . . . . . 7 ⊢ (𝐴 ∈ 0ℋ ↔ 𝐴 = 0ℎ) | |
| 5 | 4 | necon3bbii 3006 | . . . . . 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 6908 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑇‘𝑦) = (𝑇‘𝐴)) | |
| 10 | oveq2 7451 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ·ℎ 𝑦) = (𝑥 ·ℎ 𝐴)) | |
| 11 | 9, 10 | eqeq12d 2779 | . . . . 5 ⊢ (𝑦 = 𝐴 → ((𝑇‘𝑦) = (𝑥 ·ℎ 𝑦) ↔ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 12 | 11 | rexbidv 3190 | . . . 4 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ ℂ (𝑇‘𝑦) = (𝑥 ·ℎ 𝑦) ↔ ∃𝑥 ∈ ℂ (𝑇‘𝐴) = (𝑥 ·ℎ 𝐴))) |
| 13 | 12 | elrab 3648 | . . 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 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 {crab 3416 ∖ cdif 4048 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 ℂcc 11225 ℋchba 31551 ·ℎ csm 31553 0ℎc0v 31556 0ℋc0h 31567 eigveccei 31591 |
| 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 5252 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-hilex 31631 ax-hv0cl 31635 |
| 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-ne 2960 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 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 df-map 8877 df-ch0 31885 df-eigvec 32485 |
| This theorem is used by: eleigvec2 32590 eigvalcl 32593 |
| Copyright terms: Public domain | W3C validator |