Metamath Proof Explorer


Theorem modid0

Description: A positive real number modulo itself is 0. (Contributed by Alexander van der Vekens, 15-May-2018)

Ref Expression
Assertion modid0 ⊢ N ∈ ℝ + → N mod N = 0

Proof

Step Hyp Ref Expression
1 rpcn ⊢ N ∈ ℝ + → N ∈ ℂ
2 rpne0 ⊢ N ∈ ℝ + → N ≠ 0
3 1 2 dividd ⊢ N ∈ ℝ + → N N = 1
4 1z ⊢ 1 ∈ ℤ
5 3 4 eqeltrdi ⊢ N ∈ ℝ + → N N ∈ ℤ
6 rpre ⊢ N ∈ ℝ + → N ∈ ℝ
7 mod0 ⊢ N ∈ ℝ ∧ N ∈ ℝ + → N mod N = 0 ↔ N N ∈ ℤ
8 6 7 mpancom ⊢ N ∈ ℝ + → N mod N = 0 ↔ N N ∈ ℤ
9 5 8 mpbird ⊢ N ∈ ℝ + → N mod N = 0