Metamath Proof Explorer


Theorem reprgt

Description: There are no representations of more than ( S x. N ) with only S terms bounded by N . Remark of Nathanson p. 123. (Contributed by Thierry Arnoux, 7-Dec-2021)

Ref Expression
Hypotheses reprgt.n ⊢ φ → N ∈ ℕ 0
reprgt.a ⊢ φ → A ⊆ 1 … N
reprgt.m ⊢ φ → M ∈ ℤ
reprgt.s ⊢ φ → S ∈ ℕ 0
reprgt.1 ⊢ φ → S ⋅ N < M
Assertion reprgt ⊢ φ → A repr ⁡ S M = ∅

Proof

Step Hyp Ref Expression
1 reprgt.n ⊢ φ → N ∈ ℕ 0
2 reprgt.a ⊢ φ → A ⊆ 1 … N
3 reprgt.m ⊢ φ → M ∈ ℤ
4 reprgt.s ⊢ φ → S ∈ ℕ 0
5 reprgt.1 ⊢ φ → S ⋅ N < M
6 fz1ssnn ⊢ 1 … N ⊆ ℕ
7 2 6 sstrdi ⊢ φ → A ⊆ ℕ
8 7 3 4 reprval ⊢ φ → A repr ⁡ S M = c ∈ A 0 ..^ S | ∑ a ∈ 0 ..^ S c ⁡ a = M
9 fzofi ⊢ 0 ..^ S ∈ Fin
10 9 a1i ⊢ φ ∧ c ∈ A 0 ..^ S → 0 ..^ S ∈ Fin
11 nnssre ⊢ ℕ ⊆ ℝ
12 7 11 sstrdi ⊢ φ → A ⊆ ℝ
13 12 ralrimivw ⊢ φ → ∀ a ∈ 0 ..^ S A ⊆ ℝ
14 13 ralrimivw ⊢ φ → ∀ c ∈ A 0 ..^ S ∀ a ∈ 0 ..^ S A ⊆ ℝ
15 14 r19.21bi ⊢ φ ∧ c ∈ A 0 ..^ S → ∀ a ∈ 0 ..^ S A ⊆ ℝ
16 15 r19.21bi ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → A ⊆ ℝ
17 ovex ⊢ 1 … N ∈ V
18 17 a1i ⊢ φ → 1 … N ∈ V
19 18 2 ssexd ⊢ φ → A ∈ V
20 19 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → A ∈ V
21 9 elexi ⊢ 0 ..^ S ∈ V
22 21 a1i ⊢ φ ∧ c ∈ A 0 ..^ S → 0 ..^ S ∈ V
23 simpr ⊢ φ ∧ c ∈ A 0 ..^ S → c ∈ A 0 ..^ S
24 elmapg ⊢ A ∈ V ∧ 0 ..^ S ∈ V → c ∈ A 0 ..^ S ↔ c : 0 ..^ S ⟶ A
25 24 biimpa ⊢ A ∈ V ∧ 0 ..^ S ∈ V ∧ c ∈ A 0 ..^ S → c : 0 ..^ S ⟶ A
26 20 22 23 25 syl21anc ⊢ φ ∧ c ∈ A 0 ..^ S → c : 0 ..^ S ⟶ A
27 26 adantr ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → c : 0 ..^ S ⟶ A
28 simpr ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → a ∈ 0 ..^ S
29 27 28 ffvelcdmd ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → c ⁡ a ∈ A
30 16 29 sseldd ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → c ⁡ a ∈ ℝ
31 10 30 fsumrecl ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S c ⁡ a ∈ ℝ
32 4 nn0red ⊢ φ → S ∈ ℝ
33 32 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → S ∈ ℝ
34 1 nn0red ⊢ φ → N ∈ ℝ
35 34 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → N ∈ ℝ
36 33 35 remulcld ⊢ φ ∧ c ∈ A 0 ..^ S → S ⋅ N ∈ ℝ
37 3 zred ⊢ φ → M ∈ ℝ
38 37 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → M ∈ ℝ
39 34 ad2antrr ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → N ∈ ℝ
40 2 ad2antrr ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → A ⊆ 1 … N
41 40 29 sseldd ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → c ⁡ a ∈ 1 … N
42 elfzle2 ⊢ c ⁡ a ∈ 1 … N → c ⁡ a ≤ N
43 41 42 syl ⊢ φ ∧ c ∈ A 0 ..^ S ∧ a ∈ 0 ..^ S → c ⁡ a ≤ N
44 10 30 39 43 fsumle ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S c ⁡ a ≤ ∑ a ∈ 0 ..^ S N
45 34 recnd ⊢ φ → N ∈ ℂ
46 fsumconst ⊢ 0 ..^ S ∈ Fin ∧ N ∈ ℂ → ∑ a ∈ 0 ..^ S N = 0 ..^ S ⋅ N
47 9 45 46 sylancr ⊢ φ → ∑ a ∈ 0 ..^ S N = 0 ..^ S ⋅ N
48 hashfzo0 ⊢ S ∈ ℕ 0 → 0 ..^ S = S
49 4 48 syl ⊢ φ → 0 ..^ S = S
50 49 oveq1d ⊢ φ → 0 ..^ S ⋅ N = S ⋅ N
51 47 50 eqtrd ⊢ φ → ∑ a ∈ 0 ..^ S N = S ⋅ N
52 51 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S N = S ⋅ N
53 44 52 breqtrd ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S c ⁡ a ≤ S ⋅ N
54 5 adantr ⊢ φ ∧ c ∈ A 0 ..^ S → S ⋅ N < M
55 31 36 38 53 54 lelttrd ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S c ⁡ a < M
56 31 55 ltned ⊢ φ ∧ c ∈ A 0 ..^ S → ∑ a ∈ 0 ..^ S c ⁡ a ≠ M
57 56 neneqd ⊢ φ ∧ c ∈ A 0 ..^ S → ¬ ∑ a ∈ 0 ..^ S c ⁡ a = M
58 57 ralrimiva ⊢ φ → ∀ c ∈ A 0 ..^ S ¬ ∑ a ∈ 0 ..^ S c ⁡ a = M
59 rabeq0 ⊢ c ∈ A 0 ..^ S | ∑ a ∈ 0 ..^ S c ⁡ a = M = ∅ ↔ ∀ c ∈ A 0 ..^ S ¬ ∑ a ∈ 0 ..^ S c ⁡ a = M
60 58 59 sylibr ⊢ φ → c ∈ A 0 ..^ S | ∑ a ∈ 0 ..^ S c ⁡ a = M = ∅
61 8 60 eqtrd ⊢ φ → A repr ⁡ S M = ∅