| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > flt4lem5d | Structured version Visualization version GIF version | ||
| Description: Part 3 of Equation 2 of https://crypto.stanford.edu/pbc/notes/numberfield/fermatn4.html. (Contributed by SN, 23-Aug-2024.) |
| Ref | Expression |
|---|---|
| flt4lem5a.m | ⊢ 𝑀 = (((√‘(𝐶 + (𝐵↑2))) + (√‘(𝐶 − (𝐵↑2)))) / 2) |
| flt4lem5a.n | ⊢ 𝑁 = (((√‘(𝐶 + (𝐵↑2))) − (√‘(𝐶 − (𝐵↑2)))) / 2) |
| flt4lem5a.r | ⊢ 𝑅 = (((√‘(𝑀 + 𝑁)) + (√‘(𝑀 − 𝑁))) / 2) |
| flt4lem5a.s | ⊢ 𝑆 = (((√‘(𝑀 + 𝑁)) − (√‘(𝑀 − 𝑁))) / 2) |
| flt4lem5a.a | ⊢ (𝜑 → 𝐴 ∈ ℕ) |
| flt4lem5a.b | ⊢ (𝜑 → 𝐵 ∈ ℕ) |
| flt4lem5a.c | ⊢ (𝜑 → 𝐶 ∈ ℕ) |
| flt4lem5a.1 | ⊢ (𝜑 → ¬ 2 ∥ 𝐴) |
| flt4lem5a.2 | ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) |
| flt4lem5a.3 | ⊢ (𝜑 → ((𝐴↑4) + (𝐵↑4)) = (𝐶↑2)) |
| Ref | Expression |
|---|---|
| flt4lem5d | ⊢ (𝜑 → 𝑀 = ((𝑅↑2) + (𝑆↑2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flt4lem5a.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℕ) | |
| 2 | 1 | nnsqcld 14391 | . . . 4 ⊢ (𝜑 → (𝐴↑2) ∈ ℕ) |
| 3 | flt4lem5a.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℕ) | |
| 4 | 3 | nnsqcld 14391 | . . . 4 ⊢ (𝜑 → (𝐵↑2) ∈ ℕ) |
| 5 | flt4lem5a.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℕ) | |
| 6 | flt4lem5a.1 | . . . . 5 ⊢ (𝜑 → ¬ 2 ∥ 𝐴) | |
| 7 | 2prm 16872 | . . . . . 6 ⊢ 2 ∈ ℙ | |
| 8 | 1 | nnzd 12722 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 9 | prmdvdssq 16899 | . . . . . 6 ⊢ ((2 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (2 ∥ 𝐴 ↔ 2 ∥ (𝐴↑2))) | |
| 10 | 7, 8, 9 | sylancr 599 | . . . . 5 ⊢ (𝜑 → (2 ∥ 𝐴 ↔ 2 ∥ (𝐴↑2))) |
| 11 | 6, 10 | mtbid 327 | . . . 4 ⊢ (𝜑 → ¬ 2 ∥ (𝐴↑2)) |
| 12 | flt4lem5a.2 | . . . . 5 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) | |
| 13 | 2nn 12419 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 2 ∈ ℕ) |
| 15 | rppwr 16739 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 2 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑2) gcd (𝐵↑2)) = 1)) | |
| 16 | 1, 3, 14, 15 | syl3anc 1398 | . . . . 5 ⊢ (𝜑 → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑2) gcd (𝐵↑2)) = 1)) |
| 17 | 12, 16 | mpd 16 | . . . 4 ⊢ (𝜑 → ((𝐴↑2) gcd (𝐵↑2)) = 1) |
| 18 | 1 | nncnd 12354 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 19 | 18 | exp4sqsq 14347 | . . . . . 6 ⊢ (𝜑 → (𝐴↑4) = ((𝐴↑2)↑2)) |
| 20 | 3 | nncnd 12354 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 21 | 20 | exp4sqsq 14347 | . . . . . 6 ⊢ (𝜑 → (𝐵↑4) = ((𝐵↑2)↑2)) |
| 22 | 19, 21 | oveq12d 7438 | . . . . 5 ⊢ (𝜑 → ((𝐴↑4) + (𝐵↑4)) = (((𝐴↑2)↑2) + ((𝐵↑2)↑2))) |
| 23 | flt4lem5a.3 | . . . . 5 ⊢ (𝜑 → ((𝐴↑4) + (𝐵↑4)) = (𝐶↑2)) | |
| 24 | 22, 23 | eqtr3d 2797 | . . . 4 ⊢ (𝜑 → (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2)) |
| 25 | 2, 4, 5, 11, 17, 24 | flt4lem1 27981 | . . 3 ⊢ (𝜑 → (((𝐴↑2) ∈ ℕ ∧ (𝐵↑2) ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2) ∧ (((𝐴↑2) gcd (𝐵↑2)) = 1 ∧ ¬ 2 ∥ (𝐴↑2)))) |
| 26 | flt4lem5a.n | . . . 4 ⊢ 𝑁 = (((√‘(𝐶 + (𝐵↑2))) − (√‘(𝐶 − (𝐵↑2)))) / 2) | |
| 27 | 26 | pythagtriplem13 17010 | . . 3 ⊢ ((((𝐴↑2) ∈ ℕ ∧ (𝐵↑2) ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2) ∧ (((𝐴↑2) gcd (𝐵↑2)) = 1 ∧ ¬ 2 ∥ (𝐴↑2))) → 𝑁 ∈ ℕ) |
| 28 | 25, 27 | syl 18 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| 29 | flt4lem5a.m | . . . 4 ⊢ 𝑀 = (((√‘(𝐶 + (𝐵↑2))) + (√‘(𝐶 − (𝐵↑2)))) / 2) | |
| 30 | 29 | pythagtriplem11 17008 | . . 3 ⊢ ((((𝐴↑2) ∈ ℕ ∧ (𝐵↑2) ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2) ∧ (((𝐴↑2) gcd (𝐵↑2)) = 1 ∧ ¬ 2 ∥ (𝐴↑2))) → 𝑀 ∈ ℕ) |
| 31 | 25, 30 | syl 18 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 32 | flt4lem5a.r | . . 3 ⊢ 𝑅 = (((√‘(𝑀 + 𝑁)) + (√‘(𝑀 − 𝑁))) / 2) | |
| 33 | flt4lem5a.s | . . 3 ⊢ 𝑆 = (((√‘(𝑀 + 𝑁)) − (√‘(𝑀 − 𝑁))) / 2) | |
| 34 | 29, 26, 32, 33, 1, 3, 5, 6, 12, 23 | flt4lem5a 27987 | . 2 ⊢ (𝜑 → ((𝐴↑2) + (𝑁↑2)) = (𝑀↑2)) |
| 35 | 28 | nnzd 12722 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 36 | 8, 35 | gcdcomd 16691 | . . 3 ⊢ (𝜑 → (𝐴 gcd 𝑁) = (𝑁 gcd 𝐴)) |
| 37 | 31 | nnzd 12722 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 38 | 35, 37 | gcdcomd 16691 | . . . . 5 ⊢ (𝜑 → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁)) |
| 39 | 29, 26 | flt4lem5 27985 | . . . . . 6 ⊢ ((((𝐴↑2) ∈ ℕ ∧ (𝐵↑2) ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2) ∧ (((𝐴↑2) gcd (𝐵↑2)) = 1 ∧ ¬ 2 ∥ (𝐴↑2))) → (𝑀 gcd 𝑁) = 1) |
| 40 | 25, 39 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 1) |
| 41 | 38, 40 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → (𝑁 gcd 𝑀) = 1) |
| 42 | 28 | nnsqcld 14391 | . . . . . . 7 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ) |
| 43 | 42 | nncnd 12354 | . . . . . 6 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ) |
| 44 | 2 | nncnd 12354 | . . . . . 6 ⊢ (𝜑 → (𝐴↑2) ∈ ℂ) |
| 45 | 43, 44 | addcomd 11515 | . . . . 5 ⊢ (𝜑 → ((𝑁↑2) + (𝐴↑2)) = ((𝐴↑2) + (𝑁↑2))) |
| 46 | 45, 34 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → ((𝑁↑2) + (𝐴↑2)) = (𝑀↑2)) |
| 47 | 28, 1, 31, 41, 46 | fltabcoprm 27979 | . . 3 ⊢ (𝜑 → (𝑁 gcd 𝐴) = 1) |
| 48 | 36, 47 | eqtrd 2795 | . 2 ⊢ (𝜑 → (𝐴 gcd 𝑁) = 1) |
| 49 | 32, 33 | pythagtriplem17 17014 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ) ∧ ((𝐴↑2) + (𝑁↑2)) = (𝑀↑2) ∧ ((𝐴 gcd 𝑁) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑀 = ((𝑅↑2) + (𝑆↑2))) |
| 50 | 1, 28, 31, 34, 48, 6, 49 | syl312anc 1418 | 1 ⊢ (𝜑 → 𝑀 = ((𝑅↑2) + (𝑆↑2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 1c1 11204 + caddc 11206 − cmin 11544 / cdiv 11976 ℕcn 12338 2c2 12400 4c4 12402 ℤcz 12696 ↑cexp 14207 √csqrt 15405 ∥ cdvds 16427 gcd cgcd 16669 ℙcprime 16851 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-2o 8480 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-sup 9437 df-inf 9438 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-n0 12610 df-z 12697 df-uz 12969 df-rp 13124 df-fz 13643 df-fl 13935 df-mod 14013 df-seq 14148 df-exp 14208 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-dvds 16428 df-gcd 16670 df-prm 16852 |
| This theorem is used by: flt4lem5e 27991 flt4lem5f 27992 |
| Copyright terms: Public domain | W3C validator |