| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdssqim | Structured version Visualization version GIF version | ||
| Description: Unidirectional form of dvdssq 16704. (Contributed by Scott Fenton, 19-Apr-2014.) |
| Ref | Expression |
|---|---|
| dvdssqim | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divides 16391 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ ∃𝑘 ∈ ℤ (𝑘 · 𝑀) = 𝑁)) | |
| 2 | zsqcl 14240 | . . . . . . 7 ⊢ (𝑘 ∈ ℤ → (𝑘↑2) ∈ ℤ) | |
| 3 | zsqcl 14240 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀↑2) ∈ ℤ) | |
| 4 | dvdsmul2 16415 | . . . . . . 7 ⊢ (((𝑘↑2) ∈ ℤ ∧ (𝑀↑2) ∈ ℤ) → (𝑀↑2) ∥ ((𝑘↑2) · (𝑀↑2))) | |
| 5 | 2, 3, 4 | syl2anr 609 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑀↑2) ∥ ((𝑘↑2) · (𝑀↑2))) |
| 6 | zcn 12667 | . . . . . . 7 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ) | |
| 7 | zcn 12667 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 8 | sqmul 14230 | . . . . . . 7 ⊢ ((𝑘 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑘 · 𝑀)↑2) = ((𝑘↑2) · (𝑀↑2))) | |
| 9 | 6, 7, 8 | syl2anr 609 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝑀)↑2) = ((𝑘↑2) · (𝑀↑2))) |
| 10 | 5, 9 | breqtrrd 5132 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑀↑2) ∥ ((𝑘 · 𝑀)↑2)) |
| 11 | oveq1 7415 | . . . . . 6 ⊢ ((𝑘 · 𝑀) = 𝑁 → ((𝑘 · 𝑀)↑2) = (𝑁↑2)) | |
| 12 | 11 | breq2d 5114 | . . . . 5 ⊢ ((𝑘 · 𝑀) = 𝑁 → ((𝑀↑2) ∥ ((𝑘 · 𝑀)↑2) ↔ (𝑀↑2) ∥ (𝑁↑2))) |
| 13 | 10, 12 | syl5ibcom 248 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑘 · 𝑀) = 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
| 14 | 13 | rexlimdva 3163 | . . 3 ⊢ (𝑀 ∈ ℤ → (∃𝑘 ∈ ℤ (𝑘 · 𝑀) = 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
| 15 | 14 | adantr 486 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∃𝑘 ∈ ℤ (𝑘 · 𝑀) = 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
| 16 | 1, 15 | sylbid 243 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝑀↑2) ∥ (𝑁↑2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 class class class wbr 5102 (class class class)co 7408 ℂcc 11169 · cmul 11176 2c2 12366 ℤcz 12662 ↑cexp 14172 ∥ cdvds 16389 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-nn 12305 df-2 12374 df-n0 12576 df-z 12663 df-uz 12935 df-seq 14113 df-exp 14173 df-dvds 16390 |
| This theorem is used by: sqgcd 16699 dvdssqlem 16703 2sqcoprm 27725 2sqmod 27726 |
| Copyright terms: Public domain | W3C validator |