![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 2sqlem8a | GIF version |
Description: Lemma for 2sqlem8 14126. (Contributed by Mario Carneiro, 4-Jun-2016.) |
Ref | Expression |
---|---|
2sq.1 | ⊢ 𝑆 = ran (𝑤 ∈ ℤ[i] ↦ ((abs‘𝑤)↑2)) |
2sqlem7.2 | ⊢ 𝑌 = {𝑧 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ((𝑥 gcd 𝑦) = 1 ∧ 𝑧 = ((𝑥↑2) + (𝑦↑2)))} |
2sqlem9.5 | ⊢ (𝜑 → ∀𝑏 ∈ (1...(𝑀 − 1))∀𝑎 ∈ 𝑌 (𝑏 ∥ 𝑎 → 𝑏 ∈ 𝑆)) |
2sqlem9.7 | ⊢ (𝜑 → 𝑀 ∥ 𝑁) |
2sqlem8.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
2sqlem8.m | ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘2)) |
2sqlem8.1 | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
2sqlem8.2 | ⊢ (𝜑 → 𝐵 ∈ ℤ) |
2sqlem8.3 | ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) |
2sqlem8.4 | ⊢ (𝜑 → 𝑁 = ((𝐴↑2) + (𝐵↑2))) |
2sqlem8.c | ⊢ 𝐶 = (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) |
2sqlem8.d | ⊢ 𝐷 = (((𝐵 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) |
Ref | Expression |
---|---|
2sqlem8a | ⊢ (𝜑 → (𝐶 gcd 𝐷) ∈ ℕ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2sqlem8.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
2 | 2sqlem8.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘2)) | |
3 | eluz2b3 9593 | . . . . . 6 ⊢ (𝑀 ∈ (ℤ≥‘2) ↔ (𝑀 ∈ ℕ ∧ 𝑀 ≠ 1)) | |
4 | 2, 3 | sylib 122 | . . . . 5 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑀 ≠ 1)) |
5 | 4 | simpld 112 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
6 | 2sqlem8.c | . . . 4 ⊢ 𝐶 = (((𝐴 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) | |
7 | 1, 5, 6 | 4sqlem5 12363 | . . 3 ⊢ (𝜑 → (𝐶 ∈ ℤ ∧ ((𝐴 − 𝐶) / 𝑀) ∈ ℤ)) |
8 | 7 | simpld 112 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℤ) |
9 | 2sqlem8.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℤ) | |
10 | 2sqlem8.d | . . . 4 ⊢ 𝐷 = (((𝐵 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) | |
11 | 9, 5, 10 | 4sqlem5 12363 | . . 3 ⊢ (𝜑 → (𝐷 ∈ ℤ ∧ ((𝐵 − 𝐷) / 𝑀) ∈ ℤ)) |
12 | 11 | simpld 112 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℤ) |
13 | 4 | simprd 114 | . . . 4 ⊢ (𝜑 → 𝑀 ≠ 1) |
14 | simpr 110 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐶↑2) = 0) → (𝐶↑2) = 0) | |
15 | 1, 5, 6, 14 | 4sqlem9 12367 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐶↑2) = 0) → (𝑀↑2) ∥ (𝐴↑2)) |
16 | 15 | ex 115 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶↑2) = 0 → (𝑀↑2) ∥ (𝐴↑2))) |
17 | eluzelz 9526 | . . . . . . . . . 10 ⊢ (𝑀 ∈ (ℤ≥‘2) → 𝑀 ∈ ℤ) | |
18 | 2, 17 | syl 14 | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
19 | dvdssq 12015 | . . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝑀 ∥ 𝐴 ↔ (𝑀↑2) ∥ (𝐴↑2))) | |
20 | 18, 1, 19 | syl2anc 411 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 ∥ 𝐴 ↔ (𝑀↑2) ∥ (𝐴↑2))) |
21 | 16, 20 | sylibrd 169 | . . . . . . 7 ⊢ (𝜑 → ((𝐶↑2) = 0 → 𝑀 ∥ 𝐴)) |
22 | simpr 110 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐷↑2) = 0) → (𝐷↑2) = 0) | |
23 | 9, 5, 10, 22 | 4sqlem9 12367 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐷↑2) = 0) → (𝑀↑2) ∥ (𝐵↑2)) |
24 | 23 | ex 115 | . . . . . . . 8 ⊢ (𝜑 → ((𝐷↑2) = 0 → (𝑀↑2) ∥ (𝐵↑2))) |
25 | dvdssq 12015 | . . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝑀 ∥ 𝐵 ↔ (𝑀↑2) ∥ (𝐵↑2))) | |
26 | 18, 9, 25 | syl2anc 411 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 ∥ 𝐵 ↔ (𝑀↑2) ∥ (𝐵↑2))) |
27 | 24, 26 | sylibrd 169 | . . . . . . 7 ⊢ (𝜑 → ((𝐷↑2) = 0 → 𝑀 ∥ 𝐵)) |
28 | 2sqlem8.3 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) | |
29 | 1ne0 8976 | . . . . . . . . . . . 12 ⊢ 1 ≠ 0 | |
30 | 29 | a1i 9 | . . . . . . . . . . 11 ⊢ (𝜑 → 1 ≠ 0) |
31 | 28, 30 | eqnetrd 2371 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐴 gcd 𝐵) ≠ 0) |
32 | 31 | neneqd 2368 | . . . . . . . . 9 ⊢ (𝜑 → ¬ (𝐴 gcd 𝐵) = 0) |
33 | gcdeq0 11961 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) | |
34 | 1, 9, 33 | syl2anc 411 | . . . . . . . . 9 ⊢ (𝜑 → ((𝐴 gcd 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
35 | 32, 34 | mtbid 672 | . . . . . . . 8 ⊢ (𝜑 → ¬ (𝐴 = 0 ∧ 𝐵 = 0)) |
36 | dvdslegcd 11948 | . . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → ((𝑀 ∥ 𝐴 ∧ 𝑀 ∥ 𝐵) → 𝑀 ≤ (𝐴 gcd 𝐵))) | |
37 | 18, 1, 9, 35, 36 | syl31anc 1241 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 ∥ 𝐴 ∧ 𝑀 ∥ 𝐵) → 𝑀 ≤ (𝐴 gcd 𝐵))) |
38 | 21, 27, 37 | syl2and 295 | . . . . . 6 ⊢ (𝜑 → (((𝐶↑2) = 0 ∧ (𝐷↑2) = 0) → 𝑀 ≤ (𝐴 gcd 𝐵))) |
39 | 28 | breq2d 4012 | . . . . . . 7 ⊢ (𝜑 → (𝑀 ≤ (𝐴 gcd 𝐵) ↔ 𝑀 ≤ 1)) |
40 | nnle1eq1 8932 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (𝑀 ≤ 1 ↔ 𝑀 = 1)) | |
41 | 5, 40 | syl 14 | . . . . . . 7 ⊢ (𝜑 → (𝑀 ≤ 1 ↔ 𝑀 = 1)) |
42 | 39, 41 | bitrd 188 | . . . . . 6 ⊢ (𝜑 → (𝑀 ≤ (𝐴 gcd 𝐵) ↔ 𝑀 = 1)) |
43 | 38, 42 | sylibd 149 | . . . . 5 ⊢ (𝜑 → (((𝐶↑2) = 0 ∧ (𝐷↑2) = 0) → 𝑀 = 1)) |
44 | 43 | necon3ad 2389 | . . . 4 ⊢ (𝜑 → (𝑀 ≠ 1 → ¬ ((𝐶↑2) = 0 ∧ (𝐷↑2) = 0))) |
45 | 13, 44 | mpd 13 | . . 3 ⊢ (𝜑 → ¬ ((𝐶↑2) = 0 ∧ (𝐷↑2) = 0)) |
46 | 8 | zcnd 9365 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
47 | sqeq0 10569 | . . . . 5 ⊢ (𝐶 ∈ ℂ → ((𝐶↑2) = 0 ↔ 𝐶 = 0)) | |
48 | 46, 47 | syl 14 | . . . 4 ⊢ (𝜑 → ((𝐶↑2) = 0 ↔ 𝐶 = 0)) |
49 | 12 | zcnd 9365 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℂ) |
50 | sqeq0 10569 | . . . . 5 ⊢ (𝐷 ∈ ℂ → ((𝐷↑2) = 0 ↔ 𝐷 = 0)) | |
51 | 49, 50 | syl 14 | . . . 4 ⊢ (𝜑 → ((𝐷↑2) = 0 ↔ 𝐷 = 0)) |
52 | 48, 51 | anbi12d 473 | . . 3 ⊢ (𝜑 → (((𝐶↑2) = 0 ∧ (𝐷↑2) = 0) ↔ (𝐶 = 0 ∧ 𝐷 = 0))) |
53 | 45, 52 | mtbid 672 | . 2 ⊢ (𝜑 → ¬ (𝐶 = 0 ∧ 𝐷 = 0)) |
54 | gcdn0cl 11946 | . 2 ⊢ (((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) ∧ ¬ (𝐶 = 0 ∧ 𝐷 = 0)) → (𝐶 gcd 𝐷) ∈ ℕ) | |
55 | 8, 12, 53, 54 | syl21anc 1237 | 1 ⊢ (𝜑 → (𝐶 gcd 𝐷) ∈ ℕ) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 {cab 2163 ≠ wne 2347 ∀wral 2455 ∃wrex 2456 class class class wbr 4000 ↦ cmpt 4061 ran crn 4624 ‘cfv 5212 (class class class)co 5869 ℂcc 7800 0cc0 7802 1c1 7803 + caddc 7805 ≤ cle 7983 − cmin 8118 / cdiv 8618 ℕcn 8908 2c2 8959 ℤcz 9242 ℤ≥cuz 9517 ...cfz 9995 mod cmo 10308 ↑cexp 10505 abscabs 10990 ∥ cdvds 11778 gcd cgcd 11926 ℤ[i]cgz 12350 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4115 ax-sep 4118 ax-nul 4126 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-iinf 4584 ax-cnex 7893 ax-resscn 7894 ax-1cn 7895 ax-1re 7896 ax-icn 7897 ax-addcl 7898 ax-addrcl 7899 ax-mulcl 7900 ax-mulrcl 7901 ax-addcom 7902 ax-mulcom 7903 ax-addass 7904 ax-mulass 7905 ax-distr 7906 ax-i2m1 7907 ax-0lt1 7908 ax-1rid 7909 ax-0id 7910 ax-rnegex 7911 ax-precex 7912 ax-cnre 7913 ax-pre-ltirr 7914 ax-pre-ltwlin 7915 ax-pre-lttrn 7916 ax-pre-apti 7917 ax-pre-ltadd 7918 ax-pre-mulgt0 7919 ax-pre-mulext 7920 ax-arch 7921 ax-caucvg 7922 |
This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-int 3843 df-iun 3886 df-br 4001 df-opab 4062 df-mpt 4063 df-tr 4099 df-id 4290 df-po 4293 df-iso 4294 df-iord 4363 df-on 4365 df-ilim 4366 df-suc 4368 df-iom 4587 df-xp 4629 df-rel 4630 df-cnv 4631 df-co 4632 df-dm 4633 df-rn 4634 df-res 4635 df-ima 4636 df-iota 5174 df-fun 5214 df-fn 5215 df-f 5216 df-f1 5217 df-fo 5218 df-f1o 5219 df-fv 5220 df-riota 5825 df-ov 5872 df-oprab 5873 df-mpo 5874 df-1st 6135 df-2nd 6136 df-recs 6300 df-frec 6386 df-sup 6977 df-pnf 7984 df-mnf 7985 df-xr 7986 df-ltxr 7987 df-le 7988 df-sub 8120 df-neg 8121 df-reap 8522 df-ap 8529 df-div 8619 df-inn 8909 df-2 8967 df-3 8968 df-4 8969 df-n0 9166 df-z 9243 df-uz 9518 df-q 9609 df-rp 9641 df-fz 9996 df-fzo 10129 df-fl 10256 df-mod 10309 df-seqfrec 10432 df-exp 10506 df-cj 10835 df-re 10836 df-im 10837 df-rsqrt 10991 df-abs 10992 df-dvds 11779 df-gcd 11927 |
This theorem is referenced by: 2sqlem8 14126 |
Copyright terms: Public domain | W3C validator |