Metamath Proof Explorer


Theorem lttrd

Description: Transitive law deduction for 'less than'. (Contributed by NM, 9-Jan-2006)

Ref Expression
Hypotheses ltd.1 ⊢ φ → A ∈ ℝ
ltd.2 ⊢ φ → B ∈ ℝ
letrd.3 ⊢ φ → C ∈ ℝ
lttrd.4 ⊢ φ → A < B
lttrd.5 ⊢ φ → B < C
Assertion lttrd ⊢ φ → A < C

Proof

Step Hyp Ref Expression
1 ltd.1 ⊢ φ → A ∈ ℝ
2 ltd.2 ⊢ φ → B ∈ ℝ
3 letrd.3 ⊢ φ → C ∈ ℝ
4 lttrd.4 ⊢ φ → A < B
5 lttrd.5 ⊢ φ → B < C
6 lttr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ → A < B ∧ B < C → A < C
7 1 2 3 6 syl3anc ⊢ φ → A < B ∧ B < C → A < C
8 4 5 7 mp2and ⊢ φ → A < C