| 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 11132 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | rzal 4445 | . . . 4 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) | |
| 3 | brralrspcev 5156 | . . . 4 ⊢ ((0 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 4 | 1, 2, 3 | sylancr 587 | . . 3 ⊢ (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 = ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 6 | fimaxre 12084 | . . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 7 | 6 | 3expia 1121 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 8 | ssrexv 4001 | . . . 4 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
| 9 | 8 | adantr 480 | . . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 10 | 7, 9 | syld 47 | . 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
| 11 | 5, 10 | pm2.61dne 3016 | 1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ∃wrex 3058 ⊆ wss 3899 ∅c0 4283 class class class wbr 5096 Fincfn 8881 ℝcr 11023 0cc0 11024 ≤ cle 11165 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-resscn 11081 ax-1cn 11082 ax-addrcl 11085 ax-rnegex 11095 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 |
| 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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-om 7807 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 |
| This theorem is referenced by: fimaxre3 12086 isercolllem2 15587 fsumcvg3 15650 mertenslem2 15806 1arith 16853 ovolicc2lem4 25475 erdszelem8 35341 poimirlem31 37791 poimirlem32 37792 mblfinlem1 37797 itg2addnclem2 37812 ftc1anclem7 37839 ftc1anc 37841 totbndbnd 37929 prdsbnd 37933 uzfissfz 45513 fourierdlem31 46324 fourierdlem79 46371 hoicvr 46734 |
| Copyright terms: Public domain | W3C validator |