Metamath Proof Explorer


Theorem iunincfi

Description: Given a sequence of increasing sets, the union of a finite subsequence, is its last element. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Hypotheses iunincfi.1 ⊢ φ → N ∈ ℤ ≥ M
iunincfi.2 ⊢ φ ∧ n ∈ M ..^ N → F ⁡ n ⊆ F ⁡ n + 1
Assertion iunincfi ⊢ φ → ⋃ n = M N F ⁡ n = F ⁡ N

Proof

Step Hyp Ref Expression
1 iunincfi.1 ⊢ φ → N ∈ ℤ ≥ M
2 iunincfi.2 ⊢ φ ∧ n ∈ M ..^ N → F ⁡ n ⊆ F ⁡ n + 1
3 eliun ⊢ x ∈ ⋃ n = M N F ⁡ n ↔ ∃ n ∈ M … N x ∈ F ⁡ n
4 3 bilani ⊢ φ ∧ x ∈ ⋃ n = M N F ⁡ n → ∃ n ∈ M … N x ∈ F ⁡ n
5 elfzuz3 ⊢ n ∈ M … N → N ∈ ℤ ≥ n
6 5 adantl ⊢ φ ∧ n ∈ M … N → N ∈ ℤ ≥ n
7 simpll ⊢ φ ∧ n ∈ M … N ∧ m ∈ n ..^ N → φ
8 elfzuz ⊢ n ∈ M … N → n ∈ ℤ ≥ M
9 fzoss1 ⊢ n ∈ ℤ ≥ M → n ..^ N ⊆ M ..^ N
10 8 9 syl ⊢ n ∈ M … N → n ..^ N ⊆ M ..^ N
11 10 adantr ⊢ n ∈ M … N ∧ m ∈ n ..^ N → n ..^ N ⊆ M ..^ N
12 simpr ⊢ n ∈ M … N ∧ m ∈ n ..^ N → m ∈ n ..^ N
13 11 12 sseldd ⊢ n ∈ M … N ∧ m ∈ n ..^ N → m ∈ M ..^ N
14 13 adantll ⊢ φ ∧ n ∈ M … N ∧ m ∈ n ..^ N → m ∈ M ..^ N
15 eleq1w ⊢ n = m → n ∈ M ..^ N ↔ m ∈ M ..^ N
16 15 anbi2d ⊢ n = m → φ ∧ n ∈ M ..^ N ↔ φ ∧ m ∈ M ..^ N
17 fveq2 ⊢ n = m → F ⁡ n = F ⁡ m
18 fvoveq1 ⊢ n = m → F ⁡ n + 1 = F ⁡ m + 1
19 17 18 sseq12d ⊢ n = m → F ⁡ n ⊆ F ⁡ n + 1 ↔ F ⁡ m ⊆ F ⁡ m + 1
20 16 19 imbi12d ⊢ n = m → φ ∧ n ∈ M ..^ N → F ⁡ n ⊆ F ⁡ n + 1 ↔ φ ∧ m ∈ M ..^ N → F ⁡ m ⊆ F ⁡ m + 1
21 20 2 chvarvv ⊢ φ ∧ m ∈ M ..^ N → F ⁡ m ⊆ F ⁡ m + 1
22 7 14 21 syl2anc ⊢ φ ∧ n ∈ M … N ∧ m ∈ n ..^ N → F ⁡ m ⊆ F ⁡ m + 1
23 6 22 ssinc ⊢ φ ∧ n ∈ M … N → F ⁡ n ⊆ F ⁡ N
24 23 3adant3 ⊢ φ ∧ n ∈ M … N ∧ x ∈ F ⁡ n → F ⁡ n ⊆ F ⁡ N
25 simp3 ⊢ φ ∧ n ∈ M … N ∧ x ∈ F ⁡ n → x ∈ F ⁡ n
26 24 25 sseldd ⊢ φ ∧ n ∈ M … N ∧ x ∈ F ⁡ n → x ∈ F ⁡ N
27 26 3exp ⊢ φ → n ∈ M … N → x ∈ F ⁡ n → x ∈ F ⁡ N
28 27 rexlimdv ⊢ φ → ∃ n ∈ M … N x ∈ F ⁡ n → x ∈ F ⁡ N
29 28 imp ⊢ φ ∧ ∃ n ∈ M … N x ∈ F ⁡ n → x ∈ F ⁡ N
30 4 29 syldan ⊢ φ ∧ x ∈ ⋃ n = M N F ⁡ n → x ∈ F ⁡ N
31 30 ralrimiva ⊢ φ → ∀ x ∈ ⋃ n = M N F ⁡ n x ∈ F ⁡ N
32 dfss3 ⊢ ⋃ n = M N F ⁡ n ⊆ F ⁡ N ↔ ∀ x ∈ ⋃ n = M N F ⁡ n x ∈ F ⁡ N
33 31 32 sylibr ⊢ φ → ⋃ n = M N F ⁡ n ⊆ F ⁡ N
34 eluzfz2 ⊢ N ∈ ℤ ≥ M → N ∈ M … N
35 1 34 syl ⊢ φ → N ∈ M … N
36 fveq2 ⊢ n = N → F ⁡ n = F ⁡ N
37 36 ssiun2s ⊢ N ∈ M … N → F ⁡ N ⊆ ⋃ n = M N F ⁡ n
38 35 37 syl ⊢ φ → F ⁡ N ⊆ ⋃ n = M N F ⁡ n
39 33 38 eqssd ⊢ φ → ⋃ n = M N F ⁡ n = F ⁡ N