Metamath Proof Explorer


Theorem xrralrecnnle

Description: Show that A is less than B by showing that there is no positive bound on the difference. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Hypotheses xrralrecnnle.n ⊢ Ⅎ n φ
xrralrecnnle.a ⊢ φ → A ∈ ℝ *
xrralrecnnle.b ⊢ φ → B ∈ ℝ
Assertion xrralrecnnle ⊢ φ → A ≤ B ↔ ∀ n ∈ ℕ A ≤ B + 1 n

Proof

Step Hyp Ref Expression
1 xrralrecnnle.n ⊢ Ⅎ n φ
2 xrralrecnnle.a ⊢ φ → A ∈ ℝ *
3 xrralrecnnle.b ⊢ φ → B ∈ ℝ
4 nfv ⊢ Ⅎ n A ≤ B
5 1 4 nfan ⊢ Ⅎ n φ ∧ A ≤ B
6 2 ad2antrr ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → A ∈ ℝ *
7 3 adantr ⊢ φ ∧ n ∈ ℕ → B ∈ ℝ
8 nnrecre ⊢ n ∈ ℕ → 1 n ∈ ℝ
9 8 adantl ⊢ φ ∧ n ∈ ℕ → 1 n ∈ ℝ
10 7 9 readdcld ⊢ φ ∧ n ∈ ℕ → B + 1 n ∈ ℝ
11 10 rexrd ⊢ φ ∧ n ∈ ℕ → B + 1 n ∈ ℝ *
12 11 adantlr ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → B + 1 n ∈ ℝ *
13 rexr ⊢ B ∈ ℝ → B ∈ ℝ *
14 3 13 syl ⊢ φ → B ∈ ℝ *
15 14 ad2antrr ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → B ∈ ℝ *
16 simplr ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → A ≤ B
17 nnrp ⊢ n ∈ ℕ → n ∈ ℝ +
18 rpreccl ⊢ n ∈ ℝ + → 1 n ∈ ℝ +
19 17 18 syl ⊢ n ∈ ℕ → 1 n ∈ ℝ +
20 19 adantl ⊢ φ ∧ n ∈ ℕ → 1 n ∈ ℝ +
21 7 20 ltaddrpd ⊢ φ ∧ n ∈ ℕ → B < B + 1 n
22 21 adantlr ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → B < B + 1 n
23 6 15 12 16 22 xrlelttrd ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → A < B + 1 n
24 6 12 23 xrltled ⊢ φ ∧ A ≤ B ∧ n ∈ ℕ → A ≤ B + 1 n
25 24 ex ⊢ φ ∧ A ≤ B → n ∈ ℕ → A ≤ B + 1 n
26 5 25 ralrimi ⊢ φ ∧ A ≤ B → ∀ n ∈ ℕ A ≤ B + 1 n
27 26 ex ⊢ φ → A ≤ B → ∀ n ∈ ℕ A ≤ B + 1 n
28 rpgtrecnn ⊢ x ∈ ℝ + → ∃ n ∈ ℕ 1 n < x
29 28 adantl ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + → ∃ n ∈ ℕ 1 n < x
30 nfra1 ⊢ Ⅎ n ∀ n ∈ ℕ A ≤ B + 1 n
31 1 30 nfan ⊢ Ⅎ n φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n
32 nfv ⊢ Ⅎ n x ∈ ℝ +
33 31 32 nfan ⊢ Ⅎ n φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ +
34 nfv ⊢ Ⅎ n A ≤ B + x
35 simpll ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ n ∈ ℕ → φ
36 rspa ⊢ ∀ n ∈ ℕ A ≤ B + 1 n ∧ n ∈ ℕ → A ≤ B + 1 n
37 36 adantll ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ n ∈ ℕ → A ≤ B + 1 n
38 35 37 jca ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ n ∈ ℕ → φ ∧ A ≤ B + 1 n
39 38 adantlr ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ → φ ∧ A ≤ B + 1 n
40 simplr ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ → x ∈ ℝ +
41 simpr ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ → n ∈ ℕ
42 2 ad4antr ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → A ∈ ℝ *
43 3 adantr ⊢ φ ∧ x ∈ ℝ + → B ∈ ℝ
44 rpre ⊢ x ∈ ℝ + → x ∈ ℝ
45 44 adantl ⊢ φ ∧ x ∈ ℝ + → x ∈ ℝ
46 43 45 readdcld ⊢ φ ∧ x ∈ ℝ + → B + x ∈ ℝ
47 46 rexrd ⊢ φ ∧ x ∈ ℝ + → B + x ∈ ℝ *
48 47 ad5ant13 ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → B + x ∈ ℝ *
49 11 ad5ant14 ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → B + 1 n ∈ ℝ *
50 simp-4r ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → A ≤ B + 1 n
51 8 ad2antlr ⊢ φ ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → 1 n ∈ ℝ
52 45 ad2antrr ⊢ φ ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → x ∈ ℝ
53 43 ad2antrr ⊢ φ ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → B ∈ ℝ
54 simpr ⊢ φ ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → 1 n < x
55 51 52 53 54 ltadd2dd ⊢ φ ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → B + 1 n < B + x
56 55 adantl3r ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → B + 1 n < B + x
57 42 49 48 50 56 xrlelttrd ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → A < B + x
58 42 48 57 xrltled ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ ∧ 1 n < x → A ≤ B + x
59 58 ex ⊢ φ ∧ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ → 1 n < x → A ≤ B + x
60 39 40 41 59 syl21anc ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + ∧ n ∈ ℕ → 1 n < x → A ≤ B + x
61 60 ex ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + → n ∈ ℕ → 1 n < x → A ≤ B + x
62 33 34 61 rexlimd ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + → ∃ n ∈ ℕ 1 n < x → A ≤ B + x
63 29 62 mpd ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n ∧ x ∈ ℝ + → A ≤ B + x
64 63 ralrimiva ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n → ∀ x ∈ ℝ + A ≤ B + x
65 xralrple ⊢ A ∈ ℝ * ∧ B ∈ ℝ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x
66 2 3 65 syl2anc ⊢ φ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x
67 66 adantr ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x
68 64 67 mpbird ⊢ φ ∧ ∀ n ∈ ℕ A ≤ B + 1 n → A ≤ B
69 68 ex ⊢ φ → ∀ n ∈ ℕ A ≤ B + 1 n → A ≤ B
70 27 69 impbid ⊢ φ → A ≤ B ↔ ∀ n ∈ ℕ A ≤ B + 1 n