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 13272

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 13077	. . . . . 6 ⊢ < Or ℝ^*
2	1	a1i 11	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → < Or ℝ^*)
3		xrinfmss 13246	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → ∃𝑧 ∈ ℝ^* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑧 ∧ ∀𝑦 ∈ ℝ^* (𝑧 < 𝑦 → ∃𝑥 ∈ 𝐴 𝑥 < 𝑦)))
4		id 22	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → 𝐴 ⊆ ℝ^*)
5	2, 3, 4	infglbb 9419	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (inf(𝐴, ℝ^, < ) < 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵))
6	5	notbid 318	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (¬ inf(𝐴, ℝ^, < ) < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵))
7		ralnex 3055	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑥 < 𝐵)
8	6, 7	bitr4di 289	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (¬ inf(𝐴, ℝ^, < ) < 𝐵 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵))
9		id 22	. . 3 ⊢ (𝐵 ∈ ℝ^* → 𝐵 ∈ ℝ^*)
10		infxrcl 13270	. . 3 ⊢ (𝐴 ⊆ ℝ^* → inf(𝐴, ℝ^, < ) ∈ ℝ^)
11		xrlenlt 11215	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ inf(𝐴, ℝ^, < ) ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ¬ inf(𝐴, ℝ^, < ) < 𝐵))
12	9, 10, 11	syl2anr 597	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ¬ inf(𝐴, ℝ^*, < ) < 𝐵))
13		simplr 768	. . . 4 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ^)
14		simpl 482	. . . . 5 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → 𝐴 ⊆ ℝ^)
15	14	sselda 3943	. . . 4 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ^)
16	13, 15	xrlenltd 11216	. . 3 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝑥 ∈ 𝐴) → (𝐵 ≤ 𝑥 ↔ ¬ 𝑥 < 𝐵))
17	16	ralbidva 3154	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 < 𝐵))
18	8, 12, 17	3bitr4d 311	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ≤ inf(𝐴, ℝ^, < ) ↔ ∀𝑥 ∈ 𝐴 𝐵 ≤ 𝑥))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 ⊆ wss 3911 class class class wbr 5102 Or wor 5538 infcinf 9368 ℝ^*cxr 11183 < clt 11184 ≤ cle 11185

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384

This theorem is referenced by: infxrre 13273 infxrss 13276 ixxlb 13304 limsuple 15420 limsupval2 15422 imasdsf1olem 24294 nmogelb 24637 metdsf 24770 metdsge 24771 ovolgelb 25414 ovolge0 25415 ovolsslem 25418 ovolicc2 25456 ismblfin 37648 infrpge 45340 infleinf2 45403 infxrgelbrnmpt 45443 inficc 45525 liminfgord 45745 liminflelimsuplem 45766 ovnhoilem2 46593

W3C validator