Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvdssqf | Structured version Visualization version GIF version |
Description: A divisor of a squarefree number is squarefree. (Contributed by Mario Carneiro, 1-Jul-2015.) |
Ref | Expression |
---|---|
dvdssqf | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → ((μ‘𝐴) ≠ 0 → (μ‘𝐵) ≠ 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl3 1185 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝐵 ∥ 𝐴) | |
2 | prmz 16007 | . . . . . . . 8 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ) | |
3 | 2 | adantl 482 | . . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℤ) |
4 | zsqcl 13482 | . . . . . . 7 ⊢ (𝑝 ∈ ℤ → (𝑝↑2) ∈ ℤ) | |
5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → (𝑝↑2) ∈ ℤ) |
6 | simpl2 1184 | . . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝐵 ∈ ℕ) | |
7 | 6 | nnzd 12074 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝐵 ∈ ℤ) |
8 | simpl1 1183 | . . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ) | |
9 | 8 | nnzd 12074 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℤ) |
10 | dvdstr 15634 | . . . . . 6 ⊢ (((𝑝↑2) ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (((𝑝↑2) ∥ 𝐵 ∧ 𝐵 ∥ 𝐴) → (𝑝↑2) ∥ 𝐴)) | |
11 | 5, 7, 9, 10 | syl3anc 1363 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → (((𝑝↑2) ∥ 𝐵 ∧ 𝐵 ∥ 𝐴) → (𝑝↑2) ∥ 𝐴)) |
12 | 1, 11 | mpan2d 690 | . . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) ∧ 𝑝 ∈ ℙ) → ((𝑝↑2) ∥ 𝐵 → (𝑝↑2) ∥ 𝐴)) |
13 | 12 | reximdva 3271 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → (∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐵 → ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
14 | isnsqf 25639 | . . . 4 ⊢ (𝐵 ∈ ℕ → ((μ‘𝐵) = 0 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐵)) | |
15 | 14 | 3ad2ant2 1126 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → ((μ‘𝐵) = 0 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐵)) |
16 | isnsqf 25639 | . . . 4 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = 0 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) | |
17 | 16 | 3ad2ant1 1125 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → ((μ‘𝐴) = 0 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
18 | 13, 15, 17 | 3imtr4d 295 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → ((μ‘𝐵) = 0 → (μ‘𝐴) = 0)) |
19 | 18 | necon3d 3034 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∥ 𝐴) → ((μ‘𝐴) ≠ 0 → (μ‘𝐵) ≠ 0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∃wrex 3136 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 0cc0 10525 ℕcn 11626 2c2 11680 ℤcz 11969 ↑cexp 13417 ∥ cdvds 15595 ℙcprime 16003 μcmu 25599 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-seq 13358 df-exp 13418 df-hash 13679 df-dvds 15596 df-prm 16004 df-mu 25605 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |