Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > leopg | Structured version Visualization version GIF version |
Description: Ordering relation for positive operators. Definition of positive operator ordering in [Kreyszig] p. 470. (Contributed by NM, 23-Jul-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
leopg | ⊢ ((𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐵) → (𝑇 ≤op 𝑈 ↔ ((𝑈 −op 𝑇) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 6557 | . . . 4 ⊢ (𝑡 = 𝑇 → (𝑢 −op 𝑡) = (𝑢 −op 𝑇)) | |
2 | 1 | eleq1d 2672 | . . 3 ⊢ (𝑡 = 𝑇 → ((𝑢 −op 𝑡) ∈ HrmOp ↔ (𝑢 −op 𝑇) ∈ HrmOp)) |
3 | 1 | fveq1d 6105 | . . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑢 −op 𝑡)‘𝑥) = ((𝑢 −op 𝑇)‘𝑥)) |
4 | 3 | oveq1d 6564 | . . . . 5 ⊢ (𝑡 = 𝑇 → (((𝑢 −op 𝑡)‘𝑥) ·ih 𝑥) = (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥)) |
5 | 4 | breq2d 4595 | . . . 4 ⊢ (𝑡 = 𝑇 → (0 ≤ (((𝑢 −op 𝑡)‘𝑥) ·ih 𝑥) ↔ 0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥))) |
6 | 5 | ralbidv 2969 | . . 3 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑡)‘𝑥) ·ih 𝑥) ↔ ∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥))) |
7 | 2, 6 | anbi12d 743 | . 2 ⊢ (𝑡 = 𝑇 → (((𝑢 −op 𝑡) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑡)‘𝑥) ·ih 𝑥)) ↔ ((𝑢 −op 𝑇) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥)))) |
8 | oveq1 6556 | . . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 −op 𝑇) = (𝑈 −op 𝑇)) | |
9 | 8 | eleq1d 2672 | . . 3 ⊢ (𝑢 = 𝑈 → ((𝑢 −op 𝑇) ∈ HrmOp ↔ (𝑈 −op 𝑇) ∈ HrmOp)) |
10 | 8 | fveq1d 6105 | . . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝑢 −op 𝑇)‘𝑥) = ((𝑈 −op 𝑇)‘𝑥)) |
11 | 10 | oveq1d 6564 | . . . . 5 ⊢ (𝑢 = 𝑈 → (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥) = (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥)) |
12 | 11 | breq2d 4595 | . . . 4 ⊢ (𝑢 = 𝑈 → (0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥) ↔ 0 ≤ (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥))) |
13 | 12 | ralbidv 2969 | . . 3 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥) ↔ ∀𝑥 ∈ ℋ 0 ≤ (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥))) |
14 | 9, 13 | anbi12d 743 | . 2 ⊢ (𝑢 = 𝑈 → (((𝑢 −op 𝑇) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑇)‘𝑥) ·ih 𝑥)) ↔ ((𝑈 −op 𝑇) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥)))) |
15 | df-leop 28095 | . 2 ⊢ ≤op = {〈𝑡, 𝑢〉 ∣ ((𝑢 −op 𝑡) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑢 −op 𝑡)‘𝑥) ·ih 𝑥))} | |
16 | 7, 14, 15 | brabg 4919 | 1 ⊢ ((𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐵) → (𝑇 ≤op 𝑈 ↔ ((𝑈 −op 𝑇) ∈ HrmOp ∧ ∀𝑥 ∈ ℋ 0 ≤ (((𝑈 −op 𝑇)‘𝑥) ·ih 𝑥)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 0cc0 9815 ≤ cle 9954 ℋchil 27160 ·ih csp 27163 −op chod 27181 HrmOpcho 27191 ≤op cleo 27199 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-iota 5768 df-fv 5812 df-ov 6552 df-leop 28095 |
This theorem is referenced by: leop 28366 leoprf2 28370 |
Copyright terms: Public domain | W3C validator |