Metamath Proof Explorer


Theorem ovolficc

Description: Unpack the interval covering property using closed intervals. (Contributed by Mario Carneiro, 16-Mar-2014)

Ref Expression
Assertion ovolficc ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → A ⊆ ⋃ ran ⁡ . ∘ F ↔ ∀ z ∈ A ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n

Proof

Step Hyp Ref Expression
1 iccf ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ *
2 inss2 ⊢ ≤ ∩ ℝ 2 ⊆ ℝ 2
3 rexpssxrxp ⊢ ℝ 2 ⊆ ℝ * × ℝ *
4 2 3 sstri ⊢ ≤ ∩ ℝ 2 ⊆ ℝ * × ℝ *
5 fss ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ ≤ ∩ ℝ 2 ⊆ ℝ * × ℝ * → F : ℕ ⟶ ℝ * × ℝ *
6 4 5 mpan2 ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → F : ℕ ⟶ ℝ * × ℝ *
7 fco ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ * ∧ F : ℕ ⟶ ℝ * × ℝ * → . ∘ F : ℕ ⟶ 𝒫 ℝ *
8 1 6 7 sylancr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → . ∘ F : ℕ ⟶ 𝒫 ℝ *
9 ffn ⊢ . ∘ F : ℕ ⟶ 𝒫 ℝ * → . ∘ F Fn ℕ
10 fniunfv ⊢ . ∘ F Fn ℕ → ⋃ n ∈ ℕ . ∘ F ⁡ n = ⋃ ran ⁡ . ∘ F
11 8 9 10 3syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ⋃ n ∈ ℕ . ∘ F ⁡ n = ⋃ ran ⁡ . ∘ F
12 11 sseq2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → A ⊆ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ A ⊆ ⋃ ran ⁡ . ∘ F
13 12 adantl ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → A ⊆ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ A ⊆ ⋃ ran ⁡ . ∘ F
14 dfss3 ⊢ A ⊆ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∀ z ∈ A z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n
15 ssel2 ⊢ A ⊆ ℝ ∧ z ∈ A → z ∈ ℝ
16 eliun ⊢ z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∃ n ∈ ℕ z ∈ . ∘ F ⁡ n
17 simpll ⊢ z ∈ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ ℝ
18 fvco3 ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → . ∘ F ⁡ n = . ⁡ F ⁡ n
19 ffvelcdm ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → F ⁡ n ∈ ≤ ∩ ℝ 2
20 19 elin2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → F ⁡ n ∈ ℝ 2
21 1st2nd2 ⊢ F ⁡ n ∈ ℝ 2 → F ⁡ n = 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
22 20 21 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → F ⁡ n = 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
23 22 fveq2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → . ⁡ F ⁡ n = . ⁡ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
24 df-ov ⊢ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n = . ⁡ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
25 23 24 eqtr4di ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → . ⁡ F ⁡ n = 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
26 18 25 eqtrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → . ∘ F ⁡ n = 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
27 26 eleq2d ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ . ∘ F ⁡ n ↔ z ∈ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n
28 ovolfcl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → 1 st ⁡ F ⁡ n ∈ ℝ ∧ 2 nd ⁡ F ⁡ n ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ 2 nd ⁡ F ⁡ n
29 elicc2 ⊢ 1 st ⁡ F ⁡ n ∈ ℝ ∧ 2 nd ⁡ F ⁡ n ∈ ℝ → z ∈ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
30 3anass ⊢ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
31 29 30 bitrdi ⊢ 1 st ⁡ F ⁡ n ∈ ℝ ∧ 2 nd ⁡ F ⁡ n ∈ ℝ → z ∈ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
32 31 3adant3 ⊢ 1 st ⁡ F ⁡ n ∈ ℝ ∧ 2 nd ⁡ F ⁡ n ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ 2 nd ⁡ F ⁡ n → z ∈ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
33 28 32 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ 1 st ⁡ F ⁡ n 2 nd ⁡ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
34 27 33 bitrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ . ∘ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
35 34 adantll ⊢ z ∈ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ . ∘ F ⁡ n ↔ z ∈ ℝ ∧ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
36 17 35 mpbirand ⊢ z ∈ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ n ∈ ℕ → z ∈ . ∘ F ⁡ n ↔ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
37 36 rexbidva ⊢ z ∈ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∃ n ∈ ℕ z ∈ . ∘ F ⁡ n ↔ ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
38 16 37 bitrid ⊢ z ∈ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
39 15 38 sylan ⊢ A ⊆ ℝ ∧ z ∈ A ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
40 39 an32s ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ z ∈ A → z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
41 40 ralbidva ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∀ z ∈ A z ∈ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∀ z ∈ A ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
42 14 41 bitrid ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → A ⊆ ⋃ n ∈ ℕ . ∘ F ⁡ n ↔ ∀ z ∈ A ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n
43 13 42 bitr3d ⊢ A ⊆ ℝ ∧ F : ℕ ⟶ ≤ ∩ ℝ 2 → A ⊆ ⋃ ran ⁡ . ∘ F ↔ ∀ z ∈ A ∃ n ∈ ℕ 1 st ⁡ F ⁡ n ≤ z ∧ z ≤ 2 nd ⁡ F ⁡ n