Metamath Proof Explorer


Theorem prodmolem2

Description: Lemma for prodmo . (Contributed by Scott Fenton, 4-Dec-2017)

Ref Expression
Hypotheses prodmo.1 ⊢ F = k ∈ ℤ ⟼ if k ∈ A B 1
prodmo.2 ⊢ φ ∧ k ∈ A → B ∈ ℂ
prodmo.3 ⊢ G = j ∈ ℕ ⟼ ⦋ f ⁡ j / k⦌ B
Assertion prodmolem2 ⊢ φ ∧ ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ ∃ n ∈ ℤ ≥ m ∃ y y ≠ 0 ∧ seq n × F ⇝ y ∧ seq m × F ⇝ x → ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z

Proof

Step Hyp Ref Expression
1 prodmo.1 ⊢ F = k ∈ ℤ ⟼ if k ∈ A B 1
2 prodmo.2 ⊢ φ ∧ k ∈ A → B ∈ ℂ
3 prodmo.3 ⊢ G = j ∈ ℕ ⟼ ⦋ f ⁡ j / k⦌ B
4 3simpb ⊢ A ⊆ ℤ ≥ m ∧ ∃ n ∈ ℤ ≥ m ∃ y y ≠ 0 ∧ seq n × F ⇝ y ∧ seq m × F ⇝ x → A ⊆ ℤ ≥ m ∧ seq m × F ⇝ x
5 4 reximi ⊢ ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ ∃ n ∈ ℤ ≥ m ∃ y y ≠ 0 ∧ seq n × F ⇝ y ∧ seq m × F ⇝ x → ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ seq m × F ⇝ x
6 fveq2 ⊢ m = w → ℤ ≥ m = ℤ ≥ w
7 6 sseq2d ⊢ m = w → A ⊆ ℤ ≥ m ↔ A ⊆ ℤ ≥ w
8 seqeq1 ⊢ m = w → seq m × F = seq w × F
9 8 breq1d ⊢ m = w → seq m × F ⇝ x ↔ seq w × F ⇝ x
10 7 9 anbi12d ⊢ m = w → A ⊆ ℤ ≥ m ∧ seq m × F ⇝ x ↔ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x
11 10 cbvrexvw ⊢ ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ seq m × F ⇝ x ↔ ∃ w ∈ ℤ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x
12 reeanv ⊢ ∃ w ∈ ℤ ∃ m ∈ ℕ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m ↔ ∃ w ∈ ℤ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m
13 simprlr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → seq w × F ⇝ x
14 simprll ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → A ⊆ ℤ ≥ w
15 uzssz ⊢ ℤ ≥ w ⊆ ℤ
16 zssre ⊢ ℤ ⊆ ℝ
17 15 16 sstri ⊢ ℤ ≥ w ⊆ ℝ
18 14 17 sstrdi ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → A ⊆ ℝ
19 ltso ⊢ < Or ℝ
20 soss ⊢ A ⊆ ℝ → < Or ℝ → < Or A
21 18 19 20 mpisyl ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → < Or A
22 fzfi ⊢ 1 … m ∈ Fin
23 ovex ⊢ 1 … m ∈ V
24 23 f1oen ⊢ f : 1 … m ⟶ 1-1 onto A → 1 … m ≈ A
25 24 ad2antll ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → 1 … m ≈ A
26 25 ensymd ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → A ≈ 1 … m
27 enfii ⊢ 1 … m ∈ Fin ∧ A ≈ 1 … m → A ∈ Fin
28 22 26 27 sylancr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → A ∈ Fin
29 fz1iso ⊢ < Or A ∧ A ∈ Fin → ∃ g g Isom < , < 1 … A A
30 21 28 29 syl2anc ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → ∃ g g Isom < , < 1 … A A
31 2 ad4ant14 ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A ∧ k ∈ A → B ∈ ℂ
32 eqid ⊢ j ∈ ℕ ⟼ ⦋ g ⁡ j / k⦌ B = j ∈ ℕ ⟼ ⦋ g ⁡ j / k⦌ B
33 simplrr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → m ∈ ℕ
34 simplrl ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → w ∈ ℤ
35 simplll ⊢ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → A ⊆ ℤ ≥ w
36 35 adantl ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → A ⊆ ℤ ≥ w
37 simprlr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → f : 1 … m ⟶ 1-1 onto A
38 simprr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → g Isom < , < 1 … A A
39 1 31 3 32 33 34 36 37 38 prodmolem2a ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A ∧ g Isom < , < 1 … A A → seq w × F ⇝ seq 1 × G ⁡ m
40 39 expr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → g Isom < , < 1 … A A → seq w × F ⇝ seq 1 × G ⁡ m
41 40 exlimdv ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → ∃ g g Isom < , < 1 … A A → seq w × F ⇝ seq 1 × G ⁡ m
42 30 41 mpd ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → seq w × F ⇝ seq 1 × G ⁡ m
43 climuni ⊢ seq w × F ⇝ x ∧ seq w × F ⇝ seq 1 × G ⁡ m → x = seq 1 × G ⁡ m
44 13 42 43 syl2anc ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → x = seq 1 × G ⁡ m
45 eqeq2 ⊢ z = seq 1 × G ⁡ m → x = z ↔ x = seq 1 × G ⁡ m
46 44 45 syl5ibrcom ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ f : 1 … m ⟶ 1-1 onto A → z = seq 1 × G ⁡ m → x = z
47 46 expr ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x → f : 1 … m ⟶ 1-1 onto A → z = seq 1 × G ⁡ m → x = z
48 47 impd ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x → f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
49 48 exlimdv ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ ∧ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x → ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
50 49 expimpd ⊢ φ ∧ w ∈ ℤ ∧ m ∈ ℕ → A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
51 50 rexlimdvva ⊢ φ → ∃ w ∈ ℤ ∃ m ∈ ℕ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
52 12 51 biimtrrid ⊢ φ → ∃ w ∈ ℤ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x ∧ ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
53 52 expdimp ⊢ φ ∧ ∃ w ∈ ℤ A ⊆ ℤ ≥ w ∧ seq w × F ⇝ x → ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
54 11 53 sylan2b ⊢ φ ∧ ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ seq m × F ⇝ x → ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z
55 5 54 sylan2 ⊢ φ ∧ ∃ m ∈ ℤ A ⊆ ℤ ≥ m ∧ ∃ n ∈ ℤ ≥ m ∃ y y ≠ 0 ∧ seq n × F ⇝ y ∧ seq m × F ⇝ x → ∃ m ∈ ℕ ∃ f f : 1 … m ⟶ 1-1 onto A ∧ z = seq 1 × G ⁡ m → x = z