infxrgelb - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > infxrgelb		Structured version Visualization version GIF version

Theorem infxrgelb 12716

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.)

**Assertion**
Ref	Expression
infxrgelb	⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵

Proof of Theorem infxrgelb Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xrltso 12522	. . . . . 6 ⊢ < Or ℝ^*
2	1	a1i 11	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → < Or ℝ^*)
3		xrinfmss 12691	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → ∃𝑧 ∈ ℝ^* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑧 ∧ ∀𝑦 ∈ ℝ^* (𝑧 < 𝑦 → ∃𝑥 ∈ 𝐴 𝑥 < 𝑦)))
4		id 22	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → 𝐴 ⊆ ℝ^*)
5	2, 3, 4	infglbb 8939	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (inf(𝐴, ℝ^, < ) < 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵))
6	5	notbid 321	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (¬ inf(𝐴, ℝ^, < ) < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵))
7		ralnex 3199	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)
8	6, 7	syl6bbr 292	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (¬ inf(𝐴, ℝ^, < ) < 𝐵 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵))
9		id 22	. . 3 ⊢ (𝐵 ∈ ℝ^* → 𝐵 ∈ ℝ^*)
10		infxrcl 12714	. . 3 ⊢ (𝐴 ⊆ ℝ^* → inf(𝐴, ℝ^, < ) ∈ ℝ^)
11		xrlenlt 10695	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ inf(𝐴, ℝ^, < ) ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ¬ inf(𝐴, ℝ^, < ) < 𝐵))
12	9, 10, 11	syl2anr 599	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ¬ inf(𝐴, ℝ^*, < ) < 𝐵))
13		simplr 768	. . . 4 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ^)
14		simpl 486	. . . . 5 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → 𝐴 ⊆ ℝ^)
15	14	sselda 3915	. . . 4 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ^)
16	13, 15	xrlenltd 10696	. . 3 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝑥 ↔ ¬ 𝑥 < 𝐵))
17	16	ralbidva 3161	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵))
18	8, 12, 17	3bitr4d 314	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 ⊆ wss 3881 class class class wbr 5030 Or wor 5437 infcinf 8889 ℝ^*cxr 10663 < clt 10664 ≤ cle 10665

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862

This theorem is referenced by: infxrre 12717 infxrss 12720 ixxlb 12748 limsuple 14827 limsupval2 14829 imasdsf1olem 22980 nmogelb 23322 metdsf 23453 metdsge 23454 ovolgelb 24084 ovolge0 24085 ovolsslem 24088 ovolicc2 24126 ismblfin 35098 infrpge 41983 infleinf2 42051 infxrgelbrnmpt 42093 inficc 42171 liminfgord 42396 liminflelimsuplem 42417 ovnhoilem2 43241

W3C validator