MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  4sqlem19 Structured version   Visualization version   GIF version

Theorem 4sqlem19 17187
Description: Lemma for 4sq 17188. The proof is by strong induction - we show that if all the integers less than 𝑘 are in 𝑆, then 𝑘 is as well. In this part of the proof we do the induction argument and dispense with all the cases except the odd prime case, which is sent to 4sqlem18 17186. If 𝑘 is 0, 1, 2, we show 𝑘 ∈ 𝑆 directly; otherwise if 𝑘 is composite, 𝑘 is the product of two numbers less than it (and hence in 𝑆 by assumption), so by mul4sq 17178 𝑘 ∈ 𝑆. (Contributed by Mario Carneiro, 14-Jul-2014.) (Revised by Mario Carneiro, 20-Jun-2015.)
Hypothesis
Ref Expression
4sq.1 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
Assertion
Ref Expression
4sqlem19 ℕ0 = 𝑆
Distinct variable groups:   𝑤,𝑛,𝑥,𝑦,𝑧   𝑆,𝑛
Allowed substitution hints:   𝑆(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem 4sqlem19
Dummy variables 𝑗 𝑘 𝑖 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elnn0 12647 . . . 4 (𝑘 ∈ ℕ0 ↔ (𝑘 ∈ ℕ ∨ 𝑘 = 0))
2 eleq1 2855 . . . . . 6 (𝑗 = 1 → (𝑗 ∈ 𝑆 ↔ 1 ∈ 𝑆))
3 eleq1 2855 . . . . . 6 (𝑗 = 𝑚 → (𝑗 ∈ 𝑆 ↔ 𝑚 ∈ 𝑆))
4 eleq1 2855 . . . . . 6 (𝑗 = 𝑖 → (𝑗 ∈ 𝑆 ↔ 𝑖 ∈ 𝑆))
5 eleq1 2855 . . . . . 6 (𝑗 = (𝑚 · 𝑖) → (𝑗 ∈ 𝑆 ↔ (𝑚 · 𝑖) ∈ 𝑆))
6 eleq1 2855 . . . . . 6 (𝑗 = 𝑘 → (𝑗 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
7 abs1 15506 . . . . . . . . . . 11 (abs‘1) = 1
87oveq1i 7460 . . . . . . . . . 10 ((abs‘1)↑2) = (1↑2)
9 sq1 14377 . . . . . . . . . 10 (1↑2) = 1
108, 9eqtri 2789 . . . . . . . . 9 ((abs‘1)↑2) = 1
11 abs0 15494 . . . . . . . . . . 11 (abs‘0) = 0
1211oveq1i 7460 . . . . . . . . . 10 ((abs‘0)↑2) = (0↑2)
13 sq0 14374 . . . . . . . . . 10 (0↑2) = 0
1412, 13eqtri 2789 . . . . . . . . 9 ((abs‘0)↑2) = 0
1510, 14oveq12i 7462 . . . . . . . 8 (((abs‘1)↑2) + ((abs‘0)↑2)) = (1 + 0)
16 1p0e1 12504 . . . . . . . 8 (1 + 0) = 1
1715, 16eqtri 2789 . . . . . . 7 (((abs‘1)↑2) + ((abs‘0)↑2)) = 1
18 1z 12765 . . . . . . . . 9 1 ∈ ℤ
19 zgz 17157 . . . . . . . . 9 (1 ∈ ℤ → 1 ∈ ℤ[i])
2018, 19ax-mp 5 . . . . . . . 8 1 ∈ ℤ[i]
21 0z 12743 . . . . . . . . 9 0 ∈ ℤ
22 zgz 17157 . . . . . . . . 9 (0 ∈ ℤ → 0 ∈ ℤ[i])
2321, 22ax-mp 5 . . . . . . . 8 0 ∈ ℤ[i]
24 4sq.1 . . . . . . . . 9 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
25244sqlem4a 17175 . . . . . . . 8 ((1 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
2620, 23, 25mp2an 705 . . . . . . 7 (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆
2717, 26eqeltrri 2864 . . . . . 6 1 ∈ 𝑆
28 eleq1 2855 . . . . . . 7 (𝑗 = 2 → (𝑗 ∈ 𝑆 ↔ 2 ∈ 𝑆))
29 eldifsn 4749 . . . . . . . . 9 (𝑗 ∈ (ℙ ∖ {2}) ↔ (𝑗 ∈ ℙ ∧ 𝑗 ≠ 2))
30 oddprm 17034 . . . . . . . . . . 11 (𝑗 ∈ (ℙ ∖ {2}) → ((𝑗 − 1) / 2) ∈ ℕ)
3130adantr 486 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) / 2) ∈ ℕ)
32 eldifi 4069 . . . . . . . . . . . . . . . 16 (𝑗 ∈ (ℙ ∖ {2}) → 𝑗 ∈ ℙ)
3332adantr 486 . . . . . . . . . . . . . . 15 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℙ)
34 prmnn 16892 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℙ → 𝑗 ∈ ℕ)
35 nncn 12382 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℕ → 𝑗 ∈ ℂ)
3633, 34, 353syl 19 . . . . . . . . . . . . . 14 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℂ)
37 ax-1cn 11296 . . . . . . . . . . . . . 14 1 ∈ ℂ
38 subcl 11594 . . . . . . . . . . . . . 14 ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑗 − 1) ∈ ℂ)
3936, 37, 38sylancl 598 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℂ)
40 2cnd 12460 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ∈ ℂ)
41 2ne0 12488 . . . . . . . . . . . . . 14 2 ≠ 0
4241a1i 11 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ≠ 0)
4339, 40, 42divcan2d 12134 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (2 · ((𝑗 − 1) / 2)) = (𝑗 − 1))
4443oveq1d 7465 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((2 · ((𝑗 − 1) / 2)) + 1) = ((𝑗 − 1) + 1))
45 npcan 11604 . . . . . . . . . . . 12 ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑗 − 1) + 1) = 𝑗)
4636, 37, 45sylancl 598 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) + 1) = 𝑗)
4744, 46eqtr2d 2802 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 = ((2 · ((𝑗 − 1) / 2)) + 1))
4843oveq2d 7466 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = (0...(𝑗 − 1)))
49 nnm1nn0 12686 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℕ → (𝑗 − 1) ∈ ℕ0)
5033, 34, 493syl 19 . . . . . . . . . . . . . 14 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℕ0)
51 elnn0uz 13045 . . . . . . . . . . . . . 14 ((𝑗 − 1) ∈ ℕ0 ↔ (𝑗 − 1) ∈ (ℤ≥‘0))
5250, 51sylib 221 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ (ℤ≥‘0))
53 eluzfz1 13703 . . . . . . . . . . . . 13 ((𝑗 − 1) ∈ (ℤ≥‘0) → 0 ∈ (0...(𝑗 − 1)))
54 fzsplit 13723 . . . . . . . . . . . . 13 (0 ∈ (0...(𝑗 − 1)) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
5552, 53, 543syl 19 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
5648, 55eqtrd 2801 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
57 fz0sn 13800 . . . . . . . . . . . . . 14 (0...0) = {0}
5814, 14oveq12i 7462 . . . . . . . . . . . . . . . . 17 (((abs‘0)↑2) + ((abs‘0)↑2)) = (0 + 0)
59 00id 11523 . . . . . . . . . . . . . . . . 17 (0 + 0) = 0
6058, 59eqtri 2789 . . . . . . . . . . . . . . . 16 (((abs‘0)↑2) + ((abs‘0)↑2)) = 0
61244sqlem4a 17175 . . . . . . . . . . . . . . . . 17 ((0 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
6223, 23, 61mp2an 705 . . . . . . . . . . . . . . . 16 (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆
6360, 62eqeltrri 2864 . . . . . . . . . . . . . . 15 0 ∈ 𝑆
64 snssi 4747 . . . . . . . . . . . . . . 15 (0 ∈ 𝑆 → {0} ⊆ 𝑆)
6563, 64ax-mp 5 . . . . . . . . . . . . . 14 {0} ⊆ 𝑆
6657, 65eqsstri 3958 . . . . . . . . . . . . 13 (0...0) ⊆ 𝑆
6766a1i 11 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...0) ⊆ 𝑆)
68 0p1e1 12502 . . . . . . . . . . . . . 14 (0 + 1) = 1
6968oveq1i 7460 . . . . . . . . . . . . 13 ((0 + 1)...(𝑗 − 1)) = (1...(𝑗 − 1))
70 dfss3 3901 . . . . . . . . . . . . . 14 ((1...(𝑗 − 1)) ⊆ 𝑆 ↔ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆)
7170bilanri 512 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (1...(𝑗 − 1)) ⊆ 𝑆)
7269, 71eqsstrid 3950 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0 + 1)...(𝑗 − 1)) ⊆ 𝑆)
7367, 72unssd 4192 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0...0) ∪ ((0 + 1)...(𝑗 − 1))) ⊆ 𝑆)
7456, 73eqsstrd 3946 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) ⊆ 𝑆)
75 oveq1 7457 . . . . . . . . . . . 12 (𝑘 = 𝑖 → (𝑘 · 𝑗) = (𝑖 · 𝑗))
7675eleq1d 2852 . . . . . . . . . . 11 (𝑘 = 𝑖 → ((𝑘 · 𝑗) ∈ 𝑆 ↔ (𝑖 · 𝑗) ∈ 𝑆))
7776cbvrabv 3425 . . . . . . . . . 10 {𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆} = {𝑖 ∈ ℕ ∣ (𝑖 · 𝑗) ∈ 𝑆}
78 eqid 2766 . . . . . . . . . 10 inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < ) = inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < )
7924, 31, 47, 33, 74, 77, 784sqlem18 17186 . . . . . . . . 9 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
8029, 79sylanbr 594 . . . . . . . 8 (((𝑗 ∈ ℙ ∧ 𝑗 ≠ 2) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
8180an32s 665 . . . . . . 7 (((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) ∧ 𝑗 ≠ 2) → 𝑗 ∈ 𝑆)
8210, 10oveq12i 7462 . . . . . . . . . 10 (((abs‘1)↑2) + ((abs‘1)↑2)) = (1 + 1)
83 df-2 12444 . . . . . . . . . 10 2 = (1 + 1)
8482, 83eqtr4i 2792 . . . . . . . . 9 (((abs‘1)↑2) + ((abs‘1)↑2)) = 2
85244sqlem4a 17175 . . . . . . . . . 10 ((1 ∈ ℤ[i] ∧ 1 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆)
8620, 20, 85mp2an 705 . . . . . . . . 9 (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆
8784, 86eqeltrri 2864 . . . . . . . 8 2 ∈ 𝑆
8887a1i 11 . . . . . . 7 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ∈ 𝑆)
8928, 81, 88pm2.61ne 3047 . . . . . 6 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
9024mul4sq 17178 . . . . . . 7 ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆)
9190a1i 11 . . . . . 6 ((𝑚 ∈ (ℤ≥‘2) ∧ 𝑖 ∈ (ℤ≥‘2)) → ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆))
922, 3, 4, 5, 6, 27, 89, 91prmind2 16903 . . . . 5 (𝑘 ∈ ℕ → 𝑘 ∈ 𝑆)
93 id 23 . . . . . 6 (𝑘 = 0 → 𝑘 = 0)
9493, 63eqeltrdi 2875 . . . . 5 (𝑘 = 0 → 𝑘 ∈ 𝑆)
9592, 94jaoi 871 . . . 4 ((𝑘 ∈ ℕ ∨ 𝑘 = 0) → 𝑘 ∈ 𝑆)
961, 95sylbi 220 . . 3 (𝑘 ∈ ℕ0 → 𝑘 ∈ 𝑆)
9796ssriv 3916 . 2 ℕ0 ⊆ 𝑆
98244sqlem1 17172 . 2 𝑆 ⊆ ℕ0
9997, 98eqssi 3928 1 ℕ0 = 𝑆
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1572   ∈ wcel 2150  {cab 2744   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  {crab 3415   ⊆ wss 3899   ∖ cdif 4047   ∪ cun 4151  {csn 4587  ‘cfv 6565  (class class class)co 7450  infcinf 9469  ℂcc 11236  ℝcr 11237  0cc0 11238  1c1 11239   + caddc 11241   · cmul 11243   < clt 11381   − cmin 11579   / cdiv 12012  ℕcn 12374  2c2 12436  ℕ0cn0 12645  ℤcz 12732  ℤ≥cuz 13004  ...cfz 13678  ↑cexp 14243  abscabs 15443  ℙcprime 16889  ℤ[i]cgz 17153
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315  ax-pre-sup 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-sup 9470  df-inf 9471  df-dju 10018  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-div 12013  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-n0 12646  df-xnn0 12719  df-z 12733  df-uz 13005  df-rp 13160  df-fz 13679  df-fl 13971  df-mod 14049  df-seq 14184  df-exp 14244  df-hash 14515  df-cj 15308  df-re 15309  df-im 15310  df-sqrt 15444  df-abs 15445  df-dvds 16465  df-gcd 16707  df-prm 16890  df-gz 17154
This theorem is used by:  4sq  17188
  Copyright terms: Public domain W3C validator