ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  2sqlem9 GIF version

Theorem 2sqlem9 15281
Description: Lemma for 2sq . (Contributed by Mario Carneiro, 19-Jun-2015.)
Hypotheses
Ref Expression
2sq.1 𝑆 = ran (𝑤 ∈ ℤ[i] ↦ ((abs‘𝑤)↑2))
2sqlem7.2 𝑌 = {𝑧 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2)))}
2sqlem9.5 (𝜑 → ∀𝑏 ∈ (1...(𝑀 − 1))∀𝑎𝑌 (𝑏𝑎𝑏𝑆))
2sqlem9.7 (𝜑𝑀𝑁)
2sqlem9.6 (𝜑𝑀 ∈ ℕ)
2sqlem9.4 (𝜑𝑁𝑌)
Assertion
Ref Expression
2sqlem9 (𝜑𝑀𝑆)
Distinct variable groups:   𝑎,𝑏,𝑤,𝑥,𝑦,𝑧   𝜑,𝑥,𝑦   𝑀,𝑎,𝑏,𝑥,𝑦,𝑧   𝑆,𝑎,𝑏,𝑥,𝑦,𝑧   𝑥,𝑁,𝑦,𝑧   𝑌,𝑎,𝑏,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧,𝑤,𝑎,𝑏)   𝑆(𝑤)   𝑀(𝑤)   𝑁(𝑤,𝑎,𝑏)   𝑌(𝑧,𝑤)

