Metamath Proof Explorer


Theorem ovolficcss

Description: Any (closed) interval covering is a subset of the reals. (Contributed by Mario Carneiro, 24-Mar-2015)

Ref Expression
Assertion ovolficcss ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ⋃ ran ⁡ . ∘ F ⊆ ℝ

Proof

Step Hyp Ref Expression
1 rnco2 ⊢ ran ⁡ . ∘ F = . ran ⁡ F
2 ffvelcdm ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → F ⁡ y ∈ ≤ ∩ ℝ 2
3 2 elin2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → F ⁡ y ∈ ℝ 2
4 1st2nd2 ⊢ F ⁡ y ∈ ℝ 2 → F ⁡ y = 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y
5 3 4 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → F ⁡ y = 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y
6 5 fveq2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → . ⁡ F ⁡ y = . ⁡ 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y
7 df-ov ⊢ 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y = . ⁡ 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y
8 6 7 eqtr4di ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → . ⁡ F ⁡ y = 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y
9 xp1st ⊢ F ⁡ y ∈ ℝ 2 → 1 st ⁡ F ⁡ y ∈ ℝ
10 3 9 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → 1 st ⁡ F ⁡ y ∈ ℝ
11 xp2nd ⊢ F ⁡ y ∈ ℝ 2 → 2 nd ⁡ F ⁡ y ∈ ℝ
12 3 11 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → 2 nd ⁡ F ⁡ y ∈ ℝ
13 iccssre ⊢ 1 st ⁡ F ⁡ y ∈ ℝ ∧ 2 nd ⁡ F ⁡ y ∈ ℝ → 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y ⊆ ℝ
14 10 12 13 syl2anc ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → 1 st ⁡ F ⁡ y 2 nd ⁡ F ⁡ y ⊆ ℝ
15 8 14 eqsstrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → . ⁡ F ⁡ y ⊆ ℝ
16 reex ⊢ ℝ ∈ V
17 16 elpw2 ⊢ . ⁡ F ⁡ y ∈ 𝒫 ℝ ↔ . ⁡ F ⁡ y ⊆ ℝ
18 15 17 sylibr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ y ∈ ℕ → . ⁡ F ⁡ y ∈ 𝒫 ℝ
19 18 ralrimiva ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∀ y ∈ ℕ . ⁡ F ⁡ y ∈ 𝒫 ℝ
20 ffn ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → F Fn ℕ
21 fveq2 ⊢ x = F ⁡ y → . ⁡ x = . ⁡ F ⁡ y
22 21 eleq1d ⊢ x = F ⁡ y → . ⁡ x ∈ 𝒫 ℝ ↔ . ⁡ F ⁡ y ∈ 𝒫 ℝ
23 22 ralrn ⊢ F Fn ℕ → ∀ x ∈ ran ⁡ F . ⁡ x ∈ 𝒫 ℝ ↔ ∀ y ∈ ℕ . ⁡ F ⁡ y ∈ 𝒫 ℝ
24 20 23 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∀ x ∈ ran ⁡ F . ⁡ x ∈ 𝒫 ℝ ↔ ∀ y ∈ ℕ . ⁡ F ⁡ y ∈ 𝒫 ℝ
25 19 24 mpbird ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∀ x ∈ ran ⁡ F . ⁡ x ∈ 𝒫 ℝ
26 iccf ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ *
27 ffun ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ * → Fun ⁡ .
28 26 27 ax-mp ⊢ Fun ⁡ .
29 frn ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ran ⁡ F ⊆ ≤ ∩ ℝ 2
30 inss2 ⊢ ≤ ∩ ℝ 2 ⊆ ℝ 2
31 rexpssxrxp ⊢ ℝ 2 ⊆ ℝ * × ℝ *
32 30 31 sstri ⊢ ≤ ∩ ℝ 2 ⊆ ℝ * × ℝ *
33 26 fdmi ⊢ dom ⁡ . = ℝ * × ℝ *
34 32 33 sseqtrri ⊢ ≤ ∩ ℝ 2 ⊆ dom ⁡ .
35 29 34 sstrdi ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ran ⁡ F ⊆ dom ⁡ .
36 funimass4 ⊢ Fun ⁡ . ∧ ran ⁡ F ⊆ dom ⁡ . → . ran ⁡ F ⊆ 𝒫 ℝ ↔ ∀ x ∈ ran ⁡ F . ⁡ x ∈ 𝒫 ℝ
37 28 35 36 sylancr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → . ran ⁡ F ⊆ 𝒫 ℝ ↔ ∀ x ∈ ran ⁡ F . ⁡ x ∈ 𝒫 ℝ
38 25 37 mpbird ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → . ran ⁡ F ⊆ 𝒫 ℝ
39 1 38 eqsstrid ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ran ⁡ . ∘ F ⊆ 𝒫 ℝ
40 sspwuni ⊢ ran ⁡ . ∘ F ⊆ 𝒫 ℝ ↔ ⋃ ran ⁡ . ∘ F ⊆ ℝ
41 39 40 sylib ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ⋃ ran ⁡ . ∘ F ⊆ ℝ