| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvdsle | GIF version | ||
| Description: The divisors of a positive integer are bounded by it. The proof does not use /. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| dvdsle | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ 𝑁) | |
| 2 | 1 | a1d 22 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑀 ≤ 𝑁) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
| 3 | simplll 533 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → 𝑀 ∈ ℤ) | |
| 4 | simpllr 534 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → 𝑁 ∈ ℕ) | |
| 5 | simpr 110 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℤ) | |
| 6 | simplr 528 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → 𝑁 < 𝑀) | |
| 7 | 3, 4, 5, 6 | dvdslelemd 12397 | . . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑀) ≠ 𝑁) |
| 8 | 7 | neneqd 2421 | . . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → ¬ (𝑛 · 𝑀) = 𝑁) |
| 9 | 8 | nrexdv 2623 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → ¬ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁) |
| 10 | simpll 527 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑀 ∈ ℤ) | |
| 11 | simplr 528 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑁 ∈ ℕ) | |
| 12 | 11 | nnzd 9594 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑁 ∈ ℤ) |
| 13 | divides 12343 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁)) | |
| 14 | 10, 12, 13 | syl2anc 411 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁)) |
| 15 | 9, 14 | mtbird 677 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → ¬ 𝑀 ∥ 𝑁) |
| 16 | 15 | pm2.21d 622 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
| 17 | nnz 9491 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 18 | zlelttric 9517 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ∨ 𝑁 < 𝑀)) | |
| 19 | 17, 18 | sylan2 286 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 ≤ 𝑁 ∨ 𝑁 < 𝑀)) |
| 20 | 2, 16, 19 | mpjaodan 803 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 class class class wbr 4086 (class class class)co 6013 · cmul 8030 < clt 8207 ≤ cle 8208 ℕcn 9136 ℤcz 9472 ∥ cdvds 12341 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-po 4391 df-iso 4392 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-n0 9396 df-z 9473 df-q 9847 df-dvds 12342 |
| This theorem is referenced by: dvdsleabs 12399 dvdsssfz1 12406 fzm1ndvds 12410 fzo0dvdseq 12411 n2dvds1 12466 gcd1 12551 bezoutlemle 12572 dfgcd2 12578 gcdzeq 12586 bezoutr1 12597 lcmgcdlem 12642 ncoprmgcdne1b 12654 qredeq 12661 isprm3 12683 prmdvdsfz 12704 isprm5lem 12706 isprm6 12712 prmfac1 12717 pcpre1 12858 pcidlem 12889 pcprod 12912 pcfac 12916 pockthg 12923 1arith 12933 4sqlem11 12967 znidomb 14665 lgsdir 15757 lgsdilem2 15758 lgsne0 15760 lgsquadlem2 15800 2sqlem8 15845 |
| Copyright terms: Public domain | W3C validator |