| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > flt4lem5c | Structured version Visualization version GIF version | ||
| Description: Part 2 of Equation 2 of https://crypto.stanford.edu/pbc/notes/numberfield/fermatn4.html. (Contributed by SN, 22-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 |
|---|---|
| flt4lem5c | ⊢ (𝜑 → 𝑁 = (2 · (𝑅 · 𝑆))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flt4lem5a.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℕ) | |
| 2 | 1 | nnsqcld 14415 | . . . 4 ⊢ (𝜑 → (𝐴↑2) ∈ ℕ) |
| 3 | flt4lem5a.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℕ) | |
| 4 | 3 | nnsqcld 14415 | . . . 4 ⊢ (𝜑 → (𝐵↑2) ∈ ℕ) |
| 5 | flt4lem5a.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℕ) | |
| 6 | flt4lem5a.1 | . . . . 5 ⊢ (𝜑 → ¬ 2 ∥ 𝐴) | |
| 7 | 2prm 16896 | . . . . . 6 ⊢ 2 ∈ ℙ | |
| 8 | 1 | nnzd 12746 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 9 | prmdvdssq 16923 | . . . . . 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 12443 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 2 ∈ ℕ) |
| 15 | rppwr 16763 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 2 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑2) gcd (𝐵↑2)) = 1)) | |
| 16 | 1, 3, 14, 15 | syl3anc 1399 | . . . . 5 ⊢ (𝜑 → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑2) gcd (𝐵↑2)) = 1)) |
| 17 | 12, 16 | mpd 16 | . . . 4 ⊢ (𝜑 → ((𝐴↑2) gcd (𝐵↑2)) = 1) |
| 18 | 1 | nncnd 12378 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 19 | 18 | exp4sqsq 14371 | . . . . . 6 ⊢ (𝜑 → (𝐴↑4) = ((𝐴↑2)↑2)) |
| 20 | 3 | nncnd 12378 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 21 | 20 | exp4sqsq 14371 | . . . . . 6 ⊢ (𝜑 → (𝐵↑4) = ((𝐵↑2)↑2)) |
| 22 | 19, 21 | oveq12d 7461 | . . . . 5 ⊢ (𝜑 → ((𝐴↑4) + (𝐵↑4)) = (((𝐴↑2)↑2) + ((𝐵↑2)↑2))) |
| 23 | flt4lem5a.3 | . . . . 5 ⊢ (𝜑 → ((𝐴↑4) + (𝐵↑4)) = (𝐶↑2)) | |
| 24 | 22, 23 | eqtr3d 2800 | . . . 4 ⊢ (𝜑 → (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2)) |
| 25 | 2, 4, 5, 11, 17, 24 | flt4lem1 28006 | . . 3 ⊢ (𝜑 → (((𝐴↑2) ∈ ℕ ∧ (𝐵↑2) ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ (((𝐴↑2)↑2) + ((𝐵↑2)↑2)) = (𝐶↑2) ∧ (((𝐴↑2) gcd (𝐵↑2)) = 1 ∧ ¬ 2 ∥ (𝐴↑2)))) |
| 26 | flt4lem5a.n | . . . 4 ⊢ 𝑁 = (((√‘(𝐶 + (𝐵↑2))) − (√‘(𝐶 − (𝐵↑2)))) / 2) | |
| 27 | 26 | pythagtriplem13 17034 | . . 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 17032 | . . 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 28012 | . 2 ⊢ (𝜑 → ((𝐴↑2) + (𝑁↑2)) = (𝑀↑2)) |
| 35 | 28 | nnzd 12746 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 36 | 8, 35 | gcdcomd 16715 | . . 3 ⊢ (𝜑 → (𝐴 gcd 𝑁) = (𝑁 gcd 𝐴)) |
| 37 | 31 | nnzd 12746 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 38 | 35, 37 | gcdcomd 16715 | . . . . 5 ⊢ (𝜑 → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁)) |
| 39 | 29, 26 | flt4lem5 28010 | . . . . . 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 2798 | . . . 4 ⊢ (𝜑 → (𝑁 gcd 𝑀) = 1) |
| 42 | 28 | nnsqcld 14415 | . . . . . . 7 ⊢ (𝜑 → (𝑁↑2) ∈ ℕ) |
| 43 | 42 | nncnd 12378 | . . . . . 6 ⊢ (𝜑 → (𝑁↑2) ∈ ℂ) |
| 44 | 2 | nncnd 12378 | . . . . . 6 ⊢ (𝜑 → (𝐴↑2) ∈ ℂ) |
| 45 | 43, 44 | addcomd 11539 | . . . . 5 ⊢ (𝜑 → ((𝑁↑2) + (𝐴↑2)) = ((𝐴↑2) + (𝑁↑2))) |
| 46 | 45, 34 | eqtrd 2798 | . . . 4 ⊢ (𝜑 → ((𝑁↑2) + (𝐴↑2)) = (𝑀↑2)) |
| 47 | 28, 1, 31, 41, 46 | fltabcoprm 28004 | . . 3 ⊢ (𝜑 → (𝑁 gcd 𝐴) = 1) |
| 48 | 36, 47 | eqtrd 2798 | . 2 ⊢ (𝜑 → (𝐴 gcd 𝑁) = 1) |
| 49 | 32, 33 | pythagtriplem16 17037 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ) ∧ ((𝐴↑2) + (𝑁↑2)) = (𝑀↑2) ∧ ((𝐴 gcd 𝑁) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑁 = (2 · (𝑅 · 𝑆))) |
| 50 | 1, 28, 31, 34, 48, 6, 49 | syl312anc 1419 | 1 ⊢ (𝜑 → 𝑁 = (2 · (𝑅 · 𝑆))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 ‘cfv 6558 (class class class)co 7443 1c1 11228 + caddc 11230 · cmul 11232 − cmin 11568 / cdiv 12000 ℕcn 12362 2c2 12424 4c4 12426 ℤcz 12720 ↑cexp 14231 √csqrt 15429 ∥ cdvds 16451 gcd cgcd 16693 ℙcprime 16875 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-sup 9461 df-inf 9462 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-n0 12634 df-z 12721 df-uz 12993 df-rp 13148 df-fz 13667 df-fl 13959 df-mod 14037 df-seq 14172 df-exp 14232 df-cj 15295 df-re 15296 df-im 15297 df-sqrt 15431 df-abs 15432 df-dvds 16452 df-gcd 16694 df-prm 16876 |
| This theorem is used by: flt4lem5e 28016 |
| Copyright terms: Public domain | W3C validator |