| 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 11147 | . . . 4 ⊢ (𝐴 = ∅ → 0 ∈ ℝ) | |
| 2 | rzal 4449 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) | |
| 3 | breq1 5103 | . . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ≤ 𝑦 ↔ 0 ≤ 𝑦)) | |
| 4 | 3 | ralbidv 3161 | . . . . 5 ⊢ (𝑥 = 0 → (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦)) |
| 5 | 4 | rspcev 3578 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 0 ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 6 | 1, 2, 5 | syl2anc 585 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 7 | 6 | adantl 481 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 8 | neqne 2941 | . . . 4 ⊢ (¬ 𝐴 = ∅ → 𝐴 ≠ ∅) | |
| 9 | 8 | adantl 481 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → 𝐴 ≠ ∅) |
| 10 | simpll 767 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ ℝ) | |
| 11 | simplr 769 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin) | |
| 12 | simpr 484 | . . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅) | |
| 13 | fiminre 12101 | . . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) | |
| 14 | 10, 11, 12, 13 | syl3anc 1374 | . . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 15 | ssrexv 4005 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)) | |
| 16 | 10, 14, 15 | sylc 65 | . . 3 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 17 | 9, 16 | syldan 592 | . 2 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| 18 | 7, 17 | pm2.61dan 813 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∃wrex 3062 ⊆ wss 3903 ∅c0 4287 class class class wbr 5100 Fincfn 8895 ℝcr 11037 0cc0 11038 ≤ cle 11179 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-resscn 11095 ax-1cn 11096 ax-addrcl 11099 ax-rnegex 11109 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-om 7819 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 |
| This theorem is referenced by: infrefilb 12140 infxrrefi 45744 |
| Copyright terms: Public domain | W3C validator |