Proof of Theorem 2sqlem9
Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2sqlem9.4 . . 3 (𝜑𝑁𝑌)
2 eqeq1 2200 . . . . . . . 8 (𝑧 = 𝑁 → (𝑧 = ((𝑥↑2) + (𝑦↑2)) ↔ 𝑁 = ((𝑥↑2) + (𝑦↑2))))
32anbi2d 464 . . . . . . 7 (𝑧 = 𝑁 → (((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2))) ↔ ((𝑥 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑥↑2) + (𝑦↑2)))))
432rexbidv 2519 . . . . . 6 (𝑧 = 𝑁 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2))) ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑥↑2) + (𝑦↑2)))))
5 oveq1 5926 . . . . . . . . 9 (𝑥 = 𝑢 → (𝑥 gcd 𝑦) = (𝑢 gcd 𝑦))
65eqeq1d 2202 . . . . . . . 8 (𝑥 = 𝑢 → ((𝑥 gcd 𝑦) = 1 ↔ (𝑢 gcd 𝑦) = 1))
7 oveq1 5926 . . . . . . . . . 10 (𝑥 = 𝑢 → (𝑥↑2) = (𝑢↑2))
87oveq1d 5934 . . . . . . . . 9 (𝑥 = 𝑢 → ((𝑥↑2) + (𝑦↑2)) = ((𝑢↑2) + (𝑦↑2)))
98eqeq2d 2205 . . . . . . . 8 (𝑥 = 𝑢 → (𝑁 = ((𝑥↑2) + (𝑦↑2)) ↔ 𝑁 = ((𝑢↑2) + (𝑦↑2))))
106, 9anbi12d 473 . . . . . . 7 (𝑥 = 𝑢 → (((𝑥 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑥↑2) + (𝑦↑2))) ↔ ((𝑢 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑦↑2)))))
11 oveq2 5927 . . . . . . . . 9 (𝑦 = 𝑣 → (𝑢 gcd 𝑦) = (𝑢 gcd 𝑣))
1211eqeq1d 2202 . . . . . . . 8 (𝑦 = 𝑣 → ((𝑢 gcd 𝑦) = 1 ↔ (𝑢 gcd 𝑣) = 1))
13 oveq1 5926 . . . . . . . . . 10 (𝑦 = 𝑣 → (𝑦↑2) = (𝑣↑2))
1413oveq2d 5935 . . . . . . . . 9 (𝑦 = 𝑣 → ((𝑢↑2) + (𝑦↑2)) = ((𝑢↑2) + (𝑣↑2)))
1514eqeq2d 2205 . . . . . . . 8 (𝑦 = 𝑣 → (𝑁 = ((𝑢↑2) + (𝑦↑2)) ↔ 𝑁 = ((𝑢↑2) + (𝑣↑2))))
1612, 15anbi12d 473 . . . . . . 7 (𝑦 = 𝑣 → (((𝑢 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑦↑2))) ↔ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))))
1710, 16cbvrex2vw 2738 . . . . . 6 (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑁 = ((𝑥↑2) + (𝑦↑2))) ↔ ∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))))
184, 17bitrdi 196 . . . . 5 (𝑧 = 𝑁 → (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2))) ↔ ∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))))
19 2sqlem7.2 . . . . 5 𝑌 = {𝑧 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2)))}
2018, 19elab2g 2908 . . . 4 (𝑁𝑌 → (𝑁𝑌 ↔ ∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))))
2120ibi 176 . . 3 (𝑁𝑌 → ∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))))
221, 21syl 14 . 2 (𝜑 → ∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))))
23 simpr 110 . . . . . 6 ((((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) ∧ 𝑀 = 1) → 𝑀 = 1)
24 1z 9346 . . . . . . . . 9 1 ∈ ℤ
25 zgz 12514 . . . . . . . . 9 (1 ∈ ℤ → 1 ∈ ℤ[i])
2624, 25ax-mp 5 . . . . . . . 8 1 ∈ ℤ[i]
27 sq1 10707 . . . . . . . . 9 (1↑2) = 1
2827eqcomi 2197 . . . . . . . 8 1 = (1↑2)
29 fveq2 5555 . . . . . . . . . . 11 (𝑥 = 1 → (abs‘𝑥) = (abs‘1))
30 abs1 11219 . . . . . . . . . . 11 (abs‘1) = 1
3129, 30eqtrdi 2242 . . . . . . . . . 10 (𝑥 = 1 → (abs‘𝑥) = 1)
3231oveq1d 5934 . . . . . . . . 9 (𝑥 = 1 → ((abs‘𝑥)↑2) = (1↑2))
3332rspceeqv 2883 . . . . . . . 8 ((1 ∈ ℤ[i] ∧ 1 = (1↑2)) → ∃𝑥 ∈ ℤ[i] 1 = ((abs‘𝑥)↑2))
3426, 28, 33mp2an 426 . . . . . . 7 𝑥 ∈ ℤ[i] 1 = ((abs‘𝑥)↑2)
35 2sq.1 . . . . . . . 8 𝑆 = ran (𝑤 ∈ ℤ[i] ↦ ((abs‘𝑤)↑2))
36352sqlem1 15271 . . . . . . 7 (1 ∈ 𝑆 ↔ ∃𝑥 ∈ ℤ[i] 1 = ((abs‘𝑥)↑2))
3734, 36mpbir 146 . . . . . 6 1 ∈ 𝑆
3823, 37eqeltrdi 2284 . . . . 5 ((((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) ∧ 𝑀 = 1) → 𝑀𝑆)
39 2sqlem9.5 . . . . . . . 8 (𝜑 → ∀𝑏 ∈ (1...(𝑀 − 1))∀𝑎𝑌 (𝑏𝑎𝑏𝑆))
4039ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → ∀𝑏 ∈ (1...(𝑀 − 1))∀𝑎𝑌 (𝑏𝑎𝑏𝑆))
41 2sqlem9.7 . . . . . . . 8 (𝜑𝑀𝑁)
4241ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑀𝑁)
4335, 192sqlem7 15278 . . . . . . . . . 10 𝑌 ⊆ (𝑆 ∩ ℕ)
44 inss2 3381 . . . . . . . . . 10 (𝑆 ∩ ℕ) ⊆ ℕ
4543, 44sstri 3189 . . . . . . . . 9 𝑌 ⊆ ℕ
4645, 1sselid 3178 . . . . . . . 8 (𝜑𝑁 ∈ ℕ)
4746ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑁 ∈ ℕ)
48 2sqlem9.6 . . . . . . . . 9 (𝜑𝑀 ∈ ℕ)
4948ad2antrr 488 . . . . . . . 8 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑀 ∈ ℕ)
50 simprr 531 . . . . . . . 8 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑀 ≠ 1)
51 eluz2b3 9672 . . . . . . . 8 (𝑀 ∈ (ℤ‘2) ↔ (𝑀 ∈ ℕ ∧ 𝑀 ≠ 1))
5249, 50, 51sylanbrc 417 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑀 ∈ (ℤ‘2))
53 simplrl 535 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑢 ∈ ℤ)
54 simplrr 536 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑣 ∈ ℤ)
55 simprll 537 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → (𝑢 gcd 𝑣) = 1)
56 simprlr 538 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑁 = ((𝑢↑2) + (𝑣↑2)))
57 eqid 2193 . . . . . . 7 (((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
58 eqid 2193 . . . . . . 7 (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
59 eqid 2193 . . . . . . 7 ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) / ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) gcd (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)))) = ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) / ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) gcd (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))))
60 eqid 2193 . . . . . . 7 ((((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) / ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) gcd (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)))) = ((((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) / ((((𝑢 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) gcd (((𝑣 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))))
6135, 19, 40, 42, 47, 52, 53, 54, 55, 56, 57, 58, 59, 602sqlem8 15280 . . . . . 6 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) ∧ 𝑀 ≠ 1)) → 𝑀𝑆)
6261anassrs 400 . . . . 5 ((((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) ∧ 𝑀 ≠ 1) → 𝑀𝑆)
6348nnzd 9441 . . . . . . . 8 (𝜑𝑀 ∈ ℤ)
6463ad2antrr 488 . . . . . . 7 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) → 𝑀 ∈ ℤ)
65 zdceq 9395 . . . . . . 7 ((𝑀 ∈ ℤ ∧ 1 ∈ ℤ) → DECID 𝑀 = 1)
6664, 24, 65sylancl 413 . . . . . 6 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) → DECID 𝑀 = 1)
67 dcne 2375 . . . . . 6 (DECID 𝑀 = 1 ↔ (𝑀 = 1 ∨ 𝑀 ≠ 1))
6866, 67sylib 122 . . . . 5 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) → (𝑀 = 1 ∨ 𝑀 ≠ 1))
6938, 62, 68mpjaodan 799 . . . 4 (((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) ∧ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2)))) → 𝑀𝑆)
7069ex 115 . . 3 ((𝜑 ∧ (𝑢 ∈ ℤ ∧ 𝑣 ∈ ℤ)) → (((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) → 𝑀𝑆))
7170rexlimdvva 2619 . 2 (𝜑 → (∃𝑢 ∈ ℤ ∃𝑣 ∈ ℤ ((𝑢 gcd 𝑣) = 1 ∧ 𝑁 = ((𝑢↑2) + (𝑣↑2))) → 𝑀𝑆))
7222, 71mpd 13 1 (𝜑𝑀𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 709  DECID wdc 835   = wceq 1364  wcel 2164  {cab 2179  wne 2364  wral 2472  wrex 2473  cin 3153   class class class wbr 4030  cmpt 4091  ran crn 4661  cfv 5255  (class class class)co 5919  1c1 7875   + caddc 7877  cmin 8192   / cdiv 8693  cn 8984  2c2 9035  cz 9320  cuz 9595  ...cfz 10077   mod cmo 10396  cexp 10612  abscabs 11144  cdvds 11933   gcd cgcd 12082  ℤ[i]cgz 12510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-mulrcl 7973  ax-addcom 7974  ax-mulcom 7975  ax-addass 7976  ax-mulass 7977  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-1rid 7981  ax-0id 7982  ax-rnegex 7983  ax-precex 7984  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-apti 7989  ax-pre-ltadd 7990  ax-pre-mulgt0 7991  ax-pre-mulext 7992  ax-arch 7993  ax-caucvg 7994
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-po 4328  df-iso 4329  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-frec 6446  df-1o 6471  df-2o 6472  df-er 6589  df-en 6797  df-sup 7045  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-reap 8596  df-ap 8603  df-div 8694  df-inn 8985  df-2 9043  df-3 9044  df-4 9045  df-n0 9244  df-z 9321  df-uz 9596  df-q 9688  df-rp 9723  df-fz 10078  df-fzo 10212  df-fl 10342  df-mod 10397  df-seqfrec 10522  df-exp 10613  df-cj 10989  df-re 10990  df-im 10991  df-rsqrt 11145  df-abs 11146  df-dvds 11934  df-gcd 12083  df-prm 12249  df-gz 12511
This theorem is referenced by:  2sqlem10  15282
  Copyright terms: Public domain W3C validator