| 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 11237 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | rzal 4484 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) | |
| 3 | brralrspcev 5179 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 4 | 1, 2, 3 | sylancr 587 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 6 | fimaxre 12186 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 7 | 6 | 3expia 1121 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 8 | ssrexv 4028 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 10 | 7, 9 | syld 47 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 11 | 5, 10 | pm2.61dne 3018 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 ∀wral 3051 ∃wrex 3060 ⊆ wss 3926 ∅c0 4308 class class class wbr 5119 Fincfn 8959 ℝcr 11128 0cc0 11129 ≤ cle 11270 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-resscn 11186 ax-1cn 11187 ax-addrcl 11190 ax-rnegex 11200 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-om 7862 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 |
| This theorem is referenced by: fimaxre3 12188 isercolllem2 15682 fsumcvg3 15745 mertenslem2 15901 1arith 16947 ovolicc2lem4 25473 erdszelem8 35220 poimirlem31 37675 poimirlem32 37676 mblfinlem1 37681 itg2addnclem2 37696 ftc1anclem7 37723 ftc1anc 37725 totbndbnd 37813 prdsbnd 37817 uzfissfz 45353 fourierdlem31 46167 fourierdlem79 46214 hoicvr 46577 |
| Copyright terms: Public domain | W3C validator |