| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > stle0i | Structured version Visualization version GIF version | ||
| Description: If a state is less than or equal to 0, it is 0. (Contributed by NM, 11-Nov-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sto1.1 | ⊢ 𝐴 ∈ Cℋ |
| Ref | Expression |
|---|---|
| stle0i | ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 0 ↔ (𝑆‘𝐴) = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sto1.1 | . . . . . 6 ⊢ 𝐴 ∈ Cℋ | |
| 2 | stge0 32841 | . . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → 0 ≤ (𝑆‘𝐴))) | |
| 3 | 1, 2 | mpi 21 | . . . . 5 ⊢ (𝑆 ∈ States → 0 ≤ (𝑆‘𝐴)) |
| 4 | 3 | anim2i 629 | . . . 4 ⊢ (((𝑆‘𝐴) ≤ 0 ∧ 𝑆 ∈ States) → ((𝑆‘𝐴) ≤ 0 ∧ 0 ≤ (𝑆‘𝐴))) |
| 5 | 4 | expcom 419 | . . 3 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 0 → ((𝑆‘𝐴) ≤ 0 ∧ 0 ≤ (𝑆‘𝐴)))) |
| 6 | stcl 32833 | . . . . 5 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ ℝ)) | |
| 7 | 1, 6 | mpi 21 | . . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℝ) |
| 8 | 0re 11323 | . . . 4 ⊢ 0 ∈ ℝ | |
| 9 | letri3 11408 | . . . 4 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 0 ∈ ℝ) → ((𝑆‘𝐴) = 0 ↔ ((𝑆‘𝐴) ≤ 0 ∧ 0 ≤ (𝑆‘𝐴)))) | |
| 10 | 7, 8, 9 | sylancl 598 | . . 3 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) = 0 ↔ ((𝑆‘𝐴) ≤ 0 ∧ 0 ≤ (𝑆‘𝐴)))) |
| 11 | 5, 10 | sylibrd 262 | . 2 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 0 → (𝑆‘𝐴) = 0)) |
| 12 | 0le0 12457 | . . 3 ⊢ 0 ≤ 0 | |
| 13 | breq1 5109 | . . 3 ⊢ ((𝑆‘𝐴) = 0 → ((𝑆‘𝐴) ≤ 0 ↔ 0 ≤ 0)) | |
| 14 | 12, 13 | mpbiri 261 | . 2 ⊢ ((𝑆‘𝐴) = 0 → (𝑆‘𝐴) ≤ 0) |
| 15 | 11, 14 | impbid1 228 | 1 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) ≤ 0 ↔ (𝑆‘𝐴) = 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 class class class wbr 5106 ‘cfv 6547 ℝcr 11212 0cc0 11213 ≤ cle 11357 Cℋ cch 31546 Statescst 31579 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-i2m1 11281 ax-1ne0 11282 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-hilex 31616 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 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-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-ov 7433 df-oprab 7434 df-mpo 7435 df-er 8731 df-map 8863 df-en 8988 df-dom 8989 df-sdom 8990 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-icc 13496 df-sh 31824 df-ch 31838 df-st 32828 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |