Metamath Proof Explorer


Theorem ltadd2i

Description: Addition to both sides of 'less than'. (Contributed by NM, 21-Jan-1997) (Proof shortened by OpenAI, 25-Mar-2020)

Ref Expression
Hypotheses lt.1 ⊢ A ∈ ℝ
lt.2 ⊢ B ∈ ℝ
lt.3 ⊢ C ∈ ℝ
Assertion ltadd2i ⊢ A < B ↔ C + A < C + B

Proof

Step Hyp Ref Expression
1 lt.1 ⊢ A ∈ ℝ
2 lt.2 ⊢ B ∈ ℝ
3 lt.3 ⊢ C ∈ ℝ
4 ltadd2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ → A < B ↔ C + A < C + B
5 1 2 3 4 mp3an ⊢ A < B ↔ C + A < C + B