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 12216 | . . . . 5 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ≤ (𝑀 − 1)) | |
2 | 1 | adantl 481 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ≤ (𝑀 − 1)) |
3 | elfzelz 12213 | . . . . . 6 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ∈ ℤ) | |
4 | 3 | adantl 481 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℤ) |
5 | nnz 11276 | . . . . . 6 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑀 ∈ ℤ) |
7 | zltlem1 11307 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 < 𝑀 ↔ 𝑁 ≤ (𝑀 − 1))) | |
8 | 4, 6, 7 | syl2anc 691 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑁 < 𝑀 ↔ 𝑁 ≤ (𝑀 − 1))) |
9 | 2, 8 | mpbird 246 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 < 𝑀) |
10 | elfznn 12241 | . . . . . 6 ⊢ (𝑁 ∈ (1...(𝑀 − 1)) → 𝑁 ∈ ℕ) | |
11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℕ) |
12 | 11 | nnred 10912 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑁 ∈ ℝ) |
13 | nnre 10904 | . . . . 5 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ) | |
14 | 13 | adantr 480 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → 𝑀 ∈ ℝ) |
15 | 12, 14 | ltnled 10063 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑁 < 𝑀 ↔ ¬ 𝑀 ≤ 𝑁)) |
16 | 9, 15 | mpbid 221 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → ¬ 𝑀 ≤ 𝑁) |
17 | dvdsle 14870 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) | |
18 | 6, 11, 17 | syl2anc 691 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → (𝑀 ∥ 𝑁 → 𝑀 ≤ 𝑁)) |
19 | 16, 18 | mtod 188 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (1...(𝑀 − 1))) → ¬ 𝑀 ∥ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 class class class wbr 4583 (class class class)co 6549 ℝcr 9814 1c1 9816 < clt 9953 ≤ cle 9954 − cmin 10145 ℕcn 10897 ℤcz 11254 ...cfz 12197 ∥ cdvds 14821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-dvds 14822 |
This theorem is referenced by: prmdivdiv 15330 reumodprminv 15347 wilthlem1 24594 wilthlem2 24595 wilthlem3 24596 lgseisenlem1 24900 lgseisenlem2 24901 lgseisenlem3 24902 lgsquadlem3 24907 etransclem44 39171 |
Copyright terms: Public domain | W3C validator |