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 28920 | . . 3 ⊢ (𝜑 → (inf(𝐴, (0[,]+∞), < ) < 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
4 | 3 | notbid 307 | . 2 ⊢ (𝜑 → (¬ inf(𝐴, (0[,]+∞), < ) < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
5 | iccssxr 12127 | . . . 4 ⊢ (0[,]+∞) ⊆ ℝ* | |
6 | 5, 2 | sseldi 3566 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
7 | xrltso 11850 | . . . . . . 7 ⊢ < Or ℝ* | |
8 | soss 4977 | . . . . . . 7 ⊢ ((0[,]+∞) ⊆ ℝ* → ( < Or ℝ* → < Or (0[,]+∞))) | |
9 | 5, 7, 8 | mp2 9 | . . . . . 6 ⊢ < Or (0[,]+∞) |
10 | 9 | a1i 11 | . . . . 5 ⊢ (𝜑 → < Or (0[,]+∞)) |
11 | xrge0infss 28915 | . . . . . 6 ⊢ (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))) | |
12 | 1, 11 | syl 17 | . . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ (0[,]+∞)(∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))) |
13 | 10, 12 | infcl 8277 | . . . 4 ⊢ (𝜑 → inf(𝐴, (0[,]+∞), < ) ∈ (0[,]+∞)) |
14 | 5, 13 | sseldi 3566 | . . 3 ⊢ (𝜑 → inf(𝐴, (0[,]+∞), < ) ∈ ℝ*) |
15 | 6, 14 | xrlenltd 9983 | . 2 ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, (0[,]+∞), < ) ↔ ¬ inf(𝐴, (0[,]+∞), < ) < 𝐵)) |
16 | 6 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
17 | 1, 5 | syl6ss 3580 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ*) |
18 | 17 | sselda 3568 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
19 | 16, 18 | xrlenltd 9983 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝑥 ↔ ¬ 𝑥 < 𝐵)) |
20 | 19 | ralbidva 2968 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵)) |
21 | ralnex 2975 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵) | |
22 | 20, 21 | syl6bb 275 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)) |
23 | 4, 15, 22 | 3bitr4d 299 | 1 ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, (0[,]+∞), < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 ⊆ wss 3540 class class class wbr 4583 Or wor 4958 (class class class)co 6549 infcinf 8230 0cc0 9815 +∞cpnf 9950 ℝ*cxr 9952 < clt 9953 ≤ cle 9954 [,]cicc 12049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-inf 8232 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-icc 12053 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |