![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > suprub | Structured version Visualization version GIF version |
Description: A member of a nonempty bounded set of reals is less than or equal to the set's upper bound. (Contributed by NM, 12-Oct-2004.) |
Ref | Expression |
---|---|
suprub | ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ∧ 𝐵 ∈ 𝐴) → 𝐵 ≤ sup(𝐴, ℝ, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1137 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → 𝐴 ⊆ ℝ) | |
2 | 1 | sselda 3982 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ ℝ) |
3 | suprcl 12171 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → sup(𝐴, ℝ, < ) ∈ ℝ) | |
4 | 3 | adantr 482 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ∧ 𝐵 ∈ 𝐴) → sup(𝐴, ℝ, < ) ∈ ℝ) |
5 | ltso 11291 | . . . . 5 ⊢ < Or ℝ | |
6 | 5 | a1i 11 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → < Or ℝ) |
7 | sup3 12168 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) | |
8 | 6, 7 | supub 9451 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → (𝐵 ∈ 𝐴 → ¬ sup(𝐴, ℝ, < ) < 𝐵)) |
9 | 8 | imp 408 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ∧ 𝐵 ∈ 𝐴) → ¬ sup(𝐴, ℝ, < ) < 𝐵) |
10 | 2, 4, 9 | nltled 11361 | 1 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ∧ 𝐵 ∈ 𝐴) → 𝐵 ≤ sup(𝐴, ℝ, < )) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1088 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ⊆ wss 3948 ∅c0 4322 class class class wbr 5148 Or wor 5587 supcsup 9432 ℝcr 11106 < clt 11245 ≤ cle 11246 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-sup 9434 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 |
This theorem is referenced by: suprubd 12173 supaddc 12178 supadd 12179 supmul1 12180 supmullem1 12181 supmul 12183 suprubii 12186 suprzcl 12639 rpnnen1lem5 12962 supicc 13475 01sqrexlem4 15189 01sqrexlem7 15192 isercolllem2 15609 climsup 15613 fsumcvg3 15672 supcvg 15799 mertenslem1 15827 evth 24467 ivthlem2 24961 ivthlem3 24962 itg2mono 25263 esumpcvgval 33065 erdszelem8 34178 itg2addnclem2 36529 ftc1anclem7 36556 ftc1anc 36558 totbndbnd 36646 prdsbnd 36650 ubelsupr 43690 suprnmpt 43856 upbdrech 44002 ssfiunibd 44006 uzfissfz 44023 fourierdlem20 44830 fourierdlem31 44841 fourierdlem64 44873 fourierdlem79 44888 sge0isum 45130 hoicvr 45251 hoidmv1lelem1 45294 hoidmv1lelem3 45296 hoidmvlelem1 45298 hoidmvlelem4 45301 |
Copyright terms: Public domain | W3C validator |