Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > supxrub | Structured version Visualization version GIF version |
Description: A member of a set of extended reals is less than or equal to the set's supremum. (Contributed by NM, 7-Feb-2006.) |
Ref | Expression |
---|---|
supxrub | ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → 𝐵 ≤ sup(𝐴, ℝ*, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xrltso 11974 | . . . . 5 ⊢ < Or ℝ* | |
2 | 1 | a1i 11 | . . . 4 ⊢ (𝐴 ⊆ ℝ* → < Or ℝ*) |
3 | xrsupss 12139 | . . . 4 ⊢ (𝐴 ⊆ ℝ* → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ* (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) | |
4 | 2, 3 | supub 8365 | . . 3 ⊢ (𝐴 ⊆ ℝ* → (𝐵 ∈ 𝐴 → ¬ sup(𝐴, ℝ*, < ) < 𝐵)) |
5 | 4 | imp 445 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → ¬ sup(𝐴, ℝ*, < ) < 𝐵) |
6 | ssel2 3598 | . . 3 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
7 | supxrcl 12145 | . . . 4 ⊢ (𝐴 ⊆ ℝ* → sup(𝐴, ℝ*, < ) ∈ ℝ*) | |
8 | 7 | adantr 481 | . . 3 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
9 | xrlenlt 10103 | . . 3 ⊢ ((𝐵 ∈ ℝ* ∧ sup(𝐴, ℝ*, < ) ∈ ℝ*) → (𝐵 ≤ sup(𝐴, ℝ*, < ) ↔ ¬ sup(𝐴, ℝ*, < ) < 𝐵)) | |
10 | 6, 8, 9 | syl2anc 693 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → (𝐵 ≤ sup(𝐴, ℝ*, < ) ↔ ¬ sup(𝐴, ℝ*, < ) < 𝐵)) |
11 | 5, 10 | mpbird 247 | 1 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ 𝐴) → 𝐵 ≤ sup(𝐴, ℝ*, < )) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∈ wcel 1990 ⊆ wss 3574 class class class wbr 4653 Or wor 5034 supcsup 8346 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 |
This theorem is referenced by: supxrre 12157 supxrss 12162 ixxub 12196 prdsdsf 22172 prdsxmetlem 22173 xpsdsval 22186 prdsbl 22296 xrge0tsms 22637 bndth 22757 ovolmge0 23245 ovollb2lem 23256 ovolunlem1a 23264 ovoliunlem1 23270 ovoliun 23273 ovolicc2lem4 23288 ioombl1lem2 23327 ioombl1lem4 23329 uniioombllem2 23351 uniioombllem3 23353 uniioombllem6 23356 vitalilem4 23380 itg2ub 23500 itg2seq 23509 itg2monolem1 23517 itg2monolem2 23518 itg2monolem3 23519 aannenlem2 24084 radcnvcl 24171 radcnvle 24174 nmooge0 27622 nmoolb 27626 nmlno0lem 27648 nmoplb 28766 nmfnlb 28783 nmlnop0iALT 28854 xrofsup 29533 xrge0tsmsd 29785 itg2addnc 33464 rrnequiv 33634 supxrubd 39297 supxrgere 39549 supxrgelem 39553 suplesup2 39592 ressiocsup 39781 ressioosup 39782 liminfval2 40000 etransclem48 40499 fsumlesge0 40594 sge0cl 40598 sge0supre 40606 sge0xaddlem1 40650 sge0xaddlem2 40651 |
Copyright terms: Public domain | W3C validator |