Metamath Proof Explorer


Theorem iuneqfzuzlem

Description: Lemma for iuneqfzuz : here, inclusion is proven; aiuneqfzuz uses this lemma twice, to prove equality. (Contributed by Glauco Siliprandi, 17-Aug-2020)

Ref Expression
Hypothesis iuneqfzuzlem.z ⊢ Z = ℤ ≥ N
Assertion iuneqfzuzlem ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B → ⋃ n ∈ Z A ⊆ ⋃ n ∈ Z B

Proof

Step Hyp Ref Expression
1 iuneqfzuzlem.z ⊢ Z = ℤ ≥ N
2 nfcv ⊢ Ⅎ _ m A
3 nfcsb1v ⊢ Ⅎ _ n ⦋ m / n⦌ A
4 csbeq1a ⊢ n = m → A = ⦋ m / n⦌ A
5 2 3 4 cbviun ⊢ ⋃ n ∈ Z A = ⋃ m ∈ Z ⦋ m / n⦌ A
6 5 eleq2i ⊢ x ∈ ⋃ n ∈ Z A ↔ x ∈ ⋃ m ∈ Z ⦋ m / n⦌ A
7 eliun ⊢ x ∈ ⋃ m ∈ Z ⦋ m / n⦌ A ↔ ∃ m ∈ Z x ∈ ⦋ m / n⦌ A
8 6 7 bitri ⊢ x ∈ ⋃ n ∈ Z A ↔ ∃ m ∈ Z x ∈ ⦋ m / n⦌ A
9 8 bilani ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⋃ n ∈ Z A → ∃ m ∈ Z x ∈ ⦋ m / n⦌ A
10 nfra1 ⊢ Ⅎ m ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B
11 nfv ⊢ Ⅎ m x ∈ ⋃ n ∈ Z B
12 simp2 ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → m ∈ Z
13 rspa ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ m ∈ Z → ⋃ n = N m A = ⋃ n = N m B
14 13 3adant3 ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → ⋃ n = N m A = ⋃ n = N m B
15 simp3 ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → x ∈ ⦋ m / n⦌ A
16 id ⊢ ⋃ n = N m A = ⋃ n = N m B → ⋃ n = N m A = ⋃ n = N m B
17 fzssuz ⊢ N … m ⊆ ℤ ≥ N
18 1 eqcomi ⊢ ℤ ≥ N = Z
19 17 18 sseqtri ⊢ N … m ⊆ Z
20 iunss1 ⊢ N … m ⊆ Z → ⋃ n = N m B ⊆ ⋃ n ∈ Z B
21 19 20 mp1i ⊢ ⋃ n = N m A = ⋃ n = N m B → ⋃ n = N m B ⊆ ⋃ n ∈ Z B
22 16 21 eqsstrd ⊢ ⋃ n = N m A = ⋃ n = N m B → ⋃ n = N m A ⊆ ⋃ n ∈ Z B
23 22 3ad2ant2 ⊢ m ∈ Z ∧ ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⦋ m / n⦌ A → ⋃ n = N m A ⊆ ⋃ n ∈ Z B
24 1 eleq2i ⊢ m ∈ Z ↔ m ∈ ℤ ≥ N
25 24 biimpi ⊢ m ∈ Z → m ∈ ℤ ≥ N
26 eluzel2 ⊢ m ∈ ℤ ≥ N → N ∈ ℤ
27 25 26 syl ⊢ m ∈ Z → N ∈ ℤ
28 eluzelz ⊢ m ∈ ℤ ≥ N → m ∈ ℤ
29 25 28 syl ⊢ m ∈ Z → m ∈ ℤ
30 eluzle ⊢ m ∈ ℤ ≥ N → N ≤ m
31 25 30 syl ⊢ m ∈ Z → N ≤ m
32 29 zred ⊢ m ∈ Z → m ∈ ℝ
33 leid ⊢ m ∈ ℝ → m ≤ m
34 32 33 syl ⊢ m ∈ Z → m ≤ m
35 27 29 29 31 34 elfzd ⊢ m ∈ Z → m ∈ N … m
36 nfcv ⊢ Ⅎ _ n x
37 36 3 nfel ⊢ Ⅎ n x ∈ ⦋ m / n⦌ A
38 4 eleq2d ⊢ n = m → x ∈ A ↔ x ∈ ⦋ m / n⦌ A
39 37 38 rspce ⊢ m ∈ N … m ∧ x ∈ ⦋ m / n⦌ A → ∃ n ∈ N … m x ∈ A
40 35 39 sylan ⊢ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → ∃ n ∈ N … m x ∈ A
41 eliun ⊢ x ∈ ⋃ n = N m A ↔ ∃ n ∈ N … m x ∈ A
42 40 41 sylibr ⊢ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n = N m A
43 42 3adant2 ⊢ m ∈ Z ∧ ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n = N m A
44 23 43 sseldd ⊢ m ∈ Z ∧ ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n ∈ Z B
45 12 14 15 44 syl3anc ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ m ∈ Z ∧ x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n ∈ Z B
46 45 3exp ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B → m ∈ Z → x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n ∈ Z B
47 10 11 46 rexlimd ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B → ∃ m ∈ Z x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n ∈ Z B
48 47 adantr ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⋃ n ∈ Z A → ∃ m ∈ Z x ∈ ⦋ m / n⦌ A → x ∈ ⋃ n ∈ Z B
49 9 48 mpd ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B ∧ x ∈ ⋃ n ∈ Z A → x ∈ ⋃ n ∈ Z B
50 49 ralrimiva ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B → ∀ x ∈ ⋃ n ∈ Z A x ∈ ⋃ n ∈ Z B
51 dfss3 ⊢ ⋃ n ∈ Z A ⊆ ⋃ n ∈ Z B ↔ ∀ x ∈ ⋃ n ∈ Z A x ∈ ⋃ n ∈ Z B
52 50 51 sylibr ⊢ ∀ m ∈ Z ⋃ n = N m A = ⋃ n = N m B → ⋃ n ∈ Z A ⊆ ⋃ n ∈ Z B