Metamath Proof Explorer


Theorem rpnnen1lem1

Description: Lemma for rpnnen1 . (Contributed by Mario Carneiro, 12-May-2013) (Revised by NM, 13-Aug-2021) (Proof modification is discouraged.)

Ref Expression
Hypotheses rpnnen1lem.1 ⊢ T = n ∈ ℤ | n k < x
rpnnen1lem.2 ⊢ F = x ∈ ℝ ⟼ k ∈ ℕ ⟼ sup T ℝ < k
rpnnen1lem.n ⊢ ℕ ∈ V
rpnnen1lem.q ⊢ ℚ ∈ V
Assertion rpnnen1lem1 ⊢ x ∈ ℝ → F ⁡ x ∈ ℚ ℕ

Proof

Step Hyp Ref Expression
1 rpnnen1lem.1 ⊢ T = n ∈ ℤ | n k < x
2 rpnnen1lem.2 ⊢ F = x ∈ ℝ ⟼ k ∈ ℕ ⟼ sup T ℝ < k
3 rpnnen1lem.n ⊢ ℕ ∈ V
4 rpnnen1lem.q ⊢ ℚ ∈ V
5 3 mptex ⊢ k ∈ ℕ ⟼ sup T ℝ < k ∈ V
6 2 fvmpt2 ⊢ x ∈ ℝ ∧ k ∈ ℕ ⟼ sup T ℝ < k ∈ V → F ⁡ x = k ∈ ℕ ⟼ sup T ℝ < k
7 5 6 mpan2 ⊢ x ∈ ℝ → F ⁡ x = k ∈ ℕ ⟼ sup T ℝ < k
8 ssrab2 ⊢ n ∈ ℤ | n k < x ⊆ ℤ
9 1 8 eqsstri ⊢ T ⊆ ℤ
10 9 a1i ⊢ x ∈ ℝ ∧ k ∈ ℕ → T ⊆ ℤ
11 nnre ⊢ k ∈ ℕ → k ∈ ℝ
12 remulcl ⊢ k ∈ ℝ ∧ x ∈ ℝ → k ⁢ x ∈ ℝ
13 12 ancoms ⊢ x ∈ ℝ ∧ k ∈ ℝ → k ⁢ x ∈ ℝ
14 11 13 sylan2 ⊢ x ∈ ℝ ∧ k ∈ ℕ → k ⁢ x ∈ ℝ
15 btwnz ⊢ k ⁢ x ∈ ℝ → ∃ n ∈ ℤ n < k ⁢ x ∧ ∃ n ∈ ℤ k ⁢ x < n
16 15 simpld ⊢ k ⁢ x ∈ ℝ → ∃ n ∈ ℤ n < k ⁢ x
17 14 16 syl ⊢ x ∈ ℝ ∧ k ∈ ℕ → ∃ n ∈ ℤ n < k ⁢ x
18 zre ⊢ n ∈ ℤ → n ∈ ℝ
19 18 adantl ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → n ∈ ℝ
20 simpll ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → x ∈ ℝ
21 nngt0 ⊢ k ∈ ℕ → 0 < k
22 11 21 jca ⊢ k ∈ ℕ → k ∈ ℝ ∧ 0 < k
23 22 ad2antlr ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → k ∈ ℝ ∧ 0 < k
24 ltdivmul ⊢ n ∈ ℝ ∧ x ∈ ℝ ∧ k ∈ ℝ ∧ 0 < k → n k < x ↔ n < k ⁢ x
25 19 20 23 24 syl3anc ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → n k < x ↔ n < k ⁢ x
26 25 rexbidva ⊢ x ∈ ℝ ∧ k ∈ ℕ → ∃ n ∈ ℤ n k < x ↔ ∃ n ∈ ℤ n < k ⁢ x
27 17 26 mpbird ⊢ x ∈ ℝ ∧ k ∈ ℕ → ∃ n ∈ ℤ n k < x
28 rabn0 ⊢ n ∈ ℤ | n k < x ≠ ∅ ↔ ∃ n ∈ ℤ n k < x
29 27 28 sylibr ⊢ x ∈ ℝ ∧ k ∈ ℕ → n ∈ ℤ | n k < x ≠ ∅
30 1 neeq1i ⊢ T ≠ ∅ ↔ n ∈ ℤ | n k < x ≠ ∅
31 29 30 sylibr ⊢ x ∈ ℝ ∧ k ∈ ℕ → T ≠ ∅
32 1 reqabi ⊢ n ∈ T ↔ n ∈ ℤ ∧ n k < x
33 11 ad2antlr ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → k ∈ ℝ
34 33 20 12 syl2anc ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → k ⁢ x ∈ ℝ
35 ltle ⊢ n ∈ ℝ ∧ k ⁢ x ∈ ℝ → n < k ⁢ x → n ≤ k ⁢ x
36 19 34 35 syl2anc ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → n < k ⁢ x → n ≤ k ⁢ x
37 25 36 sylbid ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ → n k < x → n ≤ k ⁢ x
38 37 impr ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ ℤ ∧ n k < x → n ≤ k ⁢ x
39 32 38 sylan2b ⊢ x ∈ ℝ ∧ k ∈ ℕ ∧ n ∈ T → n ≤ k ⁢ x
40 39 ralrimiva ⊢ x ∈ ℝ ∧ k ∈ ℕ → ∀ n ∈ T n ≤ k ⁢ x
41 breq2 ⊢ y = k ⁢ x → n ≤ y ↔ n ≤ k ⁢ x
42 41 ralbidv ⊢ y = k ⁢ x → ∀ n ∈ T n ≤ y ↔ ∀ n ∈ T n ≤ k ⁢ x
43 42 rspcev ⊢ k ⁢ x ∈ ℝ ∧ ∀ n ∈ T n ≤ k ⁢ x → ∃ y ∈ ℝ ∀ n ∈ T n ≤ y
44 14 40 43 syl2anc ⊢ x ∈ ℝ ∧ k ∈ ℕ → ∃ y ∈ ℝ ∀ n ∈ T n ≤ y
45 suprzcl ⊢ T ⊆ ℤ ∧ T ≠ ∅ ∧ ∃ y ∈ ℝ ∀ n ∈ T n ≤ y → sup T ℝ < ∈ T
46 10 31 44 45 syl3anc ⊢ x ∈ ℝ ∧ k ∈ ℕ → sup T ℝ < ∈ T
47 9 46 sselid ⊢ x ∈ ℝ ∧ k ∈ ℕ → sup T ℝ < ∈ ℤ
48 znq ⊢ sup T ℝ < ∈ ℤ ∧ k ∈ ℕ → sup T ℝ < k ∈ ℚ
49 47 48 sylancom ⊢ x ∈ ℝ ∧ k ∈ ℕ → sup T ℝ < k ∈ ℚ
50 eqid ⊢ k ∈ ℕ ⟼ sup T ℝ < k = k ∈ ℕ ⟼ sup T ℝ < k
51 49 50 fmptd ⊢ x ∈ ℝ → k ∈ ℕ ⟼ sup T ℝ < k : ℕ ⟶ ℚ
52 4 3 elmap ⊢ k ∈ ℕ ⟼ sup T ℝ < k ∈ ℚ ℕ ↔ k ∈ ℕ ⟼ sup T ℝ < k : ℕ ⟶ ℚ
53 51 52 sylibr ⊢ x ∈ ℝ → k ∈ ℕ ⟼ sup T ℝ < k ∈ ℚ ℕ
54 7 53 eqeltrd ⊢ x ∈ ℝ → F ⁡ x ∈ ℚ ℕ