![]() |
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 11733 | . . . . . 6 ⊢ 0 < 1 | |
2 | 0re 11213 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
3 | 1re 11211 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
4 | lttr 11287 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) | |
5 | 2, 3, 4 | mp3an12 1447 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) |
6 | 1, 5 | mpani 693 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (1 < 𝑁 → 0 < 𝑁)) |
7 | 6 | imdistani 568 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (𝑁 ∈ ℝ ∧ 0 < 𝑁)) |
8 | elrp 12973 | . . . 4 ⊢ (𝑁 ∈ ℝ+ ↔ (𝑁 ∈ ℝ ∧ 0 < 𝑁)) | |
9 | 7, 8 | sylibr 233 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 𝑁 ∈ ℝ+) |
10 | 9, 3 | jctil 519 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 ∈ ℝ ∧ 𝑁 ∈ ℝ+)) |
11 | simpr 484 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → 1 < 𝑁) | |
12 | 0le1 11734 | . . 3 ⊢ 0 ≤ 1 | |
13 | 11, 12 | jctil 519 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (0 ≤ 1 ∧ 1 < 𝑁)) |
14 | modid 13858 | . 2 ⊢ (((1 ∈ ℝ ∧ 𝑁 ∈ ℝ+) ∧ (0 ≤ 1 ∧ 1 < 𝑁)) → (1 mod 𝑁) = 1) | |
15 | 10, 13, 14 | syl2anc 583 | 1 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 mod 𝑁) = 1) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 class class class wbr 5138 (class class class)co 7401 ℝcr 11105 0cc0 11106 1c1 11107 < clt 11245 ≤ cle 11246 ℝ+crp 12971 mod cmo 13831 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-n0 12470 df-z 12556 df-uz 12820 df-rp 12972 df-fl 13754 df-mod 13832 |
This theorem is referenced by: mulp1mod1 13874 p1modz1 16201 modm1div 16206 mod2eq1n2dvds 16287 vfermltl 16733 pockthlem 16837 pockthi 16839 sylow3lem6 19542 wilthlem1 26916 lgsne0 27184 gausslemma2dlem0i 27213 gausslemma2dlem7 27222 gausslemma2d 27223 numclwwlk5 30110 numclwwlk7 30113 m1mod0mod1 46522 fmtnoprmfac1lem 46717 fmtnoprmfac2lem1 46719 sfprmdvdsmersenne 46756 modexp2m1d 46765 4fppr1 46888 digexp 47481 |
Copyright terms: Public domain | W3C validator |