| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > flt4lem3 | Structured version Visualization version GIF version | ||
| Description: Equivalent to pythagtriplem4 16790. Show that 𝐶 + 𝐴 and 𝐶 − 𝐴 are coprime. (Contributed by SN, 22-Aug-2024.) |
| Ref | Expression |
|---|---|
| flt4lem3.a | ⊢ (𝜑 → 𝐴 ∈ ℕ) |
| flt4lem3.b | ⊢ (𝜑 → 𝐵 ∈ ℕ) |
| flt4lem3.c | ⊢ (𝜑 → 𝐶 ∈ ℕ) |
| flt4lem3.1 | ⊢ (𝜑 → 2 ∥ 𝐴) |
| flt4lem3.2 | ⊢ (𝜑 → (𝐴 gcd 𝐶) = 1) |
| flt4lem3.3 | ⊢ (𝜑 → ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2)) |
| Ref | Expression |
|---|---|
| flt4lem3 | ⊢ (𝜑 → ((𝐶 + 𝐴) gcd (𝐶 − 𝐴)) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flt4lem3.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℕ) | |
| 2 | 1 | nnzd 12550 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| 3 | flt4lem3.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℕ) | |
| 4 | 3 | nnzd 12550 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 5 | 2, 4 | zaddcld 12637 | . . 3 ⊢ (𝜑 → (𝐶 + 𝐴) ∈ ℤ) |
| 6 | 2, 4 | zsubcld 12638 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℤ) |
| 7 | 5, 6 | gcdcomd 16483 | . 2 ⊢ (𝜑 → ((𝐶 + 𝐴) gcd (𝐶 − 𝐴)) = ((𝐶 − 𝐴) gcd (𝐶 + 𝐴))) |
| 8 | flt4lem3.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℕ) | |
| 9 | flt4lem3.1 | . . . . 5 ⊢ (𝜑 → 2 ∥ 𝐴) | |
| 10 | flt4lem3.2 | . . . . 5 ⊢ (𝜑 → (𝐴 gcd 𝐶) = 1) | |
| 11 | flt4lem3.3 | . . . . 5 ⊢ (𝜑 → ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2)) | |
| 12 | 3, 8, 1, 9, 10, 11 | flt4lem2 43080 | . . . 4 ⊢ (𝜑 → ¬ 2 ∥ 𝐵) |
| 13 | 2nn0 12454 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ (𝜑 → 2 ∈ ℕ0) |
| 15 | 3, 8, 1, 10, 11 | fltabcoprm 43075 | . . . . 5 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) |
| 16 | 3, 8, 1, 14, 11, 15 | fltbccoprm 43074 | . . . 4 ⊢ (𝜑 → (𝐵 gcd 𝐶) = 1) |
| 17 | 8 | nnsqcld 14206 | . . . . . . 7 ⊢ (𝜑 → (𝐵↑2) ∈ ℕ) |
| 18 | 17 | nncnd 12190 | . . . . . 6 ⊢ (𝜑 → (𝐵↑2) ∈ ℂ) |
| 19 | 3 | nnsqcld 14206 | . . . . . . 7 ⊢ (𝜑 → (𝐴↑2) ∈ ℕ) |
| 20 | 19 | nncnd 12190 | . . . . . 6 ⊢ (𝜑 → (𝐴↑2) ∈ ℂ) |
| 21 | 18, 20 | addcomd 11348 | . . . . 5 ⊢ (𝜑 → ((𝐵↑2) + (𝐴↑2)) = ((𝐴↑2) + (𝐵↑2))) |
| 22 | 21, 11 | eqtrd 2772 | . . . 4 ⊢ (𝜑 → ((𝐵↑2) + (𝐴↑2)) = (𝐶↑2)) |
| 23 | 8, 3, 1, 12, 16, 22 | flt4lem1 43079 | . . 3 ⊢ (𝜑 → ((𝐵 ∈ ℕ ∧ 𝐴 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐵↑2) + (𝐴↑2)) = (𝐶↑2) ∧ ((𝐵 gcd 𝐴) = 1 ∧ ¬ 2 ∥ 𝐵))) |
| 24 | pythagtriplem4 16790 | . . 3 ⊢ (((𝐵 ∈ ℕ ∧ 𝐴 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐵↑2) + (𝐴↑2)) = (𝐶↑2) ∧ ((𝐵 gcd 𝐴) = 1 ∧ ¬ 2 ∥ 𝐵)) → ((𝐶 − 𝐴) gcd (𝐶 + 𝐴)) = 1) | |
| 25 | 23, 24 | syl 17 | . 2 ⊢ (𝜑 → ((𝐶 − 𝐴) gcd (𝐶 + 𝐴)) = 1) |
| 26 | 7, 25 | eqtrd 2772 | 1 ⊢ (𝜑 → ((𝐶 + 𝐴) gcd (𝐶 − 𝐴)) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 (class class class)co 7367 1c1 11039 + caddc 11041 − cmin 11377 ℕcn 12174 2c2 12236 ℕ0cn0 12437 ↑cexp 14023 ∥ cdvds 16221 gcd cgcd 16463 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 df-prm 16641 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |