| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fiminre2 | Structured version Visualization version GIF version | ||
| Description: A nonempty finite set of real numbers is bounded below. (Contributed by Glauco Siliprandi, 8-Apr-2021.) |
| Ref | Expression |
|---|---|
| fiminre2 | ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 11139 | . . . 4 ⊢ (𝐴 = ∅ → 0 ∈ ℝ) | |
| 2 | rzal 4423 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) | |
| 3 | breq1 5076 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑦 ↔ 0 ≤ 𝑦)) | |
| 4 | 3 | ralbidv 3162 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦)) |
| 5 | 4 | rspcev 3560 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 6 | 1, 2, 5 | syl2anc 590 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 7 | 6 | adantl 482 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 8 | neqne 2942 | . . . 4 ⊢ (¬ 𝐴 = ∅ → 𝐴 ≠ ∅) | |
| 9 | 8 | adantl 482 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → 𝐴 ≠ ∅) |
| 10 | simpll 772 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ ℝ) | |
| 11 | simplr 774 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin) | |
| 12 | simpr 485 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅) | |
| 13 | fiminre 12095 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) | |
| 14 | 10, 11, 12, 13 | syl3anc 1379 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 15 | ssrexv 3985 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)) | |
| 16 | 10, 14, 15 | sylc 65 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 17 | 9, 16 | syldan 597 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 18 | 7, 17 | pm2.61dan 818 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ∀wral 3053 ∃wrex 3063 ⊆ wss 3883 ∅c0 4262 class class class wbr 5073 Fincfn 8884 ℝcr 11029 0cc0 11030 ≤ cle 11172 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 ax-resscn 11087 ax-1cn 11088 ax-addrcl 11091 ax-rnegex 11101 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-br 5074 df-opab 5136 df-mpt 5155 df-tr 5181 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-om 7808 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 |
| This theorem is referenced by: infrefilb 12134 infxrrefi 45834 |
| Copyright terms: Public domain | W3C validator |