| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen1lem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen1 13150. (Contributed by Mario Carneiro, 12-May-2013.) (Revised by NM, 13-Aug-2021.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| rpnnen1lem.1 | ⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} |
| rpnnen1lem.2 | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))) |
| rpnnen1lem.n | ⊢ ℕ ∈ V |
| rpnnen1lem.q | ⊢ ℚ ∈ V |
| Ref | Expression |
|---|---|
| rpnnen1lem4 | ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rpnnen1lem.1 | . . . . 5 ⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} | |
| 2 | rpnnen1lem.2 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))) | |
| 3 | rpnnen1lem.n | . . . . 5 ⊢ ℕ ∈ V | |
| 4 | rpnnen1lem.q | . . . . 5 ⊢ ℚ ∈ V | |
| 5 | 1, 2, 3, 4 | rpnnen1lem1 13145 | . . . 4 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) ∈ (ℚ ↑m ℕ)) |
| 6 | 4, 3 | elmap 8936 | . . . 4 ⊢ ((𝐹‘𝑥) ∈ (ℚ ↑m ℕ) ↔ (𝐹‘𝑥):ℕ⟶ℚ) |
| 7 | 5, 6 | sylib 221 | . . 3 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥):ℕ⟶ℚ) |
| 8 | frn 6746 | . . . 4 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℚ) | |
| 9 | qssre 13125 | . . . 4 ⊢ ℚ ⊆ ℝ | |
| 10 | 8, 9 | sstrdi 3924 | . . 3 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℝ) |
| 11 | 7, 10 | syl 18 | . 2 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ⊆ ℝ) |
| 12 | 1nn 12385 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 13 | 12 | ne0ii 4292 | . . . . 5 ⊢ ℕ ≠ ∅ |
| 14 | fdm 6748 | . . . . . 6 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) = ℕ) | |
| 15 | 14 | neeq1d 3021 | . . . . 5 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → (dom (𝐹‘𝑥) ≠ ∅ ↔ ℕ ≠ ∅)) |
| 16 | 13, 15 | mpbiri 261 | . . . 4 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) ≠ ∅) |
| 17 | dm0rn0 5917 | . . . . 5 ⊢ (dom (𝐹‘𝑥) = ∅ ↔ ran (𝐹‘𝑥) = ∅) | |
| 18 | 17 | necon3bii 3014 | . . . 4 ⊢ (dom (𝐹‘𝑥) ≠ ∅ ↔ ran (𝐹‘𝑥) ≠ ∅) |
| 19 | 16, 18 | sylib 221 | . . 3 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ≠ ∅) |
| 20 | 7, 19 | syl 18 | . 2 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ≠ ∅) |
| 21 | 1, 2, 3, 4 | rpnnen1lem3 13146 | . . 3 ⊢ (𝑥 ∈ ℝ → ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥) |
| 22 | breq2 5111 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝑛 ≤ 𝑦 ↔ 𝑛 ≤ 𝑥)) | |
| 23 | 22 | ralbidv 3192 | . . . 4 ⊢ (𝑦 = 𝑥 → (∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥)) |
| 24 | 23 | rspcev 3579 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) |
| 25 | 21, 24 | mpdan 700 | . 2 ⊢ (𝑥 ∈ ℝ → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) |
| 26 | suprcl 12316 | . 2 ⊢ ((ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ) | |
| 27 | 11, 20, 25, 26 | syl3anc 1401 | 1 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∀wral 3083 ∃wrex 3093 {crab 3415 Vcvv 3453 ⊆ wss 3899 ∅c0 4280 class class class wbr 5107 ↦ cmpt 5191 dom cdm 5657 ran crn 5658 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 ↑m cmap 8884 supcsup 9468 ℝcr 11237 1c1 11239 < clt 11381 ≤ cle 11382 / cdiv 12012 ℕcn 12374 ℤcz 12732 ℚcq 13114 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 ax-pre-sup 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-map 8886 df-en 9011 df-dom 9012 df-sdom 9013 df-sup 9470 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-n0 12646 df-z 12733 df-q 13115 |
| This theorem is used by: rpnnen1lem5 13148 |
| Copyright terms: Public domain | W3C validator |