Metamath Proof Explorer


Theorem xralrple4

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 xralrple4.a ⊢ φ → A ∈ ℝ *
xralrple4.b ⊢ φ → B ∈ ℝ
xralrple4.n ⊢ φ → N ∈ ℕ
Assertion xralrple4 ⊢ φ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x N

Proof

Step Hyp Ref Expression
1 xralrple4.a ⊢ φ → A ∈ ℝ *
2 xralrple4.b ⊢ φ → B ∈ ℝ
3 xralrple4.n ⊢ φ → N ∈ ℕ
4 1 ad2antrr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → A ∈ ℝ *
5 2 rexrd ⊢ φ → B ∈ ℝ *
6 5 ad2antrr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → B ∈ ℝ *
7 2 ad2antrr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → B ∈ ℝ
8 rpre ⊢ x ∈ ℝ + → x ∈ ℝ
9 8 adantl ⊢ φ ∧ x ∈ ℝ + → x ∈ ℝ
10 3 nnnn0d ⊢ φ → N ∈ ℕ 0
11 10 adantr ⊢ φ ∧ x ∈ ℝ + → N ∈ ℕ 0
12 9 11 reexpcld ⊢ φ ∧ x ∈ ℝ + → x N ∈ ℝ
13 12 adantlr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → x N ∈ ℝ
14 7 13 readdcld ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → B + x N ∈ ℝ
15 14 rexrd ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → B + x N ∈ ℝ *
16 simplr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → A ≤ B
17 rpge0 ⊢ x ∈ ℝ + → 0 ≤ x
18 17 adantl ⊢ φ ∧ x ∈ ℝ + → 0 ≤ x
19 9 11 18 expge0d ⊢ φ ∧ x ∈ ℝ + → 0 ≤ x N
20 2 adantr ⊢ φ ∧ x ∈ ℝ + → B ∈ ℝ
21 20 12 addge01d ⊢ φ ∧ x ∈ ℝ + → 0 ≤ x N ↔ B ≤ B + x N
22 19 21 mpbid ⊢ φ ∧ x ∈ ℝ + → B ≤ B + x N
23 22 adantlr ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → B ≤ B + x N
24 4 6 15 16 23 xrletrd ⊢ φ ∧ A ≤ B ∧ x ∈ ℝ + → A ≤ B + x N
25 24 ralrimiva ⊢ φ ∧ A ≤ B → ∀ x ∈ ℝ + A ≤ B + x N
26 25 ex ⊢ φ → A ≤ B → ∀ x ∈ ℝ + A ≤ B + x N
27 simpr ⊢ φ ∧ y ∈ ℝ + → y ∈ ℝ +
28 3 nnrpd ⊢ φ → N ∈ ℝ +
29 28 rpreccld ⊢ φ → 1 N ∈ ℝ +
30 29 rpred ⊢ φ → 1 N ∈ ℝ
31 30 adantr ⊢ φ ∧ y ∈ ℝ + → 1 N ∈ ℝ
32 27 31 rpcxpcld ⊢ φ ∧ y ∈ ℝ + → y 1 N ∈ ℝ +
33 32 adantlr ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N ∧ y ∈ ℝ + → y 1 N ∈ ℝ +
34 simplr ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N ∧ y ∈ ℝ + → ∀ x ∈ ℝ + A ≤ B + x N
35 oveq1 ⊢ x = y 1 N → x N = y 1 N N
36 35 oveq2d ⊢ x = y 1 N → B + x N = B + y 1 N N
37 36 breq2d ⊢ x = y 1 N → A ≤ B + x N ↔ A ≤ B + y 1 N N
38 37 rspcva ⊢ y 1 N ∈ ℝ + ∧ ∀ x ∈ ℝ + A ≤ B + x N → A ≤ B + y 1 N N
39 33 34 38 syl2anc ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N ∧ y ∈ ℝ + → A ≤ B + y 1 N N
40 27 rpcnd ⊢ φ ∧ y ∈ ℝ + → y ∈ ℂ
41 3 adantr ⊢ φ ∧ y ∈ ℝ + → N ∈ ℕ
42 cxproot ⊢ y ∈ ℂ ∧ N ∈ ℕ → y 1 N N = y
43 40 41 42 syl2anc ⊢ φ ∧ y ∈ ℝ + → y 1 N N = y
44 43 oveq2d ⊢ φ ∧ y ∈ ℝ + → B + y 1 N N = B + y
45 44 adantlr ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N ∧ y ∈ ℝ + → B + y 1 N N = B + y
46 39 45 breqtrd ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N ∧ y ∈ ℝ + → A ≤ B + y
47 46 ralrimiva ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N → ∀ y ∈ ℝ + A ≤ B + y
48 xralrple ⊢ A ∈ ℝ * ∧ B ∈ ℝ → A ≤ B ↔ ∀ y ∈ ℝ + A ≤ B + y
49 1 2 48 syl2anc ⊢ φ → A ≤ B ↔ ∀ y ∈ ℝ + A ≤ B + y
50 49 adantr ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N → A ≤ B ↔ ∀ y ∈ ℝ + A ≤ B + y
51 47 50 mpbird ⊢ φ ∧ ∀ x ∈ ℝ + A ≤ B + x N → A ≤ B
52 51 ex ⊢ φ → ∀ x ∈ ℝ + A ≤ B + x N → A ≤ B
53 26 52 impbid ⊢ φ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x N