| 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 11176 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | rzal 4472 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) | |
| 3 | brralrspcev 5167 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 4 | 1, 2, 3 | sylancr 587 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 6 | fimaxre 12127 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 7 | 6 | 3expia 1121 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 8 | ssrexv 4016 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 10 | 7, 9 | syld 47 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 11 | 5, 10 | pm2.61dne 3011 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → 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: fimaxre3 12129 isercolllem2 15632 fsumcvg3 15695 mertenslem2 15851 1arith 16898 ovolicc2lem4 25421 erdszelem8 35185 poimirlem31 37645 poimirlem32 37646 mblfinlem1 37651 itg2addnclem2 37666 ftc1anclem7 37693 ftc1anc 37695 totbndbnd 37783 prdsbnd 37787 uzfissfz 45322 fourierdlem31 46136 fourierdlem79 46183 hoicvr 46546 |
| Copyright terms: Public domain | W3C validator |