Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > infxrge0gelb | Structured version Visualization version GIF version |
Description: The infimum of a set of nonnegative extended reals is greater than or equal to a lower bound. (Contributed by Thierry Arnoux, 19-Jul-2020.) (Revised by AV, 4-Oct-2020.) |
Ref | Expression |
---|---|
infxrge0glb.a | ⊢ (𝜑 → 𝐴 ⊆ (0[,]+∞)) |
infxrge0glb.b | ⊢ (𝜑 → 𝐵 ∈ (0[,]+∞)) |
Ref | Expression |
---|---|
infxrge0gelb | ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, (0[,]+∞), < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infxrge0glb.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ (0[,]+∞)) | |
2 | infxrge0glb.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (0[,]+∞)) | |
3 | 1, 2 | infxrge0glb 30483 | . . 3 ⊢ (𝜑 → (inf(𝐴, (0[,]+∞), < ) < 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
4 | 3 | notbid 320 | . 2 ⊢ (𝜑 → (¬ inf(𝐴, (0[,]+∞), < ) < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
5 | iccssxr 12813 | . . . 4 ⊢ (0[,]+∞) ⊆ ℝ* | |
6 | 5, 2 | sseldi 3965 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
7 | xrltso 12528 | . . . . . . 7 ⊢ < Or ℝ* | |
8 | soss 5488 | . . . . . . 7 ⊢ ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞))) | |
9 | 5, 7, 8 | mp2 9 | . . . . . 6 ⊢ < Or (0[,]+∞) |
10 | 9 | a1i 11 | . . . . 5 ⊢ (𝜑 → < Or (0[,]+∞)) |
11 | xrge0infss 30478 | . . . . . 6 ⊢ (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))) | |
12 | 1, 11 | syl 17 | . . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ (0[,]+∞)(∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))) |
13 | 10, 12 | infcl 8946 | . . . 4 ⊢ (𝜑 → inf(𝐴, (0[,]+∞), < ) ∈ (0[,]+∞)) |
14 | 5, 13 | sseldi 3965 | . . 3 ⊢ (𝜑 → inf(𝐴, (0[,]+∞), < ) ∈ ℝ*) |
15 | 6, 14 | xrlenltd 10701 | . 2 ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, (0[,]+∞), < ) ↔ ¬ inf(𝐴, (0[,]+∞), < ) < 𝐵)) |
16 | 6 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
17 | 1, 5 | sstrdi 3979 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ*) |
18 | 17 | sselda 3967 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
19 | 16, 18 | xrlenltd 10701 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝑥 ↔ ¬ 𝑥 < 𝐵)) |
20 | 19 | ralbidva 3196 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵)) |
21 | ralnex 3236 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵) | |
22 | 20, 21 | syl6bb 289 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
23 | 4, 15, 22 | 3bitr4d 313 | 1 ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, (0[,]+∞), < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 ⊆ wss 3936 class class class wbr 5059 Or wor 5468 (class class class)co 7150 infcinf 8899 0cc0 10531 +∞cpnf 10666 ℝ*cxr 10668 < clt 10669 ≤ cle 10670 [,]cicc 12735 |
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-iun 4914 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-1st 7683 df-2nd 7684 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 df-icc 12739 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |