| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimaxre2 | Structured version Visualization version GIF version | ||
| Description: A nonempty finite set of real numbers has an upper bound. (Contributed by Jeff Madsen, 27-May-2011.) (Revised by Mario Carneiro, 13-Feb-2014.) |
| Ref | Expression |
|---|---|
| fimaxre2 | ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 11114 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | rzal 4456 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) | |
| 3 | brralrspcev 5149 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 4 | 1, 2, 3 | sylancr 587 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 6 | fimaxre 12066 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 7 | 6 | 3expia 1121 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 8 | ssrexv 3999 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 10 | 7, 9 | syld 47 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 11 | 5, 10 | pm2.61dne 3014 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∀wral 3047 ∃wrex 3056 ⊆ wss 3897 ∅c0 4280 class class class wbr 5089 Fincfn 8869 ℝcr 11005 0cc0 11006 ≤ cle 11147 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-resscn 11063 ax-1cn 11064 ax-addrcl 11067 ax-rnegex 11077 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-om 7797 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 |
| This theorem is referenced by: fimaxre3 12068 isercolllem2 15573 fsumcvg3 15636 mertenslem2 15792 1arith 16839 ovolicc2lem4 25448 erdszelem8 35242 poimirlem31 37690 poimirlem32 37691 mblfinlem1 37696 itg2addnclem2 37711 ftc1anclem7 37738 ftc1anc 37740 totbndbnd 37828 prdsbnd 37832 uzfissfz 45424 fourierdlem31 46235 fourierdlem79 46282 hoicvr 46645 |
| Copyright terms: Public domain | W3C validator |