![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > supicclub | Structured version Visualization version GIF version |
Description: The supremum of a bounded set of real numbers is the least upper bound. (Contributed by Thierry Arnoux, 23-May-2019.) |
Ref | Expression |
---|---|
supicc.1 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
supicc.2 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
supicc.3 | ⊢ (𝜑 → 𝐴 ⊆ (𝐵[,]𝐶)) |
supicc.4 | ⊢ (𝜑 → 𝐴 ≠ ∅) |
supiccub.1 | ⊢ (𝜑 → 𝐷 ∈ 𝐴) |
Ref | Expression |
---|---|
supicclub | ⊢ (𝜑 → (𝐷 < sup(𝐴, ℝ, < ) ↔ ∃𝑧 ∈ 𝐴 𝐷 < 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supicc.3 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ (𝐵[,]𝐶)) | |
2 | supicc.1 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | supicc.2 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
4 | iccssre 12807 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵[,]𝐶) ⊆ ℝ) | |
5 | 2, 3, 4 | syl2anc 587 | . . 3 ⊢ (𝜑 → (𝐵[,]𝐶) ⊆ ℝ) |
6 | 1, 5 | sstrd 3925 | . 2 ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
7 | supicc.4 | . 2 ⊢ (𝜑 → 𝐴 ≠ ∅) | |
8 | 2 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
9 | 8 | rexrd 10680 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
10 | 3 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
11 | 10 | rexrd 10680 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ*) |
12 | 1 | sselda 3915 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (𝐵[,]𝐶)) |
13 | iccleub 12780 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝑥 ∈ (𝐵[,]𝐶)) → 𝑥 ≤ 𝐶) | |
14 | 9, 11, 12, 13 | syl3anc 1368 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ 𝐶) |
15 | 14 | ralrimiva 3149 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝐶) |
16 | brralrspcev 5090 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝐶) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝑦) | |
17 | 3, 15, 16 | syl2anc 587 | . 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝑦) |
18 | supiccub.1 | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝐴) | |
19 | 6, 18 | sseldd 3916 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℝ) |
20 | suprlub 11592 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑥 ≤ 𝑦) ∧ 𝐷 ∈ ℝ) → (𝐷 < sup(𝐴, ℝ, < ) ↔ ∃𝑧 ∈ 𝐴 𝐷 < 𝑧)) | |
21 | 6, 7, 17, 19, 20 | syl31anc 1370 | 1 ⊢ (𝜑 → (𝐷 < sup(𝐴, ℝ, < ) ↔ ∃𝑧 ∈ 𝐴 𝐷 < 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ∃wrex 3107 ⊆ wss 3881 ∅c0 4243 class class class wbr 5030 (class class class)co 7135 supcsup 8888 ℝcr 10525 ℝ*cxr 10663 < clt 10664 ≤ cle 10665 [,]cicc 12729 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-icc 12733 |
This theorem is referenced by: supicclub2 12882 |
Copyright terms: Public domain | W3C validator |