| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pythagtriplem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for pythagtrip 16764. 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 16751 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) = ((𝐶 − 𝐵) gcd 𝐴)) | |
| 2 | nnz 12511 | . . . . . 6 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℤ) | |
| 3 | nnz 12511 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 4 | zsubcl 12535 | . . . . . 6 ⊢ ((𝐶 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐶 − 𝐵) ∈ ℤ) | |
| 5 | 2, 3, 4 | syl2anr 597 | . . . . 5 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 6 | 5 | 3adant1 1130 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℤ) |
| 7 | nnz 12511 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 8 | 7 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 9 | nnne0 12181 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
| 10 | 9 | neneqd 2937 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ¬ 𝐴 = 0) |
| 11 | 10 | intnand 488 | . . . . 5 ⊢ (𝐴 ∈ ℕ → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 12 | 11 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) |
| 13 | gcdn0cl 16431 | . . . 4 ⊢ ((((𝐶 − 𝐵) ∈ ℤ ∧ 𝐴 ∈ ℤ) ∧ ¬ ((𝐶 − 𝐵) = 0 ∧ 𝐴 = 0)) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) | |
| 14 | 6, 8, 12, 13 | syl21anc 837 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) |
| 15 | 14 | 3ad2ant1 1133 | . 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 − 𝐵) gcd 𝐴) ∈ ℕ) |
| 16 | 1, 15 | eqeltrd 2836 | 1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 0cc0 11028 1c1 11029 + caddc 11031 − cmin 11366 ℕcn 12147 2c2 12202 ℤcz 12490 ↑cexp 13986 √csqrt 15158 ∥ cdvds 16181 gcd cgcd 16423 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-sup 9347 df-inf 9348 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-fz 13426 df-fl 13714 df-mod 13792 df-seq 13927 df-exp 13987 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-dvds 16182 df-gcd 16424 df-prm 16601 |
| This theorem is referenced by: pythagtriplem11 16755 pythagtriplem13 16757 |
| Copyright terms: Public domain | W3C validator |