| 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 13349 | . . . 4 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 < sup(𝐴, ℝ*, < ) ↔ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥)) | |
| 2 | 1 | notbid 318 | . . 3 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < sup(𝐴, ℝ*, < ) ↔ ¬ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥)) |
| 3 | ralnex 3061 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝐵 < 𝑥 ↔ ¬ ∃𝑥 ∈ 𝐴 𝐵 < 𝑥) | |
| 4 | 2, 3 | bitr4di 289 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < sup(𝐴, ℝ*, < ) ↔ ∀𝑥 ∈ 𝐴 ¬ 𝐵 < 𝑥)) |
| 5 | supxrcl 13339 | . . 3 ⊢ (𝐴 ⊆ ℝ* → sup(𝐴, ℝ*, < ) ∈ ℝ*) | |
| 6 | xrlenlt 11308 | . . 3 ⊢ ((sup(𝐴, ℝ*, < ) ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ¬ 𝐵 < sup(𝐴, ℝ*, < ))) | |
| 7 | 5, 6 | sylan 580 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (sup(𝐴, ℝ*, < ) ≤ 𝐵 ↔ ¬ 𝐵 < sup(𝐴, ℝ*, < ))) |
| 8 | simpl 482 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → 𝐴 ⊆ ℝ*) | |
| 9 | 8 | sselda 3963 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
| 10 | simplr 768 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
| 11 | 9, 10 | xrlenltd 11309 | . . 3 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ 𝐵 ↔ ¬ 𝐵 < 𝑥)) |
| 12 | 11 | ralbidva 3163 | . 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 2107 ∀wral 3050 ∃wrex 3059 ⊆ wss 3931 class class class wbr 5123 supcsup 9462 ℝ*cxr 11276 < clt 11277 ≤ cle 11278 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214 ax-pre-sup 11215 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-mpt 5206 df-id 5558 df-po 5572 df-so 5573 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-er 8727 df-en 8968 df-dom 8969 df-sdom 8970 df-sup 9464 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 |
| This theorem is referenced by: supxrre 13351 supxrss 13356 ixxub 13390 limsupgord 15491 limsupgle 15496 prdsxmetlem 24324 ovollb2lem 25460 ovolunlem1 25469 ovoliunlem2 25475 ovolscalem1 25485 ovolicc1 25488 voliunlem2 25523 voliunlem3 25524 uniioovol 25551 uniioombllem3 25557 volsup2 25577 itg2leub 25706 itg2seq 25714 itg2mono 25725 itg2gt0 25732 itg2cn 25735 mdegleb 26040 radcnvlt1 26398 nmoubi 30720 nmopub 31856 nmfnleub 31873 esumgect 34066 prdsbnd 37775 rrnequiv 37817 suplesup2 45359 supxrleubrnmpt 45389 limsupmnflem 45707 liminfval2 45755 sge0fsum 46374 sge0lefi 46385 sge0split 46396 pimdecfgtioo 46704 pimincfltioo 46705 |
| Copyright terms: Public domain | W3C validator |