| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > stge1i | Structured version Visualization version GIF version | ||
| Description: If a state is greater than or equal to 1, it is 1. (Contributed by NM, 11-Nov-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sto1.1 | ⊢ 𝐴 ∈ Cℋ |
| Ref | Expression |
|---|---|
| stge1i | ⊢ (𝑆 ∈ States → (1 ≤ (𝑆‘𝐴) ↔ (𝑆‘𝐴) = 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sto1.1 | . . . . . 6 ⊢ 𝐴 ∈ Cℋ | |
| 2 | stle1 32839 | . . . . . 6 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ≤ 1)) | |
| 3 | 1, 2 | mpi 21 | . . . . 5 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ≤ 1) |
| 4 | 3 | anim1i 627 | . . . 4 ⊢ ((𝑆 ∈ States ∧ 1 ≤ (𝑆‘𝐴)) → ((𝑆‘𝐴) ≤ 1 ∧ 1 ≤ (𝑆‘𝐴))) |
| 5 | 4 | ex 418 | . . 3 ⊢ (𝑆 ∈ States → (1 ≤ (𝑆‘𝐴) → ((𝑆‘𝐴) ≤ 1 ∧ 1 ≤ (𝑆‘𝐴)))) |
| 6 | stcl 32830 | . . . . 5 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ ℝ)) | |
| 7 | 1, 6 | mpi 21 | . . . 4 ⊢ (𝑆 ∈ States → (𝑆‘𝐴) ∈ ℝ) |
| 8 | 1re 11318 | . . . 4 ⊢ 1 ∈ ℝ | |
| 9 | letri3 11405 | . . . 4 ⊢ (((𝑆‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ) → ((𝑆‘𝐴) = 1 ↔ ((𝑆‘𝐴) ≤ 1 ∧ 1 ≤ (𝑆‘𝐴)))) | |
| 10 | 7, 8, 9 | sylancl 598 | . . 3 ⊢ (𝑆 ∈ States → ((𝑆‘𝐴) = 1 ↔ ((𝑆‘𝐴) ≤ 1 ∧ 1 ≤ (𝑆‘𝐴)))) |
| 11 | 5, 10 | sylibrd 262 | . 2 ⊢ (𝑆 ∈ States → (1 ≤ (𝑆‘𝐴) → (𝑆‘𝐴) = 1)) |
| 12 | 1le1 11954 | . . 3 ⊢ 1 ≤ 1 | |
| 13 | breq2 5109 | . . 3 ⊢ ((𝑆‘𝐴) = 1 → (1 ≤ (𝑆‘𝐴) ↔ 1 ≤ 1)) | |
| 14 | 12, 13 | mpbiri 261 | . 2 ⊢ ((𝑆‘𝐴) = 1 → 1 ≤ (𝑆‘𝐴)) |
| 15 | 11, 14 | impbid1 228 | 1 ⊢ (𝑆 ∈ States → (1 ≤ (𝑆‘𝐴) ↔ (𝑆‘𝐴) = 1)) |
| 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 5105 ‘cfv 6546 ℝcr 11209 1c1 11211 ≤ cle 11354 Cℋ cch 31543 Statescst 31576 |
| 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 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-i2m1 11278 ax-1ne0 11279 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-hilex 31613 |
| 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 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-po 5562 df-so 5563 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7430 df-oprab 7431 df-mpo 7432 df-er 8728 df-map 8860 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-icc 13493 df-sh 31821 df-ch 31835 df-st 32825 |
| This theorem is used by: stm1i 32857 |
| Copyright terms: Public domain | W3C validator |