Metamath Proof Explorer


Theorem dyadss

Description: Two closed dyadic rational intervals are either in a subset relationship or are almost disjoint (the interiors are disjoint). (Contributed by Mario Carneiro, 26-Mar-2015) (Proof shortened by Mario Carneiro, 26-Apr-2016)

Ref Expression
Hypothesis dyadmbl.1 ⊢ F = x ∈ ℤ , y ∈ ℕ 0 ⟼ x 2 y x + 1 2 y
Assertion dyadss ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 → . ⁡ A F C ⊆ . ⁡ B F D → D ≤ C

Proof

Step Hyp Ref Expression
1 dyadmbl.1 ⊢ F = x ∈ ℤ , y ∈ ℕ 0 ⟼ x 2 y x + 1 2 y
2 simpr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → . ⁡ A F C ⊆ . ⁡ B F D
3 simpllr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B ∈ ℤ
4 simplrr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → D ∈ ℕ 0
5 1 dyadval ⊢ B ∈ ℤ ∧ D ∈ ℕ 0 → B F D = B 2 D B + 1 2 D
6 3 4 5 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B F D = B 2 D B + 1 2 D
7 6 fveq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → . ⁡ B F D = . ⁡ B 2 D B + 1 2 D
8 df-ov ⊢ B 2 D B + 1 2 D = . ⁡ B 2 D B + 1 2 D
9 7 8 eqtr4di ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → . ⁡ B F D = B 2 D B + 1 2 D
10 3 zred ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B ∈ ℝ
11 2nn ⊢ 2 ∈ ℕ
12 nnexpcl ⊢ 2 ∈ ℕ ∧ D ∈ ℕ 0 → 2 D ∈ ℕ
13 11 4 12 sylancr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 2 D ∈ ℕ
14 10 13 nndivred ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B 2 D ∈ ℝ
15 peano2re ⊢ B ∈ ℝ → B + 1 ∈ ℝ
16 10 15 syl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B + 1 ∈ ℝ
17 16 13 nndivred ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B + 1 2 D ∈ ℝ
18 iccssre ⊢ B 2 D ∈ ℝ ∧ B + 1 2 D ∈ ℝ → B 2 D B + 1 2 D ⊆ ℝ
19 14 17 18 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → B 2 D B + 1 2 D ⊆ ℝ
20 9 19 eqsstrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → . ⁡ B F D ⊆ ℝ
21 ovolss ⊢ . ⁡ A F C ⊆ . ⁡ B F D ∧ . ⁡ B F D ⊆ ℝ → vol * ⁡ . ⁡ A F C ≤ vol * ⁡ . ⁡ B F D
22 2 20 21 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → vol * ⁡ . ⁡ A F C ≤ vol * ⁡ . ⁡ B F D
23 simplll ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → A ∈ ℤ
24 simplrl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → C ∈ ℕ 0
25 1 dyadovol ⊢ A ∈ ℤ ∧ C ∈ ℕ 0 → vol * ⁡ . ⁡ A F C = 1 2 C
26 23 24 25 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → vol * ⁡ . ⁡ A F C = 1 2 C
27 1 dyadovol ⊢ B ∈ ℤ ∧ D ∈ ℕ 0 → vol * ⁡ . ⁡ B F D = 1 2 D
28 3 4 27 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → vol * ⁡ . ⁡ B F D = 1 2 D
29 22 26 28 3brtr3d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 1 2 C ≤ 1 2 D
30 nnexpcl ⊢ 2 ∈ ℕ ∧ C ∈ ℕ 0 → 2 C ∈ ℕ
31 11 24 30 sylancr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 2 C ∈ ℕ
32 nnre ⊢ 2 D ∈ ℕ → 2 D ∈ ℝ
33 nngt0 ⊢ 2 D ∈ ℕ → 0 < 2 D
34 32 33 jca ⊢ 2 D ∈ ℕ → 2 D ∈ ℝ ∧ 0 < 2 D
35 nnre ⊢ 2 C ∈ ℕ → 2 C ∈ ℝ
36 nngt0 ⊢ 2 C ∈ ℕ → 0 < 2 C
37 35 36 jca ⊢ 2 C ∈ ℕ → 2 C ∈ ℝ ∧ 0 < 2 C
38 lerec ⊢ 2 D ∈ ℝ ∧ 0 < 2 D ∧ 2 C ∈ ℝ ∧ 0 < 2 C → 2 D ≤ 2 C ↔ 1 2 C ≤ 1 2 D
39 34 37 38 syl2an ⊢ 2 D ∈ ℕ ∧ 2 C ∈ ℕ → 2 D ≤ 2 C ↔ 1 2 C ≤ 1 2 D
40 13 31 39 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 2 D ≤ 2 C ↔ 1 2 C ≤ 1 2 D
41 29 40 mpbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 2 D ≤ 2 C
42 2re ⊢ 2 ∈ ℝ
43 42 a1i ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 2 ∈ ℝ
44 4 nn0zd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → D ∈ ℤ
45 24 nn0zd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → C ∈ ℤ
46 1lt2 ⊢ 1 < 2
47 46 a1i ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → 1 < 2
48 43 44 45 47 leexp2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → D ≤ C ↔ 2 D ≤ 2 C
49 41 48 mpbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 ∧ . ⁡ A F C ⊆ . ⁡ B F D → D ≤ C
50 49 ex ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℕ 0 ∧ D ∈ ℕ 0 → . ⁡ A F C ⊆ . ⁡ B F D → D ≤ C