MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rpnnen1lem6 Structured version   Visualization version   GIF version

Theorem rpnnen1lem6 12883
Description: Lemma for rpnnen1 12884. (Contributed by Mario Carneiro, 12-May-2013.) (Revised by NM, 15-Aug-2021.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
rpnnen1lem.1 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥}
rpnnen1lem.2 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
rpnnen1lem.n ℕ ∈ V
rpnnen1lem.q ℚ ∈ V
Assertion
Ref Expression
rpnnen1lem6 ℝ ≼ (ℚ ↑m ℕ)
Distinct variable groups:   𝑘,𝐹,𝑛,𝑥   𝑇,𝑛
Allowed substitution hints:   𝑇(𝑥,𝑘)

Proof of Theorem rpnnen1lem6
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ovex 7382 . 2 (ℚ ↑m ℕ) ∈ V
2 rpnnen1lem.1 . . . 4 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥}
3 rpnnen1lem.2 . . . 4 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
4 rpnnen1lem.n . . . 4 ℕ ∈ V
5 rpnnen1lem.q . . . 4 ℚ ∈ V
62, 3, 4, 5rpnnen1lem1 12879 . . 3 (𝑥 ∈ ℝ → (𝐹𝑥) ∈ (ℚ ↑m ℕ))
7 rneq 5878 . . . . . 6 ((𝐹𝑥) = (𝐹𝑦) → ran (𝐹𝑥) = ran (𝐹𝑦))
87supeq1d 9336 . . . . 5 ((𝐹𝑥) = (𝐹𝑦) → sup(ran (𝐹𝑥), ℝ, < ) = sup(ran (𝐹𝑦), ℝ, < ))
92, 3, 4, 5rpnnen1lem5 12882 . . . . . 6 (𝑥 ∈ ℝ → sup(ran (𝐹𝑥), ℝ, < ) = 𝑥)
10 fveq2 6822 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
1110rneqd 5880 . . . . . . . . 9 (𝑥 = 𝑦 → ran (𝐹𝑥) = ran (𝐹𝑦))
1211supeq1d 9336 . . . . . . . 8 (𝑥 = 𝑦 → sup(ran (𝐹𝑥), ℝ, < ) = sup(ran (𝐹𝑦), ℝ, < ))
13 id 22 . . . . . . . 8 (𝑥 = 𝑦𝑥 = 𝑦)
1412, 13eqeq12d 2745 . . . . . . 7 (𝑥 = 𝑦 → (sup(ran (𝐹𝑥), ℝ, < ) = 𝑥 ↔ sup(ran (𝐹𝑦), ℝ, < ) = 𝑦))
1514, 9vtoclga 3532 . . . . . 6 (𝑦 ∈ ℝ → sup(ran (𝐹𝑦), ℝ, < ) = 𝑦)
169, 15eqeqan12d 2743 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (sup(ran (𝐹𝑥), ℝ, < ) = sup(ran (𝐹𝑦), ℝ, < ) ↔ 𝑥 = 𝑦))
178, 16imbitrid 244 . . . 4 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹𝑥) = (𝐹𝑦) → 𝑥 = 𝑦))
1817, 10impbid1 225 . . 3 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹𝑥) = (𝐹𝑦) ↔ 𝑥 = 𝑦))
196, 18dom2 8920 . 2 ((ℚ ↑m ℕ) ∈ V → ℝ ≼ (ℚ ↑m ℕ))
201, 19ax-mp 5 1 ℝ ≼ (ℚ ↑m ℕ)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1540  wcel 2109  {crab 3394  Vcvv 3436   class class class wbr 5092  cmpt 5173  ran crn 5620  cfv 6482  (class class class)co 7349  m cmap 8753  cdom 8870  supcsup 9330  cr 11008   < clt 11149   / cdiv 11777  cn 12128  cz 12471  cq 12849
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-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086  ax-pre-sup 11087
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-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-sup 9332  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-div 11778  df-nn 12129  df-n0 12385  df-z 12472  df-q 12850
This theorem is referenced by:  rpnnen1  12884
  Copyright terms: Public domain W3C validator