| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pythagtriplem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for pythagtrip 16889. 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 16876 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) = ((𝐶 − 𝐵) gcd 𝐴)) | |
| 2 | nnz 12607 | . . . . . 6 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℤ) | |
| 3 | nnz 12607 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 4 | zsubcl 12631 | . . . . . 6 ⊢ ((𝐶 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐶 − 𝐵) ∈ ℤ) | |
| 5 | 2, 3, 4 | syl2anr 608 | . . . . 5 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 6 | 5 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 7 | nnz 12607 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 8 | 7 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 9 | nnne0 12265 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
| 10 | 9 | neneqd 2963 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ¬ 𝐴 = 0) |
| 11 | 10 | intnand 493 | . . . . 5 ⊢ (𝐴 ∈ ℕ → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 12 | 11 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 13 | gcdn0cl 16555 | . . . 4 ⊢ ((((𝐶 − 𝐵) ∈ ℤ ∧ 𝐴 ∈ ℤ) ∧ ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) | |
| 14 | 6, 8, 12, 13 | syl21anc 850 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) |
| 15 | 14 | 3ad2ant1 1151 | . 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 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 0cc0 11095 1c1 11096 + caddc 11098 − cmin 11436 ℕcn 12228 2c2 12290 ℤcz 12586 ↑cexp 14093 √csqrt 15280 ∥ cdvds 16305 gcd cgcd 16547 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-inf 9399 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-z 12587 df-uz 12858 df-rp 13012 df-fz 13531 df-fl 13821 df-mod 13899 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-dvds 16306 df-gcd 16548 df-prm 16725 |
| This theorem is referenced by: pythagtriplem11 16880 pythagtriplem13 16882 |
| Copyright terms: Public domain | W3C validator |