| 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 12375 | . . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → (𝑛 · 𝑀) ≠ 𝑁) |
| 8 | 7 | neneqd 2421 | . . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) ∧ 𝑛 ∈ ℤ) → ¬ (𝑛 · 𝑀) = 𝑁) |
| 9 | 8 | nrexdv 2623 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → ¬ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁) |
| 10 | simpll 527 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑀 ∈ ℤ) | |
| 11 | simplr 528 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑁 ∈ ℕ) | |
| 12 | 11 | nnzd 9584 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → 𝑁 ∈ ℤ) |
| 13 | divides 12321 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁)) | |
| 14 | 10, 12, 13 | syl2anc 411 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁)) |
| 15 | 9, 14 | mtbird 677 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → ¬ 𝑀 ∥ 𝑁) |
| 16 | 15 | pm2.21d 622 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑁 < 𝑀) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
| 17 | nnz 9481 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 18 | zlelttric 9507 | . . 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 4083 (class class class)co 6010 · cmul 8020 < clt 8197 ≤ cle 8198 ℕcn 9126 ℤcz 9462 ∥ cdvds 12319 |
| 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 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-mulrcl 8114 ax-addcom 8115 ax-mulcom 8116 ax-addass 8117 ax-mulass 8118 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-1rid 8122 ax-0id 8123 ax-rnegex 8124 ax-precex 8125 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 ax-pre-mulgt0 8132 ax-pre-mulext 8133 |
| 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 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-po 4388 df-iso 4389 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-reap 8738 df-ap 8745 df-div 8836 df-inn 9127 df-n0 9386 df-z 9463 df-q 9832 df-dvds 12320 |
| This theorem is referenced by: dvdsleabs 12377 dvdsssfz1 12384 fzm1ndvds 12388 fzo0dvdseq 12389 n2dvds1 12444 gcd1 12529 bezoutlemle 12550 dfgcd2 12556 gcdzeq 12564 bezoutr1 12575 lcmgcdlem 12620 ncoprmgcdne1b 12632 qredeq 12639 isprm3 12661 prmdvdsfz 12682 isprm5lem 12684 isprm6 12690 prmfac1 12695 pcpre1 12836 pcidlem 12867 pcprod 12890 pcfac 12894 pockthg 12901 1arith 12911 4sqlem11 12945 znidomb 14643 lgsdir 15735 lgsdilem2 15736 lgsne0 15738 lgsquadlem2 15778 2sqlem8 15823 |
| Copyright terms: Public domain | W3C validator |