Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dvdssqlem | GIF version |
Description: Lemma for dvdssq 11646. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Ref | Expression |
---|---|
dvdssqlem | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 ↔ (𝑀↑2) ∥ (𝑁↑2))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnz 9041 | . . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
2 | nnz 9041 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
3 | dvdssqim 11639 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) | |
4 | 1, 2, 3 | syl2an 287 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
5 | sqgcd 11644 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀 gcd 𝑁)↑2) = ((𝑀↑2) gcd (𝑁↑2))) | |
6 | 5 | adantr 274 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁)↑2) = ((𝑀↑2) gcd (𝑁↑2))) |
7 | nnsqcl 10330 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (𝑀↑2) ∈ ℕ) | |
8 | nnsqcl 10330 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁↑2) ∈ ℕ) | |
9 | gcdeq 11638 | . . . . . . . 8 ⊢ (((𝑀↑2) ∈ ℕ ∧ (𝑁↑2) ∈ ℕ) → (((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2) ↔ (𝑀↑2) ∥ (𝑁↑2))) | |
10 | 7, 8, 9 | syl2an 287 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2) ↔ (𝑀↑2) ∥ (𝑁↑2))) |
11 | 10 | biimpar 295 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2)) |
12 | 6, 11 | eqtrd 2150 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁)↑2) = (𝑀↑2)) |
13 | gcdcl 11582 | . . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) ∈ ℕ0) | |
14 | 1, 2, 13 | syl2an 287 | . . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 gcd 𝑁) ∈ ℕ0) |
15 | 14 | nn0red 8999 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 gcd 𝑁) ∈ ℝ) |
16 | 14 | nn0ge0d 9001 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ≤ (𝑀 gcd 𝑁)) |
17 | nnre 8695 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ) | |
18 | 17 | adantr 274 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑀 ∈ ℝ) |
19 | nnnn0 8952 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ0) | |
20 | 19 | nn0ge0d 9001 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → 0 ≤ 𝑀) |
21 | 20 | adantr 274 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ≤ 𝑀) |
22 | sq11 10333 | . . . . . . 7 ⊢ ((((𝑀 gcd 𝑁) ∈ ℝ ∧ 0 ≤ (𝑀 gcd 𝑁)) ∧ (𝑀 ∈ ℝ ∧ 0 ≤ 𝑀)) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) | |
23 | 15, 16, 18, 21, 22 | syl22anc 1202 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) |
24 | 23 | adantr 274 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) |
25 | 12, 24 | mpbid 146 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (𝑀 gcd 𝑁) = 𝑀) |
26 | gcddvds 11579 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) | |
27 | 1, 2, 26 | syl2an 287 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) |
28 | 27 | adantr 274 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) |
29 | 28 | simprd 113 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (𝑀 gcd 𝑁) ∥ 𝑁) |
30 | 25, 29 | eqbrtrrd 3922 | . . 3 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → 𝑀 ∥ 𝑁) |
31 | 30 | ex 114 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀↑2) ∥ (𝑁↑2) → 𝑀 ∥ 𝑁)) |
32 | 4, 31 | impbid 128 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 ↔ (𝑀↑2) ∥ (𝑁↑2))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1316 ∈ wcel 1465 class class class wbr 3899 (class class class)co 5742 ℝcr 7587 0cc0 7588 ≤ cle 7769 ℕcn 8688 2c2 8739 ℕ0cn0 8945 ℤcz 9022 ↑cexp 10260 ∥ cdvds 11420 gcd cgcd 11562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-coll 4013 ax-sep 4016 ax-nul 4024 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-iinf 4472 ax-cnex 7679 ax-resscn 7680 ax-1cn 7681 ax-1re 7682 ax-icn 7683 ax-addcl 7684 ax-addrcl 7685 ax-mulcl 7686 ax-mulrcl 7687 ax-addcom 7688 ax-mulcom 7689 ax-addass 7690 ax-mulass 7691 ax-distr 7692 ax-i2m1 7693 ax-0lt1 7694 ax-1rid 7695 ax-0id 7696 ax-rnegex 7697 ax-precex 7698 ax-cnre 7699 ax-pre-ltirr 7700 ax-pre-ltwlin 7701 ax-pre-lttrn 7702 ax-pre-apti 7703 ax-pre-ltadd 7704 ax-pre-mulgt0 7705 ax-pre-mulext 7706 ax-arch 7707 ax-caucvg 7708 |
This theorem depends on definitions: df-bi 116 df-stab 801 df-dc 805 df-3or 948 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-nel 2381 df-ral 2398 df-rex 2399 df-reu 2400 df-rmo 2401 df-rab 2402 df-v 2662 df-sbc 2883 df-csb 2976 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-if 3445 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-int 3742 df-iun 3785 df-br 3900 df-opab 3960 df-mpt 3961 df-tr 3997 df-id 4185 df-po 4188 df-iso 4189 df-iord 4258 df-on 4260 df-ilim 4261 df-suc 4263 df-iom 4475 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-fv 5101 df-riota 5698 df-ov 5745 df-oprab 5746 df-mpo 5747 df-1st 6006 df-2nd 6007 df-recs 6170 df-frec 6256 df-sup 6839 df-pnf 7770 df-mnf 7771 df-xr 7772 df-ltxr 7773 df-le 7774 df-sub 7903 df-neg 7904 df-reap 8305 df-ap 8312 df-div 8401 df-inn 8689 df-2 8747 df-3 8748 df-4 8749 df-n0 8946 df-z 9023 df-uz 9295 df-q 9380 df-rp 9410 df-fz 9759 df-fzo 9888 df-fl 10011 df-mod 10064 df-seqfrec 10187 df-exp 10261 df-cj 10582 df-re 10583 df-im 10584 df-rsqrt 10738 df-abs 10739 df-dvds 11421 df-gcd 11563 |
This theorem is referenced by: dvdssq 11646 |
Copyright terms: Public domain | W3C validator |