Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > supicclub2 | 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 | ⊢ (𝜑 → 𝐷 ∈ 𝐴) |
supicclub2.1 | ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ≤ 𝐷) |
Ref | Expression |
---|---|
supicclub2 | ⊢ (𝜑 → sup(𝐴, ℝ, < ) ≤ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supicclub2.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ≤ 𝐷) | |
2 | supicc.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ (𝐵[,]𝐶)) | |
3 | iccssxr 12256 | . . . . . . . 8 ⊢ (𝐵[,]𝐶) ⊆ ℝ* | |
4 | 2, 3 | syl6ss 3615 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ*) |
5 | 4 | sselda 3603 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ ℝ*) |
6 | supiccub.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ 𝐴) | |
7 | 4, 6 | sseldd 3604 | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ℝ*) |
8 | 7 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝐷 ∈ ℝ*) |
9 | xrlenlt 10103 | . . . . . 6 ⊢ ((𝑧 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) → (𝑧 ≤ 𝐷 ↔ ¬ 𝐷 < 𝑧)) | |
10 | 5, 8, 9 | syl2anc 693 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝑧 ≤ 𝐷 ↔ ¬ 𝐷 < 𝑧)) |
11 | 1, 10 | mpbid 222 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ¬ 𝐷 < 𝑧) |
12 | 11 | nrexdv 3001 | . . 3 ⊢ (𝜑 → ¬ ∃𝑧 ∈ 𝐴 𝐷 < 𝑧) |
13 | supicc.1 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
14 | supicc.2 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
15 | supicc.4 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ ∅) | |
16 | 13, 14, 2, 15, 6 | supicclub 12322 | . . 3 ⊢ (𝜑 → (𝐷 < sup(𝐴, ℝ, < ) ↔ ∃𝑧 ∈ 𝐴 𝐷 < 𝑧)) |
17 | 12, 16 | mtbird 315 | . 2 ⊢ (𝜑 → ¬ 𝐷 < sup(𝐴, ℝ, < )) |
18 | 13, 14, 2, 15 | supicc 12320 | . . . 4 ⊢ (𝜑 → sup(𝐴, ℝ, < ) ∈ (𝐵[,]𝐶)) |
19 | 3, 18 | sseldi 3601 | . . 3 ⊢ (𝜑 → sup(𝐴, ℝ, < ) ∈ ℝ*) |
20 | xrlenlt 10103 | . . 3 ⊢ ((sup(𝐴, ℝ, < ) ∈ ℝ* ∧ 𝐷 ∈ ℝ*) → (sup(𝐴, ℝ, < ) ≤ 𝐷 ↔ ¬ 𝐷 < sup(𝐴, ℝ, < ))) | |
21 | 19, 7, 20 | syl2anc 693 | . 2 ⊢ (𝜑 → (sup(𝐴, ℝ, < ) ≤ 𝐷 ↔ ¬ 𝐷 < sup(𝐴, ℝ, < ))) |
22 | 17, 21 | mpbird 247 | 1 ⊢ (𝜑 → sup(𝐴, ℝ, < ) ≤ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∈ wcel 1990 ≠ wne 2794 ∃wrex 2913 ⊆ wss 3574 ∅c0 3915 class class class wbr 4653 (class class class)co 6650 supcsup 8346 ℝcr 9935 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 [,]cicc 12178 |
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-iun 4522 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-1st 7168 df-2nd 7169 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 df-icc 12182 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |