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

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

Proof of Theorem rpnnen1lem5
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 rpnnen1lem.1 . . . 4 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥}
2 rpnnen1lem.2 . . . 4 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
3 rpnnen1lem.n . . . 4 ℕ ∈ V
4 rpnnen1lem.q . . . 4 ℚ ∈ V
51, 2, 3, 4rpnnen1lem3 12935 . . 3 (𝑥 ∈ ℝ → ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑥)
61, 2, 3, 4rpnnen1lem1 12934 . . . . . 6 (𝑥 ∈ ℝ → (𝐹𝑥) ∈ (ℚ ↑m ℕ))
74, 3elmap 8838 . . . . . 6 ((𝐹𝑥) ∈ (ℚ ↑m ℕ) ↔ (𝐹𝑥):ℕ⟶ℚ)
86, 7sylib 217 . . . . 5 (𝑥 ∈ ℝ → (𝐹𝑥):ℕ⟶ℚ)
9 frn 6702 . . . . . 6 ((𝐹𝑥):ℕ⟶ℚ → ran (𝐹𝑥) ⊆ ℚ)
10 qssre 12915 . . . . . 6 ℚ ⊆ ℝ
119, 10sstrdi 3981 . . . . 5 ((𝐹𝑥):ℕ⟶ℚ → ran (𝐹𝑥) ⊆ ℝ)
128, 11syl 17 . . . 4 (𝑥 ∈ ℝ → ran (𝐹𝑥) ⊆ ℝ)
13 1nn 12195 . . . . . . . 8 1 ∈ ℕ
1413ne0ii 4324 . . . . . . 7 ℕ ≠ ∅
15 fdm 6704 . . . . . . . 8 ((𝐹𝑥):ℕ⟶ℚ → dom (𝐹𝑥) = ℕ)
1615neeq1d 2999 . . . . . . 7 ((𝐹𝑥):ℕ⟶ℚ → (dom (𝐹𝑥) ≠ ∅ ↔ ℕ ≠ ∅))
1714, 16mpbiri 257 . . . . . 6 ((𝐹𝑥):ℕ⟶ℚ → dom (𝐹𝑥) ≠ ∅)
18 dm0rn0 5907 . . . . . . 7 (dom (𝐹𝑥) = ∅ ↔ ran (𝐹𝑥) = ∅)
1918necon3bii 2992 . . . . . 6 (dom (𝐹𝑥) ≠ ∅ ↔ ran (𝐹𝑥) ≠ ∅)
2017, 19sylib 217 . . . . 5 ((𝐹𝑥):ℕ⟶ℚ → ran (𝐹𝑥) ≠ ∅)
218, 20syl 17 . . . 4 (𝑥 ∈ ℝ → ran (𝐹𝑥) ≠ ∅)
22 breq2 5136 . . . . . . 7 (𝑦 = 𝑥 → (𝑛𝑦𝑛𝑥))
2322ralbidv 3176 . . . . . 6 (𝑦 = 𝑥 → (∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦 ↔ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑥))
2423rspcev 3602 . . . . 5 ((𝑥 ∈ ℝ ∧ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦)
255, 24mpdan 685 . . . 4 (𝑥 ∈ ℝ → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦)
26 id 22 . . . 4 (𝑥 ∈ ℝ → 𝑥 ∈ ℝ)
27 suprleub 12152 . . . 4 (((ran (𝐹𝑥) ⊆ ℝ ∧ ran (𝐹𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦) ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑥))
2812, 21, 25, 26, 27syl31anc 1373 . . 3 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑥))
295, 28mpbird 256 . 2 (𝑥 ∈ ℝ → sup(ran (𝐹𝑥), ℝ, < ) ≤ 𝑥)
301, 2, 3, 4rpnnen1lem4 12936 . . . . . . . . 9 (𝑥 ∈ ℝ → sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ)
31 resubcl 11496 . . . . . . . . 9 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ) → (𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ∈ ℝ)
3230, 31mpdan 685 . . . . . . . 8 (𝑥 ∈ ℝ → (𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ∈ ℝ)
3332adantr 481 . . . . . . 7 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ∈ ℝ)
34 posdif 11679 . . . . . . . . . 10 ((sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
3530, 34mpancom 686 . . . . . . . . 9 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
3635biimpa 477 . . . . . . . 8 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → 0 < (𝑥 − sup(ran (𝐹𝑥), ℝ, < )))
3736gt0ne0d 11750 . . . . . . 7 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ≠ 0)
3833, 37rereccld 12013 . . . . . 6 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) ∈ ℝ)
39 arch 12441 . . . . . 6 ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) ∈ ℝ → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘)
4038, 39syl 17 . . . . 5 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘)
4140ex 413 . . . 4 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘))
421, 2rpnnen1lem2 12933 . . . . . . . . 9 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℤ)
4342zred 12638 . . . . . . . 8 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℝ)
44433adant3 1132 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) ∈ ℝ)
4544ltp1d 12116 . . . . . 6 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1))
4633, 36jca 512 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) → ((𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
47 nnre 12191 . . . . . . . . . . . . . 14 (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
48 nngt0 12215 . . . . . . . . . . . . . 14 (𝑘 ∈ ℕ → 0 < 𝑘)
4947, 48jca 512 . . . . . . . . . . . . 13 (𝑘 ∈ ℕ → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
50 ltrec1 12073 . . . . . . . . . . . . 13 ((((𝑥 − sup(ran (𝐹𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
5146, 49, 50syl2an 596 . . . . . . . . . . . 12 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
5230ad2antrr 724 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ)
53 nnrecre 12226 . . . . . . . . . . . . . . 15 (𝑘 ∈ ℕ → (1 / 𝑘) ∈ ℝ)
5453adantl 482 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
55 simpll 765 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
5652, 54, 55ltaddsub2d 11787 . . . . . . . . . . . . 13 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))))
5712adantr 481 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ran (𝐹𝑥) ⊆ ℝ)
58 ffn 6695 . . . . . . . . . . . . . . . . . . 19 ((𝐹𝑥):ℕ⟶ℚ → (𝐹𝑥) Fn ℕ)
598, 58syl 17 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ℝ → (𝐹𝑥) Fn ℕ)
60 fnfvelrn 7058 . . . . . . . . . . . . . . . . . 18 (((𝐹𝑥) Fn ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹𝑥)‘𝑘) ∈ ran (𝐹𝑥))
6159, 60sylan 580 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹𝑥)‘𝑘) ∈ ran (𝐹𝑥))
6257, 61sseldd 3970 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹𝑥)‘𝑘) ∈ ℝ)
6330adantr 481 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ)
6453adantl 482 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
6512, 21, 253jca 1128 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ℝ → (ran (𝐹𝑥) ⊆ ℝ ∧ ran (𝐹𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦))
6665adantr 481 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (ran (𝐹𝑥) ⊆ ℝ ∧ ran (𝐹𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦))
67 suprub 12147 . . . . . . . . . . . . . . . . 17 (((ran (𝐹𝑥) ⊆ ℝ ∧ ran (𝐹𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹𝑥)𝑛𝑦) ∧ ((𝐹𝑥)‘𝑘) ∈ ran (𝐹𝑥)) → ((𝐹𝑥)‘𝑘) ≤ sup(ran (𝐹𝑥), ℝ, < ))
6866, 61, 67syl2anc 584 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹𝑥)‘𝑘) ≤ sup(ran (𝐹𝑥), ℝ, < ))
6962, 63, 64, 68leadd1dd 11800 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)))
7062, 64readdcld 11215 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ)
71 readdcl 11165 . . . . . . . . . . . . . . . . 17 ((sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ ∧ (1 / 𝑘) ∈ ℝ) → (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
7230, 53, 71syl2an 596 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
73 simpl 483 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
74 lelttr 11276 . . . . . . . . . . . . . . . . 17 (((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ ∧ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) ∧ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥) → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
7574expd 416 . . . . . . . . . . . . . . . 16 (((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ ∧ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) → ((sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥)))
7670, 72, 73, 75syl3anc 1371 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) → ((sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥)))
7769, 76mpd 15 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
7877adantlr 713 . . . . . . . . . . . . 13 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
7956, 78sylbird 259 . . . . . . . . . . . 12 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / 𝑘) < (𝑥 − sup(ran (𝐹𝑥), ℝ, < )) → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
8051, 79sylbid 239 . . . . . . . . . . 11 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
8142peano2zd 12641 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℤ)
82 oveq1 7391 . . . . . . . . . . . . . . . . . . 19 (𝑛 = (sup(𝑇, ℝ, < ) + 1) → (𝑛 / 𝑘) = ((sup(𝑇, ℝ, < ) + 1) / 𝑘))
8382breq1d 5142 . . . . . . . . . . . . . . . . . 18 (𝑛 = (sup(𝑇, ℝ, < ) + 1) → ((𝑛 / 𝑘) < 𝑥 ↔ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
8483, 1elrab2 3673 . . . . . . . . . . . . . . . . 17 ((sup(𝑇, ℝ, < ) + 1) ∈ 𝑇 ↔ ((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
8584biimpri 227 . . . . . . . . . . . . . . . 16 (((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
8681, 85sylan 580 . . . . . . . . . . . . . . 15 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
87 ssrab2 4064 . . . . . . . . . . . . . . . . . . . 20 {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ⊆ ℤ
881, 87eqsstri 4003 . . . . . . . . . . . . . . . . . . 19 𝑇 ⊆ ℤ
89 zssre 12537 . . . . . . . . . . . . . . . . . . 19 ℤ ⊆ ℝ
9088, 89sstri 3978 . . . . . . . . . . . . . . . . . 18 𝑇 ⊆ ℝ
9190a1i 11 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ⊆ ℝ)
92 remulcl 11167 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
9392ancoms 459 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
9447, 93sylan2 593 . . . . . . . . . . . . . . . . . . . . 21 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 · 𝑥) ∈ ℝ)
95 btwnz 12637 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑘 · 𝑥) ∈ ℝ → (∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥) ∧ ∃𝑛 ∈ ℤ (𝑘 · 𝑥) < 𝑛))
9695simpld 495 . . . . . . . . . . . . . . . . . . . . 21 ((𝑘 · 𝑥) ∈ ℝ → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
9794, 96syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
98 zre 12534 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 ∈ ℤ → 𝑛 ∈ ℝ)
9998adantl 482 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℝ)
100 simpll 765 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑥 ∈ ℝ)
10149ad2antlr 725 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
102 ltdivmul 12061 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑛 ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((𝑛 / 𝑘) < 𝑥𝑛 < (𝑘 · 𝑥)))
10399, 100, 101, 102syl3anc 1371 . . . . . . . . . . . . . . . . . . . . 21 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥𝑛 < (𝑘 · 𝑥)))
104103rexbidva 3175 . . . . . . . . . . . . . . . . . . . 20 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥 ↔ ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥)))
10597, 104mpbird 256 . . . . . . . . . . . . . . . . . . 19 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
106 rabn0 4372 . . . . . . . . . . . . . . . . . . 19 ({𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅ ↔ ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
107105, 106sylibr 233 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
1081neeq1i 3004 . . . . . . . . . . . . . . . . . 18 (𝑇 ≠ ∅ ↔ {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
109107, 108sylibr 233 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ≠ ∅)
1101reqabi 3447 . . . . . . . . . . . . . . . . . . . 20 (𝑛𝑇 ↔ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥))
11147ad2antlr 725 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑘 ∈ ℝ)
112111, 100, 92syl2anc 584 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 · 𝑥) ∈ ℝ)
113 ltle 11274 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑛 ∈ ℝ ∧ (𝑘 · 𝑥) ∈ ℝ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
11499, 112, 113syl2anc 584 . . . . . . . . . . . . . . . . . . . . . 22 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
115103, 114sylbid 239 . . . . . . . . . . . . . . . . . . . . 21 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥𝑛 ≤ (𝑘 · 𝑥)))
116115impr 455 . . . . . . . . . . . . . . . . . . . 20 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥)) → 𝑛 ≤ (𝑘 · 𝑥))
117110, 116sylan2b 594 . . . . . . . . . . . . . . . . . . 19 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛𝑇) → 𝑛 ≤ (𝑘 · 𝑥))
118117ralrimiva 3145 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∀𝑛𝑇 𝑛 ≤ (𝑘 · 𝑥))
119 breq2 5136 . . . . . . . . . . . . . . . . . . . 20 (𝑦 = (𝑘 · 𝑥) → (𝑛𝑦𝑛 ≤ (𝑘 · 𝑥)))
120119ralbidv 3176 . . . . . . . . . . . . . . . . . . 19 (𝑦 = (𝑘 · 𝑥) → (∀𝑛𝑇 𝑛𝑦 ↔ ∀𝑛𝑇 𝑛 ≤ (𝑘 · 𝑥)))
121120rspcev 3602 . . . . . . . . . . . . . . . . . 18 (((𝑘 · 𝑥) ∈ ℝ ∧ ∀𝑛𝑇 𝑛 ≤ (𝑘 · 𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛𝑇 𝑛𝑦)
12294, 118, 121syl2anc 584 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑦 ∈ ℝ ∀𝑛𝑇 𝑛𝑦)
12391, 109, 1223jca 1128 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛𝑇 𝑛𝑦))
124 suprub 12147 . . . . . . . . . . . . . . . 16 (((𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛𝑇 𝑛𝑦) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
125123, 124sylan 580 . . . . . . . . . . . . . . 15 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
12686, 125syldan 591 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
127126ex 413 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < )))
12842zcnd 12639 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℂ)
129 1cnd 11181 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ)
130 nncn 12192 . . . . . . . . . . . . . . . . . 18 (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
131 nnne0 12218 . . . . . . . . . . . . . . . . . 18 (𝑘 ∈ ℕ → 𝑘 ≠ 0)
132130, 131jca 512 . . . . . . . . . . . . . . . . 17 (𝑘 ∈ ℕ → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
133132adantl 482 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
134 divdir 11869 . . . . . . . . . . . . . . . 16 ((sup(𝑇, ℝ, < ) ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0)) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
135128, 129, 133, 134syl3anc 1371 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
1363mptex 7200 . . . . . . . . . . . . . . . . . . 19 (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V
1372fvmpt2 6986 . . . . . . . . . . . . . . . . . . 19 ((𝑥 ∈ ℝ ∧ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V) → (𝐹𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
138136, 137mpan2 689 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ℝ → (𝐹𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
139138fveq1d 6871 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ ℝ → ((𝐹𝑥)‘𝑘) = ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘))
140 ovex 7417 . . . . . . . . . . . . . . . . . 18 (sup(𝑇, ℝ, < ) / 𝑘) ∈ V
141 eqid 2731 . . . . . . . . . . . . . . . . . . 19 (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))
142141fvmpt2 6986 . . . . . . . . . . . . . . . . . 18 ((𝑘 ∈ ℕ ∧ (sup(𝑇, ℝ, < ) / 𝑘) ∈ V) → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
143140, 142mpan2 689 . . . . . . . . . . . . . . . . 17 (𝑘 ∈ ℕ → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
144139, 143sylan9eq 2791 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹𝑥)‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
145144oveq1d 7399 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
146135, 145eqtr4d 2774 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = (((𝐹𝑥)‘𝑘) + (1 / 𝑘)))
147146breq1d 5142 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 ↔ (((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
14881zred 12638 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℝ)
149148, 43lenltd 11332 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ) ↔ ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
150127, 147, 1493imtr3d 292 . . . . . . . . . . . 12 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
151150adantlr 713 . . . . . . . . . . 11 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((((𝐹𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
15280, 151syld 47 . . . . . . . . . 10 (((𝑥 ∈ ℝ ∧ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
153152exp31 420 . . . . . . . . 9 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
154153com4l 92 . . . . . . . 8 (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → (𝑥 ∈ ℝ → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
155154com14 96 . . . . . . 7 (𝑥 ∈ ℝ → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
1561553imp 1111 . . . . . 6 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘) → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
15745, 156mt2d 136 . . . . 5 ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘) → ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥)
158157rexlimdv3a 3158 . . . 4 (𝑥 ∈ ℝ → (∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹𝑥), ℝ, < ))) < 𝑘 → ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥))
15941, 158syld 47 . . 3 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) < 𝑥 → ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥))
160159pm2.01d 189 . 2 (𝑥 ∈ ℝ → ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥)
161 eqlelt 11273 . . 3 ((sup(ran (𝐹𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥)))
16230, 161mpancom 686 . 2 (𝑥 ∈ ℝ → (sup(ran (𝐹𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹𝑥), ℝ, < ) < 𝑥)))
16329, 160, 162mpbir2and 711 1 (𝑥 ∈ ℝ → sup(ran (𝐹𝑥), ℝ, < ) = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2939  wral 3060  wrex 3069  {crab 3425  Vcvv 3466  wss 3935  c0 4309   class class class wbr 5132  cmpt 5215  dom cdm 5660  ran crn 5661   Fn wfn 6518  wf 6519  cfv 6523  (class class class)co 7384  m cmap 8794  supcsup 9407  cc 11080  cr 11081  0cc0 11082  1c1 11083   + caddc 11085   · cmul 11087   < clt 11220  cle 11221  cmin 11416   / cdiv 11843  cn 12184  cz 12530  cq 12904
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5269  ax-sep 5283  ax-nul 5290  ax-pow 5347  ax-pr 5411  ax-un 7699  ax-resscn 11139  ax-1cn 11140  ax-icn 11141  ax-addcl 11142  ax-addrcl 11143  ax-mulcl 11144  ax-mulrcl 11145  ax-mulcom 11146  ax-addass 11147  ax-mulass 11148  ax-distr 11149  ax-i2m1 11150  ax-1ne0 11151  ax-1rid 11152  ax-rnegex 11153  ax-rrecex 11154  ax-cnre 11155  ax-pre-lttri 11156  ax-pre-lttrn 11157  ax-pre-ltadd 11158  ax-pre-mulgt0 11159  ax-pre-sup 11160
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3371  df-reu 3372  df-rab 3426  df-v 3468  df-sbc 3765  df-csb 3881  df-dif 3938  df-un 3940  df-in 3942  df-ss 3952  df-pss 3954  df-nul 4310  df-if 4514  df-pw 4589  df-sn 4614  df-pr 4616  df-op 4620  df-uni 4893  df-iun 4983  df-br 5133  df-opab 5195  df-mpt 5216  df-tr 5250  df-id 5558  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5615  df-we 5617  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6280  df-ord 6347  df-on 6348  df-lim 6349  df-suc 6350  df-iota 6475  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7340  df-ov 7387  df-oprab 7388  df-mpo 7389  df-om 7830  df-1st 7948  df-2nd 7949  df-frecs 8239  df-wrecs 8270  df-recs 8344  df-rdg 8383  df-er 8677  df-map 8796  df-en 8913  df-dom 8914  df-sdom 8915  df-sup 9409  df-pnf 11222  df-mnf 11223  df-xr 11224  df-ltxr 11225  df-le 11226  df-sub 11418  df-neg 11419  df-div 11844  df-nn 12185  df-n0 12445  df-z 12531  df-q 12905
This theorem is referenced by:  rpnnen1lem6  12938
  Copyright terms: Public domain W3C validator