| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infssuzle | Structured version Visualization version GIF version | ||
| Description: The infimum of a subset of an upper set of integers is less than or equal to all members of the subset. (Contributed by NM, 11-Oct-2005.) (Revised by AV, 5-Sep-2020.) |
| Ref | Expression |
|---|---|
| infssuzle | ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ 𝐴 ∈ 𝑆) → inf(𝑆, ℝ, < ) ≤ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ne0i 4291 | . . 3 ⊢ (𝐴 ∈ 𝑆 → 𝑆 ≠ ∅) | |
| 2 | uzwo 12822 | . . 3 ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ 𝑆 ≠ ∅) → ∃𝑗 ∈ 𝑆 ∀𝑘 ∈ 𝑆 𝑗 ≤ 𝑘) | |
| 3 | 1, 2 | sylan2 593 | . 2 ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ 𝐴 ∈ 𝑆) → ∃𝑗 ∈ 𝑆 ∀𝑘 ∈ 𝑆 𝑗 ≤ 𝑘) |
| 4 | uzssz 12770 | . . . . 5 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
| 5 | zssre 12493 | . . . . 5 ⊢ ℤ ⊆ ℝ | |
| 6 | 4, 5 | sstri 3941 | . . . 4 ⊢ (ℤ≥‘𝑀) ⊆ ℝ |
| 7 | sstr 3940 | . . . 4 ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ (ℤ≥‘𝑀) ⊆ ℝ) → 𝑆 ⊆ ℝ) | |
| 8 | 6, 7 | mpan2 691 | . . 3 ⊢ (𝑆 ⊆ (ℤ≥‘𝑀) → 𝑆 ⊆ ℝ) |
| 9 | lbinfle 12095 | . . . 4 ⊢ ((𝑆 ⊆ ℝ ∧ ∃𝑗 ∈ 𝑆 ∀𝑘 ∈ 𝑆 𝑗 ≤ 𝑘 ∧ 𝐴 ∈ 𝑆) → inf(𝑆, ℝ, < ) ≤ 𝐴) | |
| 10 | 9 | 3com23 1126 | . . 3 ⊢ ((𝑆 ⊆ ℝ ∧ 𝐴 ∈ 𝑆 ∧ ∃𝑗 ∈ 𝑆 ∀𝑘 ∈ 𝑆 𝑗 ≤ 𝑘) → inf(𝑆, ℝ, < ) ≤ 𝐴) |
| 11 | 8, 10 | syl3an1 1163 | . 2 ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ 𝐴 ∈ 𝑆 ∧ ∃𝑗 ∈ 𝑆 ∀𝑘 ∈ 𝑆 𝑗 ≤ 𝑘) → inf(𝑆, ℝ, < ) ≤ 𝐴) |
| 12 | 3, 11 | mpd3an3 1464 | 1 ⊢ ((𝑆 ⊆ (ℤ≥‘𝑀) ∧ 𝐴 ∈ 𝑆) → inf(𝑆, ℝ, < ) ≤ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ∃wrex 3058 ⊆ wss 3899 ∅c0 4283 class class class wbr 5096 ‘cfv 6490 infcinf 9342 ℝcr 11023 < clt 11164 ≤ cle 11165 ℤcz 12486 ℤ≥cuz 12749 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-sup 9343 df-inf 9344 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 |
| This theorem is referenced by: zsupss 12848 uzwo3 12854 divalglem5 16322 bitsfzolem 16359 bezoutlem3 16466 lcmledvds 16524 lcmfledvds 16557 odzdvds 16721 4sqlem13 16883 4sqlem17 16887 ramcl2lem 16935 ramtub 16938 odlem2 19466 gexlem2 19509 zringlpirlem3 21417 ovolicc2lem4 25475 iundisj 25503 ig1peu 26134 ig1pdvds 26139 ftalem5 27041 iundisjf 32613 iundisjfi 32825 ig1pmindeg 33632 exsslsb 33702 dgraaub 43332 elaa2lem 46419 |
| Copyright terms: Public domain | W3C validator |