Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > infxrlesupxr | Structured version Visualization version GIF version |
Description: The supremum of a nonempty set is greater than or equal to the infimum. The second condition is needed, see supxrltinfxr 41716. (Contributed by Glauco Siliprandi, 2-Jan-2022.) |
Ref | Expression |
---|---|
infxrlesupxr.1 | ⊢ (𝜑 → 𝐴 ⊆ ℝ*) |
infxrlesupxr.2 | ⊢ (𝜑 → 𝐴 ≠ ∅) |
Ref | Expression |
---|---|
infxrlesupxr | ⊢ (𝜑 → inf(𝐴, ℝ*, < ) ≤ sup(𝐴, ℝ*, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infxrlesupxr.2 | . . 3 ⊢ (𝜑 → 𝐴 ≠ ∅) | |
2 | n0 4310 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
3 | 2 | biimpi 218 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
4 | 1, 3 | syl 17 | . 2 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴) |
5 | infxrlesupxr.1 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ*) | |
6 | 5 | infxrcld 41653 | . . . . . 6 ⊢ (𝜑 → inf(𝐴, ℝ*, < ) ∈ ℝ*) |
7 | 6 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → inf(𝐴, ℝ*, < ) ∈ ℝ*) |
8 | 5 | sselda 3967 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
9 | 5 | supxrcld 41366 | . . . . . 6 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
10 | 9 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
11 | 5 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ ℝ*) |
12 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
13 | infxrlb 12721 | . . . . . 6 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝑥 ∈ 𝐴) → inf(𝐴, ℝ*, < ) ≤ 𝑥) | |
14 | 11, 12, 13 | syl2anc 586 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → inf(𝐴, ℝ*, < ) ≤ 𝑥) |
15 | eqid 2821 | . . . . . 6 ⊢ sup(𝐴, ℝ*, < ) = sup(𝐴, ℝ*, < ) | |
16 | 11, 12, 15 | supxrubd 41373 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ sup(𝐴, ℝ*, < )) |
17 | 7, 8, 10, 14, 16 | xrletrd 12549 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → inf(𝐴, ℝ*, < ) ≤ sup(𝐴, ℝ*, < )) |
18 | 17 | ex 415 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → inf(𝐴, ℝ*, < ) ≤ sup(𝐴, ℝ*, < ))) |
19 | 18 | exlimdv 1930 | . 2 ⊢ (𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → inf(𝐴, ℝ*, < ) ≤ sup(𝐴, ℝ*, < ))) |
20 | 4, 19 | mpd 15 | 1 ⊢ (𝜑 → inf(𝐴, ℝ*, < ) ≤ sup(𝐴, ℝ*, < )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∃wex 1776 ∈ wcel 2110 ≠ wne 3016 ⊆ wss 3936 ∅c0 4291 class class class wbr 5059 supcsup 8898 infcinf 8899 ℝ*cxr 10668 < clt 10669 ≤ cle 10670 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-po 5469 df-so 5470 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-sup 8900 df-inf 8901 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 |
This theorem is referenced by: liminflelimsuplem 42048 |
Copyright terms: Public domain | W3C validator |