Metamath Proof Explorer


Theorem icodiamlt

Description: Two elements in a half-open interval have separationstrictly less than the difference between the endpoints. (Contributed by Stefan O'Rear, 12-Sep-2014)

Ref Expression
Assertion icodiamlt ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ A B ∧ D ∈ A B → C − D < B − A

Proof

Step Hyp Ref Expression
1 rexr ⊢ B ∈ ℝ → B ∈ ℝ *
2 elico2 ⊢ A ∈ ℝ ∧ B ∈ ℝ * → C ∈ A B ↔ C ∈ ℝ ∧ A ≤ C ∧ C < B
3 elico2 ⊢ A ∈ ℝ ∧ B ∈ ℝ * → D ∈ A B ↔ D ∈ ℝ ∧ A ≤ D ∧ D < B
4 2 3 anbi12d ⊢ A ∈ ℝ ∧ B ∈ ℝ * → C ∈ A B ∧ D ∈ A B ↔ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B
5 4 biimpd ⊢ A ∈ ℝ ∧ B ∈ ℝ * → C ∈ A B ∧ D ∈ A B → C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B
6 1 5 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ → C ∈ A B ∧ D ∈ A B → C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B
7 simplr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → B ∈ ℝ
8 7 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → B ∈ ℂ
9 simpll ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A ∈ ℝ
10 9 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A ∈ ℂ
11 8 10 negsubdi2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → − B − A = A − B
12 9 7 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A − B ∈ ℝ
13 simprl1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C ∈ ℝ
14 13 7 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − B ∈ ℝ
15 simprr1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → D ∈ ℝ
16 13 15 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D ∈ ℝ
17 simprl2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A ≤ C
18 9 13 7 17 lesub1dd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A − B ≤ C − B
19 simprr3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → D < B
20 15 7 13 19 ltsub2dd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − B < C − D
21 12 14 16 18 20 lelttrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A − B < C − D
22 11 21 eqbrtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → − B − A < C − D
23 7 15 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → B − D ∈ ℝ
24 7 9 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → B − A ∈ ℝ
25 simprl3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C < B
26 13 7 15 25 ltsub1dd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D < B − D
27 simprr2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → A ≤ D
28 9 15 7 27 lesub2dd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → B − D ≤ B − A
29 16 23 24 26 28 ltletrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D < B − A
30 16 24 absltd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D < B − A ↔ − B − A < C − D ∧ C − D < B − A
31 22 29 30 mpbir2and ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D < B − A
32 31 ex ⊢ A ∈ ℝ ∧ B ∈ ℝ → C ∈ ℝ ∧ A ≤ C ∧ C < B ∧ D ∈ ℝ ∧ A ≤ D ∧ D < B → C − D < B − A
33 6 32 syld ⊢ A ∈ ℝ ∧ B ∈ ℝ → C ∈ A B ∧ D ∈ A B → C − D < B − A
34 33 imp ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ A B ∧ D ∈ A B → C − D < B − A