Metamath Proof Explorer


Theorem iinhoiicc

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

Ref Expression
Hypotheses iunhoiicc.k ⊢ Ⅎ k φ
iunhoiicc.a ⊢ φ ∧ k ∈ X → A ∈ ℝ
iunhoiicc.b ⊢ φ ∧ k ∈ X → B ∈ ℝ
Assertion iinhoiicc ⊢ φ → ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n = ⨉ k ∈ X A B

Proof

Step Hyp Ref Expression
1 iunhoiicc.k ⊢ Ⅎ k φ
2 iunhoiicc.a ⊢ φ ∧ k ∈ X → A ∈ ℝ
3 iunhoiicc.b ⊢ φ ∧ k ∈ X → B ∈ ℝ
4 oveq2 ⊢ n = m → 1 n = 1 m
5 4 oveq2d ⊢ n = m → B + 1 n = B + 1 m
6 5 oveq2d ⊢ n = m → A B + 1 n = A B + 1 m
7 6 ixpeq2dv ⊢ n = m → ⨉ k ∈ X A B + 1 n = ⨉ k ∈ X A B + 1 m
8 7 cbviinv ⊢ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n = ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
9 8 eleq2i ⊢ f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n ↔ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
10 9 bilani ⊢ φ ∧ f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n → f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
11 nfcv ⊢ Ⅎ _ k f
12 nfcv ⊢ Ⅎ _ k ℕ
13 nfixp1 ⊢ Ⅎ _ k ⨉ k ∈ X A B + 1 m
14 12 13 nfiin ⊢ Ⅎ _ k ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
15 11 14 nfel ⊢ Ⅎ k f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
16 1 15 nfan ⊢ Ⅎ k φ ∧ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m
17 2 adantlr ⊢ φ ∧ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m ∧ k ∈ X → A ∈ ℝ
18 3 adantlr ⊢ φ ∧ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m ∧ k ∈ X → B ∈ ℝ
19 9 bilanri ⊢ φ ∧ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m → f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n
20 16 17 18 19 iinhoiicclem ⊢ φ ∧ f ∈ ⋂ m ∈ ℕ ⨉ k ∈ X A B + 1 m → f ∈ ⨉ k ∈ X A B
21 10 20 syldan ⊢ φ ∧ f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n → f ∈ ⨉ k ∈ X A B
22 21 ralrimiva ⊢ φ → ∀ f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n f ∈ ⨉ k ∈ X A B
23 dfss3 ⊢ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n ⊆ ⨉ k ∈ X A B ↔ ∀ f ∈ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n f ∈ ⨉ k ∈ X A B
24 22 23 sylibr ⊢ φ → ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n ⊆ ⨉ k ∈ X A B
25 nfv ⊢ Ⅎ k n ∈ ℕ
26 1 25 nfan ⊢ Ⅎ k φ ∧ n ∈ ℕ
27 2 rexrd ⊢ φ ∧ k ∈ X → A ∈ ℝ *
28 27 adantlr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → A ∈ ℝ *
29 3 adantlr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → B ∈ ℝ
30 nnrp ⊢ n ∈ ℕ → n ∈ ℝ +
31 30 ad2antlr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → n ∈ ℝ +
32 31 rpreccld ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → 1 n ∈ ℝ +
33 32 rpred ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → 1 n ∈ ℝ
34 29 33 readdcld ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → B + 1 n ∈ ℝ
35 34 rexrd ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → B + 1 n ∈ ℝ *
36 2 adantlr ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → A ∈ ℝ
37 36 leidd ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → A ≤ A
38 29 32 ltaddrpd ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → B < B + 1 n
39 iccssico ⊢ A ∈ ℝ * ∧ B + 1 n ∈ ℝ * ∧ A ≤ A ∧ B < B + 1 n → A B ⊆ A B + 1 n
40 28 35 37 38 39 syl22anc ⊢ φ ∧ n ∈ ℕ ∧ k ∈ X → A B ⊆ A B + 1 n
41 26 40 ixpssixp ⊢ φ ∧ n ∈ ℕ → ⨉ k ∈ X A B ⊆ ⨉ k ∈ X A B + 1 n
42 41 ralrimiva ⊢ φ → ∀ n ∈ ℕ ⨉ k ∈ X A B ⊆ ⨉ k ∈ X A B + 1 n
43 ssiin ⊢ ⨉ k ∈ X A B ⊆ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n ↔ ∀ n ∈ ℕ ⨉ k ∈ X A B ⊆ ⨉ k ∈ X A B + 1 n
44 42 43 sylibr ⊢ φ → ⨉ k ∈ X A B ⊆ ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n
45 24 44 eqssd ⊢ φ → ⋂ n ∈ ℕ ⨉ k ∈ X A B + 1 n = ⨉ k ∈ X A B