Metamath Proof Explorer


Theorem prmgaplem8

Description: Lemma for prmgap . (Contributed by AV, 13-Aug-2020)

Ref Expression
Hypotheses prmgaplem7.n ⊢ φ → N ∈ ℕ
prmgaplem7.f ⊢ φ → F ∈ ℕ ℕ
prmgaplem7.i ⊢ φ → ∀ i ∈ 2 … N 1 < F ⁡ N + i gcd i
Assertion prmgaplem8 ⊢ φ → ∃ p ∈ ℙ ∃ q ∈ ℙ N ≤ q − p ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ

Proof

Step Hyp Ref Expression
1 prmgaplem7.n ⊢ φ → N ∈ ℕ
2 prmgaplem7.f ⊢ φ → F ∈ ℕ ℕ
3 prmgaplem7.i ⊢ φ → ∀ i ∈ 2 … N 1 < F ⁡ N + i gcd i
4 prmnn ⊢ q ∈ ℙ → q ∈ ℕ
5 4 nnred ⊢ q ∈ ℙ → q ∈ ℝ
6 5 ad2antll ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → q ∈ ℝ
7 prmnn ⊢ p ∈ ℙ → p ∈ ℕ
8 7 nnred ⊢ p ∈ ℙ → p ∈ ℝ
9 8 ad2antlr ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p ∈ ℝ
10 9 adantl ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p ∈ ℝ
11 1 nnred ⊢ φ → N ∈ ℝ
12 11 ad2antrr ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → N ∈ ℝ
13 12 adantl ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → N ∈ ℝ
14 elmapi ⊢ F ∈ ℕ ℕ → F : ℕ ⟶ ℕ
15 ffvelcdm ⊢ F : ℕ ⟶ ℕ ∧ N ∈ ℕ → F ⁡ N ∈ ℕ
16 15 ex ⊢ F : ℕ ⟶ ℕ → N ∈ ℕ → F ⁡ N ∈ ℕ
17 2 14 16 3syl ⊢ φ → N ∈ ℕ → F ⁡ N ∈ ℕ
18 1 17 mpd ⊢ φ → F ⁡ N ∈ ℕ
19 18 nnred ⊢ φ → F ⁡ N ∈ ℝ
20 19 ad2antrr ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N ∈ ℝ
21 20 adantl ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N ∈ ℝ
22 1red ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → 1 ∈ ℝ
23 21 22 readdcld ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N + 1 ∈ ℝ
24 18 nncnd ⊢ φ → F ⁡ N ∈ ℂ
25 1cnd ⊢ φ → 1 ∈ ℂ
26 1 nncnd ⊢ φ → N ∈ ℂ
27 24 25 26 add32d ⊢ φ → F ⁡ N + 1 + N = F ⁡ N + N + 1
28 27 adantr ⊢ φ ∧ p ∈ ℙ → F ⁡ N + 1 + N = F ⁡ N + N + 1
29 28 ad2antrr ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ F ⁡ N + N < q → F ⁡ N + 1 + N = F ⁡ N + N + 1
30 18 nnzd ⊢ φ → F ⁡ N ∈ ℤ
31 30 adantr ⊢ φ ∧ p ∈ ℙ → F ⁡ N ∈ ℤ
32 1 nnzd ⊢ φ → N ∈ ℤ
33 32 adantr ⊢ φ ∧ p ∈ ℙ → N ∈ ℤ
34 31 33 zaddcld ⊢ φ ∧ p ∈ ℙ → F ⁡ N + N ∈ ℤ
35 prmz ⊢ q ∈ ℙ → q ∈ ℤ
36 zltp1le ⊢ F ⁡ N + N ∈ ℤ ∧ q ∈ ℤ → F ⁡ N + N < q ↔ F ⁡ N + N + 1 ≤ q
37 34 35 36 syl2an ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N + N < q ↔ F ⁡ N + N + 1 ≤ q
38 37 biimpa ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ F ⁡ N + N < q → F ⁡ N + N + 1 ≤ q
39 29 38 eqbrtrd ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ F ⁡ N + N < q → F ⁡ N + 1 + N ≤ q
40 39 expcom ⊢ F ⁡ N + N < q → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N + 1 + N ≤ q
41 40 adantl ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N + 1 + N ≤ q
42 41 imp ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → F ⁡ N + 1 + N ≤ q
43 df-2 ⊢ 2 = 1 + 1
44 43 a1i ⊢ φ → 2 = 1 + 1
45 44 oveq2d ⊢ φ → F ⁡ N + 2 = F ⁡ N + 1 + 1
46 24 25 25 addassd ⊢ φ → F ⁡ N + 1 + 1 = F ⁡ N + 1 + 1
47 45 46 eqtr4d ⊢ φ → F ⁡ N + 2 = F ⁡ N + 1 + 1
48 47 adantr ⊢ φ ∧ p ∈ ℙ → F ⁡ N + 2 = F ⁡ N + 1 + 1
49 48 breq2d ⊢ φ ∧ p ∈ ℙ → p < F ⁡ N + 2 ↔ p < F ⁡ N + 1 + 1
50 prmz ⊢ p ∈ ℙ → p ∈ ℤ
51 30 peano2zd ⊢ φ → F ⁡ N + 1 ∈ ℤ
52 zleltp1 ⊢ p ∈ ℤ ∧ F ⁡ N + 1 ∈ ℤ → p ≤ F ⁡ N + 1 ↔ p < F ⁡ N + 1 + 1
53 50 51 52 syl2anr ⊢ φ ∧ p ∈ ℙ → p ≤ F ⁡ N + 1 ↔ p < F ⁡ N + 1 + 1
54 53 biimprd ⊢ φ ∧ p ∈ ℙ → p < F ⁡ N + 1 + 1 → p ≤ F ⁡ N + 1
55 49 54 sylbid ⊢ φ ∧ p ∈ ℙ → p < F ⁡ N + 2 → p ≤ F ⁡ N + 1
56 55 adantr ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p < F ⁡ N + 2 → p ≤ F ⁡ N + 1
57 56 com12 ⊢ p < F ⁡ N + 2 → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p ≤ F ⁡ N + 1
58 57 adantr ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p ≤ F ⁡ N + 1
59 58 imp ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → p ≤ F ⁡ N + 1
60 6 10 13 23 42 59 lesub3d ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ φ ∧ p ∈ ℙ ∧ q ∈ ℙ → N ≤ q − p
61 60 ex ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → N ≤ q − p
62 61 3adant3 ⊢ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ → φ ∧ p ∈ ℙ ∧ q ∈ ℙ → N ≤ q − p
63 62 impcom ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ → N ≤ q − p
64 simpr3 ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ → ∀ z ∈ p + 1 ..^ q z ∉ ℙ
65 63 64 jca ⊢ φ ∧ p ∈ ℙ ∧ q ∈ ℙ ∧ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ → N ≤ q − p ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ
66 1 2 3 prmgaplem7 ⊢ φ → ∃ p ∈ ℙ ∃ q ∈ ℙ p < F ⁡ N + 2 ∧ F ⁡ N + N < q ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ
67 65 66 reximddv2 ⊢ φ → ∃ p ∈ ℙ ∃ q ∈ ℙ N ≤ q − p ∧ ∀ z ∈ p + 1 ..^ q z ∉ ℙ