| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > supxrleub | Structured version Visualization version GIF version | ||
| Description: The supremum of a set of extended reals is less than or equal to an upper bound. (Contributed by NM, 22-Feb-2006.) (Revised by Mario Carneiro, 6-Sep-2014.) |
| Ref | Expression |
|---|---|
| supxrleub | ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supxrlub 13292 | . . . 4 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 < sup(𝐴, ℝ*, < ) ↔ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥)) | |
| 2 | 1 | notbid 318 | . . 3 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < sup(𝐴, ℝ*, < ) ↔ ¬ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥)) |
| 3 | ralnex 3056 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝐵 < 𝑥 ↔ ¬ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥) | |
| 4 | 2, 3 | bitr4di 289 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < sup(𝐴, ℝ*, < ) ↔ ∀𝑥 ∈ 𝐴 ¬ 𝐵 < 𝑥)) |
| 5 | supxrcl 13282 | . . 3 ⊢ (𝐴 ⊆ ℝ* → sup(𝐴, ℝ*, < ) ∈ ℝ*) | |
| 6 | xrlenlt 11246 | . . 3 ⊢ ((sup(𝐴, ℝ*, < ) ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ¬ 𝐵 < sup(𝐴, ℝ*, < ))) | |
| 7 | 5, 6 | sylan 580 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ¬ 𝐵 < sup(𝐴, ℝ*, < ))) |
| 8 | simpl 482 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → 𝐴 ⊆ ℝ*) | |
| 9 | 8 | sselda 3949 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
| 10 | simplr 768 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
| 11 | 9, 10 | xrlenltd 11247 | . . 3 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ 𝐵 ↔ ¬ 𝐵 < 𝑥)) |
| 12 | 11 | ralbidva 3155 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (∀𝑥 ∈ 𝐴 𝑥 ≤ 𝐵 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝐵 < 𝑥)) |
| 13 | 4, 7, 12 | 3bitr4d 311 | 1 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 ∀wral 3045 ∃wrex 3054 ⊆ wss 3917 class class class wbr 5110 supcsup 9398 ℝ*cxr 11214 < clt 11215 ≤ cle 11216 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9400 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 |
| This theorem is referenced by: supxrre 13294 supxrss 13299 ixxub 13334 limsupgord 15445 limsupgle 15450 prdsxmetlem 24263 ovollb2lem 25396 ovolunlem1 25405 ovoliunlem2 25411 ovolscalem1 25421 ovolicc1 25424 voliunlem2 25459 voliunlem3 25460 uniioovol 25487 uniioombllem3 25493 volsup2 25513 itg2leub 25642 itg2seq 25650 itg2mono 25661 itg2gt0 25668 itg2cn 25671 mdegleb 25976 radcnvlt1 26334 nmoubi 30708 nmopub 31844 nmfnleub 31861 esumgect 34087 prdsbnd 37794 rrnequiv 37836 suplesup2 45379 supxrleubrnmpt 45409 limsupmnflem 45725 liminfval2 45773 sge0fsum 46392 sge0lefi 46403 sge0split 46414 pimdecfgtioo 46722 pimincfltioo 46723 |
| Copyright terms: Public domain | W3C validator |