![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dvdssqlem | GIF version |
Description: Lemma for dvdssq 12026. (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 9270 | . . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
2 | nnz 9270 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
3 | dvdssqim 12019 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) | |
4 | 1, 2, 3 | syl2an 289 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
5 | sqgcd 12024 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀 gcd 𝑁)↑2) = ((𝑀↑2) gcd (𝑁↑2))) | |
6 | 5 | adantr 276 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁)↑2) = ((𝑀↑2) gcd (𝑁↑2))) |
7 | nnsqcl 10586 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (𝑀↑2) ∈ ℕ) | |
8 | nnsqcl 10586 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁↑2) ∈ ℕ) | |
9 | gcdeq 12018 | . . . . . . . 8 ⊢ (((𝑀↑2) ∈ ℕ ∧ (𝑁↑2) ∈ ℕ) → (((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2) ↔ (𝑀↑2) ∥ (𝑁↑2))) | |
10 | 7, 8, 9 | syl2an 289 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2) ↔ (𝑀↑2) ∥ (𝑁↑2))) |
11 | 10 | biimpar 297 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀↑2) gcd (𝑁↑2)) = (𝑀↑2)) |
12 | 6, 11 | eqtrd 2210 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁)↑2) = (𝑀↑2)) |
13 | gcdcl 11961 | . . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) ∈ ℕ0) | |
14 | 1, 2, 13 | syl2an 289 | . . . . . . . 8 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 gcd 𝑁) ∈ ℕ0) |
15 | 14 | nn0red 9228 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 gcd 𝑁) ∈ ℝ) |
16 | 14 | nn0ge0d 9230 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ≤ (𝑀 gcd 𝑁)) |
17 | nnre 8924 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ) | |
18 | 17 | adantr 276 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 𝑀 ∈ ℝ) |
19 | nnnn0 9181 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ0) | |
20 | 19 | nn0ge0d 9230 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → 0 ≤ 𝑀) |
21 | 20 | adantr 276 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → 0 ≤ 𝑀) |
22 | sq11 10589 | . . . . . . 7 ⊢ ((((𝑀 gcd 𝑁) ∈ ℝ ∧ 0 ≤ (𝑀 gcd 𝑁)) ∧ (𝑀 ∈ ℝ ∧ 0 ≤ 𝑀)) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) | |
23 | 15, 16, 18, 21, 22 | syl22anc 1239 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) |
24 | 23 | adantr 276 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (((𝑀 gcd 𝑁)↑2) = (𝑀↑2) ↔ (𝑀 gcd 𝑁) = 𝑀)) |
25 | 12, 24 | mpbid 147 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (𝑀 gcd 𝑁) = 𝑀) |
26 | gcddvds 11958 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) | |
27 | 1, 2, 26 | syl2an 289 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) |
28 | 27 | adantr 276 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) |
29 | 28 | simprd 114 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → (𝑀 gcd 𝑁) ∥ 𝑁) |
30 | 25, 29 | eqbrtrrd 4027 | . . 3 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑀↑2) ∥ (𝑁↑2)) → 𝑀 ∥ 𝑁) |
31 | 30 | ex 115 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝑀↑2) ∥ (𝑁↑2) → 𝑀 ∥ 𝑁)) |
32 | 4, 31 | impbid 129 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 ↔ (𝑀↑2) ∥ (𝑁↑2))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 class class class wbr 4003 (class class class)co 5874 ℝcr 7809 0cc0 7810 ≤ cle 7991 ℕcn 8917 2c2 8968 ℕ0cn0 9174 ℤcz 9251 ↑cexp 10516 ∥ cdvds 11789 gcd cgcd 11937 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4118 ax-sep 4121 ax-nul 4129 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-iinf 4587 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 ax-caucvg 7930 |
This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-tr 4102 df-id 4293 df-po 4296 df-iso 4297 df-iord 4366 df-on 4368 df-ilim 4369 df-suc 4371 df-iom 4590 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-recs 6305 df-frec 6391 df-sup 6982 df-pnf 7992 df-mnf 7993 df-xr 7994 df-ltxr 7995 df-le 7996 df-sub 8128 df-neg 8129 df-reap 8530 df-ap 8537 df-div 8628 df-inn 8918 df-2 8976 df-3 8977 df-4 8978 df-n0 9175 df-z 9252 df-uz 9527 df-q 9618 df-rp 9652 df-fz 10007 df-fzo 10140 df-fl 10267 df-mod 10320 df-seqfrec 10443 df-exp 10517 df-cj 10846 df-re 10847 df-im 10848 df-rsqrt 11002 df-abs 11003 df-dvds 11790 df-gcd 11938 |
This theorem is referenced by: dvdssq 12026 |
Copyright terms: Public domain | W3C validator |