|   | 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 11786 | . . . . . 6 ⊢ 0 < 1 | |
| 2 | 0re 11264 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 3 | 1re 11262 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 4 | lttr 11338 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) | |
| 5 | 2, 3, 4 | mp3an12 1452 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → ((0 < 1 ∧ 1 < 𝑁) → 0 < 𝑁)) | 
| 6 | 1, 5 | mpani 696 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (1 < 𝑁 → 0 < 𝑁)) | 
| 7 | 6 | imdistani 568 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (𝑁 ∈ ℝ ∧ 0 < 𝑁)) | 
| 8 | elrp 13037 | . . . 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 11787 | . . 3 ⊢ 0 ≤ 1 | |
| 13 | 11, 12 | jctil 519 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (0 ≤ 1 ∧ 1 < 𝑁)) | 
| 14 | modid 13937 | . 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 1539 ∈ wcel 2107 class class class wbr 5142 (class class class)co 7432 ℝcr 11155 0cc0 11156 1c1 11157 < clt 11296 ≤ cle 11297 ℝ+crp 13035 mod cmo 13910 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 ax-pre-sup 11234 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-sup 9483 df-inf 9484 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-div 11922 df-nn 12268 df-n0 12529 df-z 12616 df-uz 12880 df-rp 13036 df-fl 13833 df-mod 13911 | 
| This theorem is referenced by: mulp1mod1 13953 p1modz1 16298 modm1div 16303 mod2eq1n2dvds 16385 vfermltl 16840 pockthlem 16944 pockthi 16946 sylow3lem6 19651 wilthlem1 27112 lgsne0 27380 gausslemma2dlem0i 27409 gausslemma2dlem7 27418 gausslemma2d 27419 numclwwlk5 30408 numclwwlk7 30411 ceil5half3 47347 m1mod0mod1 47361 fmtnoprmfac1lem 47556 fmtnoprmfac2lem1 47558 sfprmdvdsmersenne 47595 modexp2m1d 47604 4fppr1 47727 digexp 48533 | 
| Copyright terms: Public domain | W3C validator |