Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > supxrcl | Structured version Visualization version GIF version |
Description: The supremum of an arbitrary set of extended reals is an extended real. (Contributed by NM, 24-Oct-2005.) |
Ref | Expression |
---|---|
supxrcl | ⊢ (𝐴 ⊆ ℝ* → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xrltso 12537 | . . 3 ⊢ < Or ℝ* | |
2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ⊆ ℝ* → < Or ℝ*) |
3 | xrsupss 12705 | . 2 ⊢ (𝐴 ⊆ ℝ* → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ* (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) | |
4 | 2, 3 | supcl 8924 | 1 ⊢ (𝐴 ⊆ ℝ* → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2114 ⊆ wss 3938 Or wor 5475 supcsup 8906 ℝ*cxr 10676 < clt 10677 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 |
This theorem is referenced by: supxrun 12712 supxrmnf 12713 supxrbnd1 12717 supxrbnd2 12718 supxrub 12720 supxrleub 12722 supxrre 12723 supxrbnd 12724 supxrgtmnf 12725 supxrre1 12726 supxrre2 12727 supxrss 12728 ixxub 12762 limsupgord 14831 limsupcl 14832 limsupgf 14834 prdsdsf 22979 xpsdsval 22993 xrge0tsms 23444 elovolm 24078 ovolmge0 24080 ovolgelb 24083 ovollb2lem 24091 ovolunlem1a 24099 ovoliunlem1 24105 ovoliunlem2 24106 ovoliun 24108 ovolscalem1 24116 ovolicc1 24119 ovolicc2lem4 24123 voliunlem2 24154 voliunlem3 24155 ioombl1lem2 24162 uniioovol 24182 uniiccvol 24183 uniioombllem1 24184 uniioombllem3 24188 itg2cl 24335 itg2seq 24345 itg2monolem2 24354 itg2monolem3 24355 itg2mono 24356 mdeglt 24661 mdegxrcl 24663 radcnvcl 25007 nmoxr 28545 nmopxr 29645 nmfnxr 29658 xrofsup 30494 supxrnemnf 30495 xrge0tsmsd 30694 mblfinlem3 34933 mblfinlem4 34934 ismblfin 34935 itg2addnclem 34945 itg2gt0cn 34949 binomcxplemdvbinom 40692 binomcxplemcvg 40693 binomcxplemnotnn0 40695 supxrcld 41380 supxrgere 41608 supxrgelem 41612 supxrge 41613 suplesup 41614 suplesup2 41651 supxrcli 41715 liminfval2 42056 liminflelimsuplem 42063 sge0cl 42670 sge0xaddlem1 42722 sge0xaddlem2 42723 sge0reuz 42736 |
Copyright terms: Public domain | W3C validator |