Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fzm1ndvds | Structured version Visualization version GIF version |
Description: No number between 1 and 𝑀 − 1 divides 𝑀. (Contributed by Mario Carneiro, 24-Jan-2015.) |
Ref | Expression |
---|---|
fzm1ndvds | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → ¬ 𝑀 ∥ 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfzle2 13362 | . . . . 5 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ≤ (𝑀 − 1)) | |
2 | 1 | adantl 482 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ≤ (𝑀 − 1)) |
3 | elfzelz 13358 | . . . . . 6 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ∈ ℤ) | |
4 | 3 | adantl 482 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℤ) |
5 | nnz 12444 | . . . . . 6 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
6 | 5 | adantr 481 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑀 ∈ ℤ) |
7 | zltlem1 12475 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ 𝑁 ≤ (𝑀 − 1))) | |
8 | 4, 6, 7 | syl2anc 584 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑁 < 𝑀 ↔ 𝑁 ≤ (𝑀 − 1))) |
9 | 2, 8 | mpbird 256 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 < 𝑀) |
10 | elfznn 13387 | . . . . . 6 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ∈ ℕ) | |
11 | 10 | adantl 482 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℕ) |
12 | 11 | nnred 12090 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℝ) |
13 | nnre 12082 | . . . . 5 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ) | |
14 | 13 | adantr 481 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑀 ∈ ℝ) |
15 | 12, 14 | ltnled 11224 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
16 | 9, 15 | mpbid 231 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → ¬ 𝑀 ≤ 𝑁) |
17 | dvdsle 16119 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) | |
18 | 6, 11, 17 | syl2anc 584 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
19 | 16, 18 | mtod 197 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → ¬ 𝑀 ∥ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2105 class class class wbr 5093 (class class class)co 7338 ℝcr 10972 1c1 10974 < clt 11111 ≤ cle 11112 − cmin 11307 ℕcn 12075 ℤcz 12421 ...cfz 13341 ∥ cdvds 16063 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5244 ax-nul 5251 ax-pow 5309 ax-pr 5373 ax-un 7651 ax-cnex 11029 ax-resscn 11030 ax-1cn 11031 ax-icn 11032 ax-addcl 11033 ax-addrcl 11034 ax-mulcl 11035 ax-mulrcl 11036 ax-mulcom 11037 ax-addass 11038 ax-mulass 11039 ax-distr 11040 ax-i2m1 11041 ax-1ne0 11042 ax-1rid 11043 ax-rnegex 11044 ax-rrecex 11045 ax-cnre 11046 ax-pre-lttri 11047 ax-pre-lttrn 11048 ax-pre-ltadd 11049 ax-pre-mulgt0 11050 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4271 df-if 4475 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4854 df-iun 4944 df-br 5094 df-opab 5156 df-mpt 5177 df-tr 5211 df-id 5519 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5576 df-we 5578 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6239 df-ord 6306 df-on 6307 df-lim 6308 df-suc 6309 df-iota 6432 df-fun 6482 df-fn 6483 df-f 6484 df-f1 6485 df-fo 6486 df-f1o 6487 df-fv 6488 df-riota 7294 df-ov 7341 df-oprab 7342 df-mpo 7343 df-om 7782 df-1st 7900 df-2nd 7901 df-frecs 8168 df-wrecs 8199 df-recs 8273 df-rdg 8312 df-er 8570 df-en 8806 df-dom 8807 df-sdom 8808 df-pnf 11113 df-mnf 11114 df-xr 11115 df-ltxr 11116 df-le 11117 df-sub 11309 df-neg 11310 df-nn 12076 df-n0 12336 df-z 12422 df-uz 12685 df-fz 13342 df-dvds 16064 |
This theorem is referenced by: prmdivdiv 16586 reumodprminv 16603 wilthlem1 26324 wilthlem2 26325 wilthlem3 26326 lgseisenlem1 26630 lgseisenlem2 26631 lgseisenlem3 26632 lgsquadlem3 26637 etransclem44 44207 |
Copyright terms: Public domain | W3C validator |