| 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 16752. 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 12519 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| 3 | flt4lem3.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℕ) | |
| 4 | 3 | nnzd 12519 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| 5 | 2, 4 | zaddcld 12605 | . . 3 ⊢ (𝜑 → (𝐶 + 𝐴) ∈ ℤ) |
| 6 | 2, 4 | zsubcld 12606 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℤ) |
| 7 | 5, 6 | gcdcomd 16446 | . 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 42968 | . . . 4 ⊢ (𝜑 → ¬ 2 ∥ 𝐵) |
| 13 | 2nn0 12423 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 14 | 13 | a1i 11 | . . . . 5 ⊢ (𝜑 → 2 ∈ ℕ0) |
| 15 | 3, 8, 1, 10, 11 | fltabcoprm 42963 | . . . . 5 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1) |
| 16 | 3, 8, 1, 14, 11, 15 | fltbccoprm 42962 | . . . 4 ⊢ (𝜑 → (𝐵 gcd 𝐶) = 1) |
| 17 | 8 | nnsqcld 14172 | . . . . . . 7 ⊢ (𝜑 → (𝐵↑2) ∈ ℕ) |
| 18 | 17 | nncnd 12166 | . . . . . 6 ⊢ (𝜑 → (𝐵↑2) ∈ ℂ) |
| 19 | 3 | nnsqcld 14172 | . . . . . . 7 ⊢ (𝜑 → (𝐴↑2) ∈ ℕ) |
| 20 | 19 | nncnd 12166 | . . . . . 6 ⊢ (𝜑 → (𝐴↑2) ∈ ℂ) |
| 21 | 18, 20 | addcomd 11340 | . . . . 5 ⊢ (𝜑 → ((𝐵↑2) + (𝐴↑2)) = ((𝐴↑2) + (𝐵↑2))) |
| 22 | 21, 11 | eqtrd 2772 | . . . 4 ⊢ (𝜑 → ((𝐵↑2) + (𝐴↑2)) = (𝐶↑2)) |
| 23 | 8, 3, 1, 12, 16, 22 | flt4lem1 42967 | . . 3 ⊢ (𝜑 → ((𝐵 ∈ ℕ ∧ 𝐴 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐵↑2) + (𝐴↑2)) = (𝐶↑2) ∧ ((𝐵 gcd 𝐴) = 1 ∧ ¬ 2 ∥ 𝐵))) |
| 24 | pythagtriplem4 16752 | . . 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 5099 (class class class)co 7361 1c1 11032 + caddc 11034 − cmin 11369 ℕcn 12150 2c2 12205 ℕ0cn0 12406 ↑cexp 13989 ∥ cdvds 16184 gcd cgcd 16426 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 ax-pre-sup 11109 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-sup 9350 df-inf 9351 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-div 11800 df-nn 12151 df-2 12213 df-3 12214 df-n0 12407 df-z 12494 df-uz 12757 df-rp 12911 df-fz 13429 df-fl 13717 df-mod 13795 df-seq 13930 df-exp 13990 df-cj 15027 df-re 15028 df-im 15029 df-sqrt 15163 df-abs 15164 df-dvds 16185 df-gcd 16427 df-prm 16604 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |