Metamath Proof Explorer


Theorem iooiinicc

Description: A closed interval expressed as the indexed intersection of open intervals. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Hypotheses iooiinicc.a ⊢ φ → A ∈ ℝ
iooiinicc.b ⊢ φ → B ∈ ℝ
Assertion iooiinicc ⊢ φ → ⋂ n ∈ ℕ A − 1 n B + 1 n = A B

Proof

Step Hyp Ref Expression
1 iooiinicc.a ⊢ φ → A ∈ ℝ
2 iooiinicc.b ⊢ φ → B ∈ ℝ
3 1 adantr ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → A ∈ ℝ
4 2 adantr ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → B ∈ ℝ
5 1nn ⊢ 1 ∈ ℕ
6 ioossre ⊢ A − 1 1 B + 1 1 ⊆ ℝ
7 oveq2 ⊢ n = 1 → 1 n = 1 1
8 7 oveq2d ⊢ n = 1 → A − 1 n = A − 1 1
9 7 oveq2d ⊢ n = 1 → B + 1 n = B + 1 1
10 8 9 oveq12d ⊢ n = 1 → A − 1 n B + 1 n = A − 1 1 B + 1 1
11 10 sseq1d ⊢ n = 1 → A − 1 n B + 1 n ⊆ ℝ ↔ A − 1 1 B + 1 1 ⊆ ℝ
12 11 rspcev ⊢ 1 ∈ ℕ ∧ A − 1 1 B + 1 1 ⊆ ℝ → ∃ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ
13 5 6 12 mp2an ⊢ ∃ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ
14 iinss ⊢ ∃ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ → ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ
15 13 14 ax-mp ⊢ ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ
16 15 a1i ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ ℝ
17 simpr ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n
18 16 17 sseldd ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ∈ ℝ
19 nfv ⊢ Ⅎ n φ
20 nfcv ⊢ Ⅎ _ n x
21 nfii1 ⊢ Ⅎ _ n ⋂ n ∈ ℕ A − 1 n B + 1 n
22 20 21 nfel ⊢ Ⅎ n x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n
23 19 22 nfan ⊢ Ⅎ n φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n
24 simpll ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → φ
25 iinss2 ⊢ n ∈ ℕ → ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ A − 1 n B + 1 n
26 25 adantl ⊢ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ A − 1 n B + 1 n
27 simpl ⊢ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n
28 26 27 sseldd ⊢ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ A − 1 n B + 1 n
29 28 adantll ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ A − 1 n B + 1 n
30 simpr ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → n ∈ ℕ
31 1 adantr ⊢ φ ∧ n ∈ ℕ → A ∈ ℝ
32 31 adantlr ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A ∈ ℝ
33 elioore ⊢ x ∈ A − 1 n B + 1 n → x ∈ ℝ
34 33 adantr ⊢ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ ℝ
35 nnrecre ⊢ n ∈ ℕ → 1 n ∈ ℝ
36 35 adantl ⊢ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → 1 n ∈ ℝ
37 34 36 readdcld ⊢ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x + 1 n ∈ ℝ
38 37 adantll ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x + 1 n ∈ ℝ
39 35 adantl ⊢ φ ∧ n ∈ ℕ → 1 n ∈ ℝ
40 31 39 resubcld ⊢ φ ∧ n ∈ ℕ → A − 1 n ∈ ℝ
41 40 rexrd ⊢ φ ∧ n ∈ ℕ → A − 1 n ∈ ℝ *
42 41 adantlr ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A − 1 n ∈ ℝ *
43 2 adantr ⊢ φ ∧ n ∈ ℕ → B ∈ ℝ
44 43 39 readdcld ⊢ φ ∧ n ∈ ℕ → B + 1 n ∈ ℝ
45 44 rexrd ⊢ φ ∧ n ∈ ℕ → B + 1 n ∈ ℝ *
46 45 adantlr ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → B + 1 n ∈ ℝ *
47 simplr ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ A − 1 n B + 1 n
48 ioogtlb ⊢ A − 1 n ∈ ℝ * ∧ B + 1 n ∈ ℝ * ∧ x ∈ A − 1 n B + 1 n → A − 1 n < x
49 42 46 47 48 syl3anc ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A − 1 n < x
50 35 adantl ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → 1 n ∈ ℝ
51 34 adantll ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x ∈ ℝ
52 32 50 51 ltsubaddd ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A − 1 n < x ↔ A < x + 1 n
53 49 52 mpbid ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A < x + 1 n
54 32 38 53 ltled ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → A ≤ x + 1 n
55 24 29 30 54 syl21anc ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → A ≤ x + 1 n
56 55 ex ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → n ∈ ℕ → A ≤ x + 1 n
57 23 56 ralrimi ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → ∀ n ∈ ℕ A ≤ x + 1 n
58 3 rexrd ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → A ∈ ℝ *
59 23 58 18 xrralrecnnle ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → A ≤ x ↔ ∀ n ∈ ℕ A ≤ x + 1 n
60 57 59 mpbird ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → A ≤ x
61 44 adantlr ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → B + 1 n ∈ ℝ
62 iooltub ⊢ A − 1 n ∈ ℝ * ∧ B + 1 n ∈ ℝ * ∧ x ∈ A − 1 n B + 1 n → x < B + 1 n
63 42 46 47 62 syl3anc ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x < B + 1 n
64 51 61 63 ltled ⊢ φ ∧ x ∈ A − 1 n B + 1 n ∧ n ∈ ℕ → x ≤ B + 1 n
65 24 29 30 64 syl21anc ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n ∧ n ∈ ℕ → x ≤ B + 1 n
66 65 ex ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → n ∈ ℕ → x ≤ B + 1 n
67 23 66 ralrimi ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → ∀ n ∈ ℕ x ≤ B + 1 n
68 18 rexrd ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ∈ ℝ *
69 23 68 4 xrralrecnnle ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ≤ B ↔ ∀ n ∈ ℕ x ≤ B + 1 n
70 67 69 mpbird ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ≤ B
71 3 4 18 60 70 eliccd ⊢ φ ∧ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n → x ∈ A B
72 71 ralrimiva ⊢ φ → ∀ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n x ∈ A B
73 dfss3 ⊢ ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ A B ↔ ∀ x ∈ ⋂ n ∈ ℕ A − 1 n B + 1 n x ∈ A B
74 72 73 sylibr ⊢ φ → ⋂ n ∈ ℕ A − 1 n B + 1 n ⊆ A B
75 1rp ⊢ 1 ∈ ℝ +
76 75 a1i ⊢ n ∈ ℕ → 1 ∈ ℝ +
77 nnrp ⊢ n ∈ ℕ → n ∈ ℝ +
78 76 77 rpdivcld ⊢ n ∈ ℕ → 1 n ∈ ℝ +
79 78 adantl ⊢ φ ∧ n ∈ ℕ → 1 n ∈ ℝ +
80 31 79 ltsubrpd ⊢ φ ∧ n ∈ ℕ → A − 1 n < A
81 43 79 ltaddrpd ⊢ φ ∧ n ∈ ℕ → B < B + 1 n
82 iccssioo ⊢ A − 1 n ∈ ℝ * ∧ B + 1 n ∈ ℝ * ∧ A − 1 n < A ∧ B < B + 1 n → A B ⊆ A − 1 n B + 1 n
83 41 45 80 81 82 syl22anc ⊢ φ ∧ n ∈ ℕ → A B ⊆ A − 1 n B + 1 n
84 83 ralrimiva ⊢ φ → ∀ n ∈ ℕ A B ⊆ A − 1 n B + 1 n
85 ssiin ⊢ A B ⊆ ⋂ n ∈ ℕ A − 1 n B + 1 n ↔ ∀ n ∈ ℕ A B ⊆ A − 1 n B + 1 n
86 84 85 sylibr ⊢ φ → A B ⊆ ⋂ n ∈ ℕ A − 1 n B + 1 n
87 74 86 eqssd ⊢ φ → ⋂ n ∈ ℕ A − 1 n B + 1 n = A B