Metamath Proof Explorer


Theorem alrple

Description: Show that A is less than B by showing that there is no positive bound on the difference. (Contributed by Mario Carneiro, 12-Jun-2014)

Ref Expression
Assertion alrple ⊢ A ∈ ℝ ∧ B ∈ ℝ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x

Proof

Step Hyp Ref Expression
1 rexr ⊢ A ∈ ℝ → A ∈ ℝ *
2 xralrple ⊢ A ∈ ℝ * ∧ B ∈ ℝ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x
3 1 2 sylan ⊢ A ∈ ℝ ∧ B ∈ ℝ → A ≤ B ↔ ∀ x ∈ ℝ + A ≤ B + x