![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > infxrgelb | Structured version Visualization version GIF version |
Description: The infimum of a set of extended reals is greater than or equal to a lower bound. (Contributed by Mario Carneiro, 16-Mar-2014.) (Revised by AV, 5-Sep-2020.) |
Ref | Expression |
---|---|
infxrgelb | ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 ≤ inf(𝐴, ℝ*, < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xrltso 13116 | . . . . . 6 ⊢ < Or ℝ* | |
2 | 1 | a1i 11 | . . . . 5 ⊢ (𝐴 ⊆ ℝ* → < Or ℝ*) |
3 | xrinfmss 13285 | . . . . 5 ⊢ (𝐴 ⊆ ℝ* → ∃𝑧 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑧 ∧ ∀𝑦 ∈ ℝ* (𝑧 < 𝑦 → ∃𝑥 ∈ 𝐴 𝑥 < 𝑦))) | |
4 | id 22 | . . . . 5 ⊢ (𝐴 ⊆ ℝ* → 𝐴 ⊆ ℝ*) | |
5 | 2, 3, 4 | infglbb 9482 | . . . 4 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (inf(𝐴, ℝ*, < ) < 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
6 | 5 | notbid 317 | . . 3 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ inf(𝐴, ℝ*, < ) < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
7 | ralnex 3072 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵) | |
8 | 6, 7 | bitr4di 288 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ inf(𝐴, ℝ*, < ) < 𝐵 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵)) |
9 | id 22 | . . 3 ⊢ (𝐵 ∈ ℝ* → 𝐵 ∈ ℝ*) | |
10 | infxrcl 13308 | . . 3 ⊢ (𝐴 ⊆ ℝ* → inf(𝐴, ℝ*, < ) ∈ ℝ*) | |
11 | xrlenlt 11275 | . . 3 ⊢ ((𝐵 ∈ ℝ* ∧ inf(𝐴, ℝ*, < ) ∈ ℝ*) → (𝐵 ≤ inf(𝐴, ℝ*, < ) ↔ ¬ inf(𝐴, ℝ*, < ) < 𝐵)) | |
12 | 9, 10, 11 | syl2anr 597 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 ≤ inf(𝐴, ℝ*, < ) ↔ ¬ inf(𝐴, ℝ*, < ) < 𝐵)) |
13 | simplr 767 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
14 | simpl 483 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → 𝐴 ⊆ ℝ*) | |
15 | 14 | sselda 3981 | . . . 4 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
16 | 13, 15 | xrlenltd 11276 | . . 3 ⊢ (((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝑥 ↔ ¬ 𝑥 < 𝐵)) |
17 | 16 | ralbidva 3175 | . 2 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵)) |
18 | 8, 12, 17 | 3bitr4d 310 | 1 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 ≤ inf(𝐴, ℝ*, < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ⊆ wss 3947 class class class wbr 5147 Or wor 5586 infcinf 9432 ℝ*cxr 11243 < clt 11244 ≤ cle 11245 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 |
This theorem is referenced by: infxrre 13311 infxrss 13314 ixxlb 13342 limsuple 15418 limsupval2 15420 imasdsf1olem 23870 nmogelb 24224 metdsf 24355 metdsge 24356 ovolgelb 24988 ovolge0 24989 ovolsslem 24992 ovolicc2 25030 ismblfin 36517 infrpge 44047 infleinf2 44110 infxrgelbrnmpt 44150 inficc 44233 liminfgord 44456 liminflelimsuplem 44477 ovnhoilem2 45304 |
Copyright terms: Public domain | W3C validator |