| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pythagtriplem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for pythagtrip 16871. Show that (√‘(𝐶 − 𝐵)) is a positive integer. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
| Ref | Expression |
|---|---|
| pythagtriplem8 | ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pythagtriplem6 16858 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) = ((𝐶 − 𝐵) gcd 𝐴)) | |
| 2 | nnz 12590 | . . . . . 6 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℤ) | |
| 3 | nnz 12590 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 4 | zsubcl 12614 | . . . . . 6 ⊢ ((𝐶 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐶 − 𝐵) ∈ ℤ) | |
| 5 | 2, 3, 4 | syl2anr 606 | . . . . 5 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 6 | 5 | 3adant1 1144 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 7 | nnz 12590 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 8 | 7 | 3ad2ant1 1147 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 9 | nnne0 12248 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
| 10 | 9 | neneqd 2963 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ¬ 𝐴 = 0) |
| 11 | 10 | intnand 492 | . . . . 5 ⊢ (𝐴 ∈ ℕ → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 12 | 11 | 3ad2ant1 1147 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 13 | gcdn0cl 16537 | . . . 4 ⊢ ((((𝐶 − 𝐵) ∈ ℤ ∧ 𝐴 ∈ ℤ) ∧ ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) | |
| 14 | 6, 8, 12, 13 | syl21anc 848 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) |
| 15 | 14 | 3ad2ant1 1147 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) |
| 16 | 1, 15 | eqeltrd 2863 | 1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 class class class wbr 5101 ‘cfv 6522 (class class class)co 7397 0cc0 11074 1c1 11075 + caddc 11077 − cmin 11415 ℕcn 12211 2c2 12273 ℤcz 12569 ↑cexp 14075 √csqrt 15261 ∥ cdvds 16287 gcd cgcd 16529 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 ax-pre-sup 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-1o 8438 df-2o 8439 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-sup 9389 df-inf 9390 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-div 11846 df-nn 12212 df-2 12281 df-3 12282 df-n0 12483 df-z 12570 df-uz 12841 df-rp 12995 df-fz 13514 df-fl 13803 df-mod 13881 df-seq 14016 df-exp 14076 df-cj 15127 df-re 15128 df-im 15129 df-sqrt 15263 df-abs 15264 df-dvds 16288 df-gcd 16530 df-prm 16707 |
| This theorem is referenced by: pythagtriplem11 16862 pythagtriplem13 16864 |
| Copyright terms: Public domain | W3C validator |