| 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 11177 | . . . 4 ⊢ (𝐴 = ∅ → 0 ∈ ℝ) | |
| 2 | rzal 4472 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) | |
| 3 | breq1 5110 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑦 ↔ 0 ≤ 𝑦)) | |
| 4 | 3 | ralbidv 3156 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦)) |
| 5 | 4 | rspcev 3588 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 6 | 1, 2, 5 | syl2anc 584 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 7 | 6 | adantl 481 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 8 | neqne 2933 | . . . 4 ⊢ (¬ 𝐴 = ∅ → 𝐴 ≠ ∅) | |
| 9 | 8 | adantl 481 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → 𝐴 ≠ ∅) |
| 10 | simpll 766 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ ℝ) | |
| 11 | simplr 768 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin) | |
| 12 | simpr 484 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅) | |
| 13 | fiminre 12130 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) | |
| 14 | 10, 11, 12, 13 | syl3anc 1373 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 15 | ssrexv 4016 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)) | |
| 16 | 10, 14, 15 | sylc 65 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 17 | 9, 16 | syldan 591 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 18 | 7, 17 | pm2.61dan 812 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 ⊆ wss 3914 ∅c0 4296 class class class wbr 5107 Fincfn 8918 ℝcr 11067 0cc0 11068 ≤ cle 11209 |
| 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 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-resscn 11125 ax-1cn 11126 ax-addrcl 11129 ax-rnegex 11139 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 |
| 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-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-om 7843 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 |
| This theorem is referenced by: infrefilb 12169 infxrrefi 45378 |
| Copyright terms: Public domain | W3C validator |