Metamath Proof Explorer


Theorem iooiinioc

Description: A left-open, right-closed interval expressed as the indexed intersection of open intervals. (Contributed by Glauco Siliprandi, 26-Jun-2021)

Ref Expression
Hypotheses iooiinioc.1 ⊢ φ → A ∈ ℝ *
iooiinioc.2 ⊢ φ → B ∈ ℝ
Assertion iooiinioc ⊢ φ → ⋂ n ∈ ℕ A B + 1 n = A B

Proof

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