Metamath Proof Explorer


Theorem ioorrnopnxr

Description: The indexed product of open intervals is an open set in ( RR^X ) . Similar to ioorrnopn but here unbounded intervals are allowed. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Hypotheses ioorrnopnxr.x ⊢ φ → X ∈ Fin
ioorrnopnxr.a ⊢ φ → A : X ⟶ ℝ *
ioorrnopnxr.b ⊢ φ → B : X ⟶ ℝ *
Assertion ioorrnopnxr ⊢ φ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X

Proof

Step Hyp Ref Expression
1 ioorrnopnxr.x ⊢ φ → X ∈ Fin
2 ioorrnopnxr.a ⊢ φ → A : X ⟶ ℝ *
3 ioorrnopnxr.b ⊢ φ → B : X ⟶ ℝ *
4 p0ex ⊢ ∅ ∈ V
5 4 prid2 ⊢ ∅ ∈ ∅ ∅
6 5 a1i ⊢ X = ∅ → ∅ ∈ ∅ ∅
7 ixpeq1 ⊢ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i = ⨉ i ∈ ∅ A ⁡ i B ⁡ i
8 ixp0x ⊢ ⨉ i ∈ ∅ A ⁡ i B ⁡ i = ∅
9 8 a1i ⊢ X = ∅ → ⨉ i ∈ ∅ A ⁡ i B ⁡ i = ∅
10 7 9 eqtrd ⊢ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i = ∅
11 2fveq3 ⊢ X = ∅ → TopOpen ⁡ X = TopOpen ⁡ ∅
12 rrxtopn0b ⊢ TopOpen ⁡ ∅ = ∅ ∅
13 12 a1i ⊢ X = ∅ → TopOpen ⁡ ∅ = ∅ ∅
14 11 13 eqtrd ⊢ X = ∅ → TopOpen ⁡ X = ∅ ∅
15 10 14 eleq12d ⊢ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X ↔ ∅ ∈ ∅ ∅
16 6 15 mpbird ⊢ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X
17 16 adantl ⊢ φ ∧ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X
18 neqne ⊢ ¬ X = ∅ → X ≠ ∅
19 18 adantl ⊢ φ ∧ ¬ X = ∅ → X ≠ ∅
20 fveq2 ⊢ i = j → A ⁡ i = A ⁡ j
21 fveq2 ⊢ i = j → B ⁡ i = B ⁡ j
22 20 21 oveq12d ⊢ i = j → A ⁡ i B ⁡ i = A ⁡ j B ⁡ j
23 22 cbvixpv ⊢ ⨉ i ∈ X A ⁡ i B ⁡ i = ⨉ j ∈ X A ⁡ j B ⁡ j
24 23 eleq2i ⊢ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i ↔ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j
25 24 bilani ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i → f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j
26 1 ad2antrr ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j → X ∈ Fin
27 2 ad2antrr ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j → A : X ⟶ ℝ *
28 3 ad2antrr ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j → B : X ⟶ ℝ *
29 24 bilanri ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j → f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i
30 fveq2 ⊢ j = i → A ⁡ j = A ⁡ i
31 30 eqeq1d ⊢ j = i → A ⁡ j = −∞ ↔ A ⁡ i = −∞
32 fveq2 ⊢ j = i → f ⁡ j = f ⁡ i
33 32 oveq1d ⊢ j = i → f ⁡ j − 1 = f ⁡ i − 1
34 31 33 30 ifbieq12d ⊢ j = i → if A ⁡ j = −∞ f ⁡ j − 1 A ⁡ j = if A ⁡ i = −∞ f ⁡ i − 1 A ⁡ i
35 34 cbvmptv ⊢ j ∈ X ⟼ if A ⁡ j = −∞ f ⁡ j − 1 A ⁡ j = i ∈ X ⟼ if A ⁡ i = −∞ f ⁡ i − 1 A ⁡ i
36 fveq2 ⊢ j = i → B ⁡ j = B ⁡ i
37 36 eqeq1d ⊢ j = i → B ⁡ j = +∞ ↔ B ⁡ i = +∞
38 32 oveq1d ⊢ j = i → f ⁡ j + 1 = f ⁡ i + 1
39 37 38 36 ifbieq12d ⊢ j = i → if B ⁡ j = +∞ f ⁡ j + 1 B ⁡ j = if B ⁡ i = +∞ f ⁡ i + 1 B ⁡ i
40 39 cbvmptv ⊢ j ∈ X ⟼ if B ⁡ j = +∞ f ⁡ j + 1 B ⁡ j = i ∈ X ⟼ if B ⁡ i = +∞ f ⁡ i + 1 B ⁡ i
41 eqid ⊢ ⨉ i ∈ X j ∈ X ⟼ if A ⁡ j = −∞ f ⁡ j − 1 A ⁡ j ⁡ i j ∈ X ⟼ if B ⁡ j = +∞ f ⁡ j + 1 B ⁡ j ⁡ i = ⨉ i ∈ X j ∈ X ⟼ if A ⁡ j = −∞ f ⁡ j − 1 A ⁡ j ⁡ i j ∈ X ⟼ if B ⁡ j = +∞ f ⁡ j + 1 B ⁡ j ⁡ i
42 26 27 28 29 35 40 41 ioorrnopnxrlem ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ j ∈ X A ⁡ j B ⁡ j → ∃ v ∈ TopOpen ⁡ X f ∈ v ∧ v ⊆ ⨉ i ∈ X A ⁡ i B ⁡ i
43 25 42 syldan ⊢ φ ∧ X ≠ ∅ ∧ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i → ∃ v ∈ TopOpen ⁡ X f ∈ v ∧ v ⊆ ⨉ i ∈ X A ⁡ i B ⁡ i
44 43 ralrimiva ⊢ φ ∧ X ≠ ∅ → ∀ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i ∃ v ∈ TopOpen ⁡ X f ∈ v ∧ v ⊆ ⨉ i ∈ X A ⁡ i B ⁡ i
45 eqid ⊢ TopOpen ⁡ X = TopOpen ⁡ X
46 45 rrxtop ⊢ X ∈ Fin → TopOpen ⁡ X ∈ Top
47 1 46 syl ⊢ φ → TopOpen ⁡ X ∈ Top
48 47 adantr ⊢ φ ∧ X ≠ ∅ → TopOpen ⁡ X ∈ Top
49 eltop2 ⊢ TopOpen ⁡ X ∈ Top → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X ↔ ∀ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i ∃ v ∈ TopOpen ⁡ X f ∈ v ∧ v ⊆ ⨉ i ∈ X A ⁡ i B ⁡ i
50 48 49 syl ⊢ φ ∧ X ≠ ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X ↔ ∀ f ∈ ⨉ i ∈ X A ⁡ i B ⁡ i ∃ v ∈ TopOpen ⁡ X f ∈ v ∧ v ⊆ ⨉ i ∈ X A ⁡ i B ⁡ i
51 44 50 mpbird ⊢ φ ∧ X ≠ ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X
52 19 51 syldan ⊢ φ ∧ ¬ X = ∅ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X
53 17 52 pm2.61dan ⊢ φ → ⨉ i ∈ X A ⁡ i B ⁡ i ∈ TopOpen ⁡ X