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 1136 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐵 ⊆ ℝ) | |
2 | ne0i 4274 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐵 ≠ ∅) | |
3 | 2 | 3ad2ant3 1135 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐵 ≠ ∅) |
4 | simp2 1137 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) | |
5 | infrecl 12007 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐵 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → inf(𝐵, ℝ, < ) ∈ ℝ) | |
6 | 1, 3, 4, 5 | syl3anc 1371 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → inf(𝐵, ℝ, < ) ∈ ℝ) |
7 | ssel2 3921 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ ℝ) | |
8 | 7 | 3adant2 1131 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ ℝ) |
9 | ltso 11105 | . . . . . . 7 ⊢ < Or ℝ | |
10 | 9 | a1i 11 | . . . . . 6 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → < Or ℝ) |
11 | simpll 765 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → 𝐵 ⊆ ℝ) | |
12 | 2 | adantl 483 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → 𝐵 ≠ ∅) |
13 | simplr 767 | . . . . . . 7 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) | |
14 | infm3 11984 | . . . . . . 7 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐵 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐵 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐵 𝑧 < 𝑦))) | |
15 | 11, 12, 13, 14 | syl3anc 1371 | . . . . . 6 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐵 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐵 𝑧 < 𝑦))) |
16 | 10, 15 | inflb 9296 | . . . . 5 ⊢ (((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝐴 ∈ 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < ))) |
17 | 16 | expcom 415 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < )))) |
18 | 17 | pm2.43b 55 | . . 3 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → (𝐴 ∈ 𝐵 → ¬ 𝐴 < inf(𝐵, ℝ, < ))) |
19 | 18 | 3impia 1117 | . 2 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → ¬ 𝐴 < inf(𝐵, ℝ, < )) |
20 | 6, 8, 19 | nltled 11175 | 1 ⊢ ((𝐵 ⊆ ℝ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝐴 ∈ 𝐵) → inf(𝐵, ℝ, < ) ≤ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1087 ∈ wcel 2104 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ⊆ wss 3892 ∅c0 4262 class class class wbr 5081 Or wor 5513 infcinf 9248 ℝcr 10920 < clt 11059 ≤ cle 11060 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10978 ax-1cn 10979 ax-icn 10980 ax-addcl 10981 ax-addrcl 10982 ax-mulcl 10983 ax-mulrcl 10984 ax-mulcom 10985 ax-addass 10986 ax-mulass 10987 ax-distr 10988 ax-i2m1 10989 ax-1ne0 10990 ax-1rid 10991 ax-rnegex 10992 ax-rrecex 10993 ax-cnre 10994 ax-pre-lttri 10995 ax-pre-lttrn 10996 ax-pre-ltadd 10997 ax-pre-mulgt0 10998 ax-pre-sup 10999 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3331 df-reu 3332 df-rab 3333 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-sup 9249 df-inf 9250 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 df-sub 11257 df-neg 11258 |
This theorem is referenced by: infrefilb 12011 minveclem2 24639 minveclem4 24645 aalioulem2 25542 pilem2 25660 pilem3 25661 pntlem3 26806 minvecolem2 29286 minvecolem4 29291 taupilem2 35541 ptrecube 35825 heicant 35860 pellfundlb 40901 climinf 43376 fourierdlem42 43919 |
Copyright terms: Public domain | W3C validator |