| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1mod | Structured version Visualization version GIF version | ||
| Description: Special case: 1 modulo a real number greater than 1 is 1. (Contributed by Mario Carneiro, 18-Feb-2014.) |
| Ref | Expression |
|---|---|
| 1mod | ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 mod 𝑁) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0lt1 11636 | . . . . . 6 ⊢ 0 < 1 | |
| 2 | 0re 11111 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 3 | 1re 11109 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 4 | lttr 11186 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) | |
| 5 | 2, 3, 4 | mp3an12 1453 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) |
| 6 | 1, 5 | mpani 696 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (1 < 𝑁 → 0 < 𝑁)) |
| 7 | 6 | imdistani 568 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (𝑁 ∈ ℝ ∧ 0 < 𝑁)) |
| 8 | elrp 12889 | . . . 4 ⊢ (𝑁 ∈ ℝ+ ↔ (𝑁 ∈ ℝ ∧ 0 < 𝑁)) | |
| 9 | 7, 8 | sylibr 234 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 𝑁 ∈ ℝ+) |
| 10 | 9, 3 | jctil 519 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 ∈ ℝ ∧ 𝑁 ∈ ℝ+)) |
| 11 | simpr 484 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 1 < 𝑁) | |
| 12 | 0le1 11637 | . . 3 ⊢ 0 ≤ 1 | |
| 13 | 11, 12 | jctil 519 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (0 ≤ 1 ∧ 1 < 𝑁)) |
| 14 | modid 13797 | . 2 ⊢ (((1 ∈ ℝ ∧ 𝑁 ∈ ℝ+) ∧ (0 ≤ 1 ∧ 1 < 𝑁)) → (1 mod 𝑁) = 1) | |
| 15 | 10, 13, 14 | syl2anc 584 | 1 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 mod 𝑁) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 class class class wbr 5091 (class class class)co 7346 ℝcr 11002 0cc0 11003 1c1 11004 < clt 11143 ≤ cle 11144 ℝ+crp 12887 mod cmo 13770 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 ax-pre-sup 11081 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-sup 9326 df-inf 9327 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-div 11772 df-nn 12123 df-n0 12379 df-z 12466 df-uz 12730 df-rp 12888 df-fl 13693 df-mod 13771 |
| This theorem is referenced by: mulp1mod1 13815 p1modz1 16167 modm1div 16172 mod2eq1n2dvds 16255 vfermltl 16710 pockthlem 16814 pockthi 16816 sylow3lem6 19542 wilthlem1 27003 lgsne0 27271 gausslemma2dlem0i 27300 gausslemma2dlem7 27309 gausslemma2d 27310 numclwwlk5 30363 numclwwlk7 30366 ceil5half3 47370 m1mod0mod1 47384 fmtnoprmfac1lem 47594 fmtnoprmfac2lem1 47596 sfprmdvdsmersenne 47633 modexp2m1d 47642 4fppr1 47765 gpgprismgriedgdmss 48082 gpgprismgr4cycllem3 48127 gpg5edgnedg 48160 digexp 48638 |
| Copyright terms: Public domain | W3C validator |