| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen1lem6 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen1 12898. (Contributed by Mario Carneiro, 12-May-2013.) (Revised by NM, 15-Aug-2021.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| rpnnen1lem.1 | ⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} |
| rpnnen1lem.2 | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))) |
| rpnnen1lem.n | ⊢ ℕ ∈ V |
| rpnnen1lem.q | ⊢ ℚ ∈ V |
| Ref | Expression |
|---|---|
| rpnnen1lem6 | ⊢ ℝ ≼ (ℚ ↑m ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovex 7391 | . 2 ⊢ (ℚ ↑m ℕ) ∈ V | |
| 2 | rpnnen1lem.1 | . . . 4 ⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} | |
| 3 | rpnnen1lem.2 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))) | |
| 4 | rpnnen1lem.n | . . . 4 ⊢ ℕ ∈ V | |
| 5 | rpnnen1lem.q | . . . 4 ⊢ ℚ ∈ V | |
| 6 | 2, 3, 4, 5 | rpnnen1lem1 12893 | . . 3 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) ∈ (ℚ ↑m ℕ)) |
| 7 | rneq 5884 | . . . . . 6 ⊢ ((𝐹‘𝑥) = (𝐹‘𝑦) → ran (𝐹‘𝑥) = ran (𝐹‘𝑦)) | |
| 8 | 7 | supeq1d 9351 | . . . . 5 ⊢ ((𝐹‘𝑥) = (𝐹‘𝑦) → sup(ran (𝐹‘𝑥), ℝ, < ) = sup(ran (𝐹‘𝑦), ℝ, < )) |
| 9 | 2, 3, 4, 5 | rpnnen1lem5 12896 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥) |
| 10 | fveq2 6833 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 11 | 10 | rneqd 5886 | . . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ran (𝐹‘𝑥) = ran (𝐹‘𝑦)) |
| 12 | 11 | supeq1d 9351 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → sup(ran (𝐹‘𝑥), ℝ, < ) = sup(ran (𝐹‘𝑦), ℝ, < )) |
| 13 | id 22 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 14 | 12, 13 | eqeq12d 2751 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥 ↔ sup(ran (𝐹‘𝑦), ℝ, < ) = 𝑦)) |
| 15 | 14, 9 | vtoclga 3531 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → sup(ran (𝐹‘𝑦), ℝ, < ) = 𝑦) |
| 16 | 9, 15 | eqeqan12d 2749 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) = sup(ran (𝐹‘𝑦), ℝ, < ) ↔ 𝑥 = 𝑦)) |
| 17 | 8, 16 | imbitrid 244 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) |
| 18 | 17, 10 | impbid1 225 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ 𝑥 = 𝑦)) |
| 19 | 6, 18 | dom2 8934 | . 2 ⊢ ((ℚ ↑m ℕ) ∈ V → ℝ ≼ (ℚ ↑m ℕ)) |
| 20 | 1, 19 | ax-mp 5 | 1 ⊢ ℝ ≼ (ℚ ↑m ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3398 Vcvv 3439 class class class wbr 5097 ↦ cmpt 5178 ran crn 5624 ‘cfv 6491 (class class class)co 7358 ↑m cmap 8765 ≼ cdom 8883 supcsup 9345 ℝcr 11027 < clt 11168 / cdiv 11796 ℕcn 12147 ℤcz 12490 ℚcq 12863 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-sup 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-n0 12404 df-z 12491 df-q 12864 |
| This theorem is referenced by: rpnnen1 12898 |
| Copyright terms: Public domain | W3C validator |