| 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 11668 | . . . . . 6 ⊢ 0 < 1 | |
| 2 | 0re 11142 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 3 | 1re 11140 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 4 | lttr 11218 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) | |
| 5 | 2, 3, 4 | mp3an12 1460 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) |
| 6 | 1, 5 | mpani 703 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (1 < 𝑁 → 0 < 𝑁)) |
| 7 | 6 | imdistani 574 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (𝑁 ∈ ℝ ∧ 0 < 𝑁)) |
| 8 | elrp 12939 | . . . 4 ⊢ (𝑁 ∈ ℝ+ ↔ (𝑁 ∈ ℝ ∧ 0 < 𝑁)) | |
| 9 | 7, 8 | sylibr 236 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 𝑁 ∈ ℝ+) |
| 10 | 9, 3 | jctil 525 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 ∈ ℝ ∧ 𝑁 ∈ ℝ+)) |
| 11 | simpr 486 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 1 < 𝑁) | |
| 12 | 0le1 11669 | . . 3 ⊢ 0 ≤ 1 | |
| 13 | 11, 12 | jctil 525 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (0 ≤ 1 ∧ 1 < 𝑁)) |
| 14 | modid 13850 | . 2 ⊢ (((1 ∈ ℝ ∧ 𝑁 ∈ ℝ+) ∧ (0 ≤ 1 ∧ 1 < 𝑁)) → (1 mod 𝑁) = 1) | |
| 15 | 10, 13, 14 | syl2anc 591 | 1 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 mod 𝑁) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 class class class wbr 5074 (class class class)co 7359 ℝcr 11033 0cc0 11034 1c1 11035 < clt 11175 ≤ cle 11176 ℝ+crp 12937 mod cmo 13823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-inf 9350 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fl 13746 df-mod 13824 |
| This theorem is referenced by: mulp1mod1 13868 p1modz1 16223 modm1div 16228 mod2eq1n2dvds 16311 vfermltl 16767 pockthlem 16871 pockthi 16873 sylow3lem6 19601 wilthlem1 27052 lgsne0 27319 gausslemma2dlem0i 27348 gausslemma2dlem7 27357 gausslemma2d 27358 numclwwlk5 30478 numclwwlk7 30481 ceil5half3 47821 m1mod0mod1 47835 fmtnoprmfac1lem 48054 fmtnoprmfac2lem1 48056 sfprmdvdsmersenne 48093 modexp2m1d 48102 4fppr1 48238 gpgprismgriedgdmss 48555 gpgprismgr4cycllem3 48600 gpg5edgnedg 48633 digexp 49110 |
| Copyright terms: Public domain | W3C validator |