Metamath Proof Explorer


Theorem 1mod

Description: Special case: 1 modulo a real number greater than 1 is 1. (Contributed by Mario Carneiro, 18-Feb-2014)

Ref Expression
Assertion 1mod ⊢ N ∈ ℝ ∧ 1 < N → 1 mod N = 1

Proof

Step Hyp Ref Expression
1 0lt1 ⊢ 0 < 1
2 0re ⊢ 0 ∈ ℝ
3 1re ⊢ 1 ∈ ℝ
4 lttr ⊢ 0 ∈ ℝ ∧ 1 ∈ ℝ ∧ N ∈ ℝ → 0 < 1 ∧ 1 < N → 0 < N
5 2 3 4 mp3an12 ⊢ N ∈ ℝ → 0 < 1 ∧ 1 < N → 0 < N
6 1 5 mpani ⊢ N ∈ ℝ → 1 < N → 0 < N
7 6 imdistani ⊢ N ∈ ℝ ∧ 1 < N → N ∈ ℝ ∧ 0 < N
8 elrp ⊢ N ∈ ℝ + ↔ N ∈ ℝ ∧ 0 < N
9 7 8 sylibr ⊢ N ∈ ℝ ∧ 1 < N → N ∈ ℝ +
10 9 3 jctil ⊢ N ∈ ℝ ∧ 1 < N → 1 ∈ ℝ ∧ N ∈ ℝ +
11 simpr ⊢ N ∈ ℝ ∧ 1 < N → 1 < N
12 0le1 ⊢ 0 ≤ 1
13 11 12 jctil ⊢ N ∈ ℝ ∧ 1 < N → 0 ≤ 1 ∧ 1 < N
14 modid ⊢ 1 ∈ ℝ ∧ N ∈ ℝ + ∧ 0 ≤ 1 ∧ 1 < N → 1 mod N = 1
15 10 13 14 syl2anc ⊢ N ∈ ℝ ∧ 1 < N → 1 mod N = 1