![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > infrelb | Structured version Visualization version GIF version |
Description: If a nonempty set of real numbers has a lower bound, its infimum is less than or equal to any of its elements. (Contributed by Jeff Hankins, 15-Sep-2013.) (Revised by AV, 4-Sep-2020.) |
Ref | Expression |
---|---|
infrelb | ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → inf(𝐵, ℝ, < ) ≤ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1133 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐵 ⊆ ℝ) | |
2 | ne0i 4334 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐵 ≠ ∅) | |
3 | 2 | 3ad2ant3 1132 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐵 ≠ ∅) |
4 | simp2 1134 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) | |
5 | infrecl 12229 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐵 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → inf(𝐵, ℝ, < ) ∈ ℝ) | |
6 | 1, 3, 4, 5 | syl3anc 1368 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → inf(𝐵, ℝ, < ) ∈ ℝ) |
7 | ssel2 3971 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ ℝ) | |
8 | 7 | 3adant2 1128 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ ℝ) |
9 | ltso 11326 | . . . . . . 7 ⊢ < Or ℝ | |
10 | 9 | a1i 11 | . . . . . 6 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → < Or ℝ) |
11 | simpll 765 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → 𝐵 ⊆ ℝ) | |
12 | 2 | adantl 480 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → 𝐵 ≠ ∅) |
13 | simplr 767 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) | |
14 | infm3 12206 | . . . . . . 7 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐵 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐵 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐵 𝑧 < 𝑦))) | |
15 | 11, 12, 13, 14 | syl3anc 1368 | . . . . . 6 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐵 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐵 𝑧 < 𝑦))) |
16 | 10, 15 | inflb 9514 | . . . . 5 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < ))) |
17 | 16 | expcom 412 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < )))) |
18 | 17 | pm2.43b 55 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < ))) |
19 | 18 | 3impia 1114 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → ¬ 𝐴 < inf(𝐵, ℝ, < )) |
20 | 6, 8, 19 | nltled 11396 | 1 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → inf(𝐵, ℝ, < ) ≤ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∧ w3a 1084 ∈ wcel 2098 ≠ wne 2929 ∀wral 3050 ∃wrex 3059 ⊆ wss 3944 ∅c0 4322 class class class wbr 5149 Or wor 5589 infcinf 9466 ℝcr 11139 < clt 11280 ≤ cle 11281 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-pre-sup 11218 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-po 5590 df-so 5591 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9467 df-inf 9468 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 |
This theorem is referenced by: infrefilb 12233 minveclem2 25398 minveclem4 25404 aalioulem2 26313 pilem2 26434 pilem3 26435 pntlem3 27587 minvecolem2 30757 minvecolem4 30762 taupilem2 36932 ptrecube 37224 heicant 37259 hashscontpow1 41724 pellfundlb 42446 climinf 45132 fourierdlem42 45675 |
Copyright terms: Public domain | W3C validator |