Metamath Proof Explorer


Theorem ovolfsf

Description: Closure for the interval length function. (Contributed by Mario Carneiro, 16-Mar-2014)

Ref Expression
Hypothesis ovolfs.1 ⊢ G = abs ∘ − ∘ F
Assertion ovolfsf ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → G : ℕ ⟶ 0 +∞

Proof

Step Hyp Ref Expression
1 ovolfs.1 ⊢ G = abs ∘ − ∘ F
2 absf ⊢ abs : ℂ ⟶ ℝ
3 subf ⊢ − : ℂ × ℂ ⟶ ℂ
4 fco ⊢ abs : ℂ ⟶ ℝ ∧ − : ℂ × ℂ ⟶ ℂ → abs ∘ − : ℂ × ℂ ⟶ ℝ
5 2 3 4 mp2an ⊢ abs ∘ − : ℂ × ℂ ⟶ ℝ
6 inss2 ⊢ ≤ ∩ ℝ 2 ⊆ ℝ 2
7 ax-resscn ⊢ ℝ ⊆ ℂ
8 xpss12 ⊢ ℝ ⊆ ℂ ∧ ℝ ⊆ ℂ → ℝ 2 ⊆ ℂ × ℂ
9 7 7 8 mp2an ⊢ ℝ 2 ⊆ ℂ × ℂ
10 6 9 sstri ⊢ ≤ ∩ ℝ 2 ⊆ ℂ × ℂ
11 fss ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ ≤ ∩ ℝ 2 ⊆ ℂ × ℂ → F : ℕ ⟶ ℂ × ℂ
12 10 11 mpan2 ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → F : ℕ ⟶ ℂ × ℂ
13 fco ⊢ abs ∘ − : ℂ × ℂ ⟶ ℝ ∧ F : ℕ ⟶ ℂ × ℂ → abs ∘ − ∘ F : ℕ ⟶ ℝ
14 5 12 13 sylancr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → abs ∘ − ∘ F : ℕ ⟶ ℝ
15 1 feq1i ⊢ G : ℕ ⟶ ℝ ↔ abs ∘ − ∘ F : ℕ ⟶ ℝ
16 14 15 sylibr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → G : ℕ ⟶ ℝ
17 16 ffnd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → G Fn ℕ
18 16 ffvelcdmda ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → G ⁡ x ∈ ℝ
19 ovolfcl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → 1 st ⁡ F ⁡ x ∈ ℝ ∧ 2 nd ⁡ F ⁡ x ∈ ℝ ∧ 1 st ⁡ F ⁡ x ≤ 2 nd ⁡ F ⁡ x
20 subge0 ⊢ 2 nd ⁡ F ⁡ x ∈ ℝ ∧ 1 st ⁡ F ⁡ x ∈ ℝ → 0 ≤ 2 nd ⁡ F ⁡ x − 1 st ⁡ F ⁡ x ↔ 1 st ⁡ F ⁡ x ≤ 2 nd ⁡ F ⁡ x
21 20 ancoms ⊢ 1 st ⁡ F ⁡ x ∈ ℝ ∧ 2 nd ⁡ F ⁡ x ∈ ℝ → 0 ≤ 2 nd ⁡ F ⁡ x − 1 st ⁡ F ⁡ x ↔ 1 st ⁡ F ⁡ x ≤ 2 nd ⁡ F ⁡ x
22 21 biimp3ar ⊢ 1 st ⁡ F ⁡ x ∈ ℝ ∧ 2 nd ⁡ F ⁡ x ∈ ℝ ∧ 1 st ⁡ F ⁡ x ≤ 2 nd ⁡ F ⁡ x → 0 ≤ 2 nd ⁡ F ⁡ x − 1 st ⁡ F ⁡ x
23 19 22 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → 0 ≤ 2 nd ⁡ F ⁡ x − 1 st ⁡ F ⁡ x
24 1 ovolfsval ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → G ⁡ x = 2 nd ⁡ F ⁡ x − 1 st ⁡ F ⁡ x
25 23 24 breqtrrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → 0 ≤ G ⁡ x
26 elrege0 ⊢ G ⁡ x ∈ 0 +∞ ↔ G ⁡ x ∈ ℝ ∧ 0 ≤ G ⁡ x
27 18 25 26 sylanbrc ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ x ∈ ℕ → G ⁡ x ∈ 0 +∞
28 27 ralrimiva ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ∀ x ∈ ℕ G ⁡ x ∈ 0 +∞
29 ffnfv ⊢ G : ℕ ⟶ 0 +∞ ↔ G Fn ℕ ∧ ∀ x ∈ ℕ G ⁡ x ∈ 0 +∞
30 17 28 29 sylanbrc ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → G : ℕ ⟶ 0 +∞