Metamath Proof Explorer


Theorem intfracq

Description: Decompose a rational number, expressed as a ratio, into integer and fractional parts. The fractional part has a tighter bound than that of intfrac2 . (Contributed by NM, 16-Aug-2008)

Ref Expression
Hypotheses intfracq.1 ⊢ Z = M N
intfracq.2 ⊢ F = M N − Z
Assertion intfracq ⊢ M ∈ ℤ ∧ N ∈ ℕ → 0 ≤ F ∧ F ≤ N − 1 N ∧ M N = Z + F

Proof

Step Hyp Ref Expression
1 intfracq.1 ⊢ Z = M N
2 intfracq.2 ⊢ F = M N − Z
3 zre ⊢ M ∈ ℤ → M ∈ ℝ
4 3 adantr ⊢ M ∈ ℤ ∧ N ∈ ℕ → M ∈ ℝ
5 nnre ⊢ N ∈ ℕ → N ∈ ℝ
6 5 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ∈ ℝ
7 nnne0 ⊢ N ∈ ℕ → N ≠ 0
8 7 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ≠ 0
9 4 6 8 redivcld ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N ∈ ℝ
10 1 2 intfrac2 ⊢ M N ∈ ℝ → 0 ≤ F ∧ F < 1 ∧ M N = Z + F
11 9 10 syl ⊢ M ∈ ℤ ∧ N ∈ ℕ → 0 ≤ F ∧ F < 1 ∧ M N = Z + F
12 11 simp1d ⊢ M ∈ ℤ ∧ N ∈ ℕ → 0 ≤ F
13 fraclt1 ⊢ M N ∈ ℝ → M N − M N < 1
14 9 13 syl ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N − M N < 1
15 1 oveq2i ⊢ M N − Z = M N − M N
16 2 15 eqtri ⊢ F = M N − M N
17 16 a1i ⊢ M ∈ ℤ ∧ N ∈ ℕ → F = M N − M N
18 nncn ⊢ N ∈ ℕ → N ∈ ℂ
19 18 7 dividd ⊢ N ∈ ℕ → N N = 1
20 19 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N N = 1
21 14 17 20 3brtr4d ⊢ M ∈ ℤ ∧ N ∈ ℕ → F < N N
22 reflcl ⊢ M N ∈ ℝ → M N ∈ ℝ
23 9 22 syl ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N ∈ ℝ
24 1 23 eqeltrid ⊢ M ∈ ℤ ∧ N ∈ ℕ → Z ∈ ℝ
25 9 24 resubcld ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N − Z ∈ ℝ
26 2 25 eqeltrid ⊢ M ∈ ℤ ∧ N ∈ ℕ → F ∈ ℝ
27 nngt0 ⊢ N ∈ ℕ → 0 < N
28 5 27 jca ⊢ N ∈ ℕ → N ∈ ℝ ∧ 0 < N
29 28 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ∈ ℝ ∧ 0 < N
30 ltmuldiv2 ⊢ F ∈ ℝ ∧ N ∈ ℝ ∧ N ∈ ℝ ∧ 0 < N → N ⁢ F < N ↔ F < N N
31 26 6 29 30 syl3anc ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F < N ↔ F < N N
32 21 31 mpbird ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F < N
33 2 oveq2i ⊢ N ⁢ F = N ⁢ M N − Z
34 18 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ∈ ℂ
35 9 recnd ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N ∈ ℂ
36 9 flcld ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N ∈ ℤ
37 1 36 eqeltrid ⊢ M ∈ ℤ ∧ N ∈ ℕ → Z ∈ ℤ
38 37 zcnd ⊢ M ∈ ℤ ∧ N ∈ ℕ → Z ∈ ℂ
39 34 35 38 subdid ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ M N − Z = N ⁢ M N − N ⁢ Z
40 33 39 eqtrid ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F = N ⁢ M N − N ⁢ Z
41 zcn ⊢ M ∈ ℤ → M ∈ ℂ
42 41 adantr ⊢ M ∈ ℤ ∧ N ∈ ℕ → M ∈ ℂ
43 42 34 8 divcan2d ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ M N = M
44 simpl ⊢ M ∈ ℤ ∧ N ∈ ℕ → M ∈ ℤ
45 43 44 eqeltrd ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ M N ∈ ℤ
46 nnz ⊢ N ∈ ℕ → N ∈ ℤ
47 46 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ∈ ℤ
48 47 37 zmulcld ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ Z ∈ ℤ
49 45 48 zsubcld ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ M N − N ⁢ Z ∈ ℤ
50 40 49 eqeltrd ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F ∈ ℤ
51 zltlem1 ⊢ N ⁢ F ∈ ℤ ∧ N ∈ ℤ → N ⁢ F < N ↔ N ⁢ F ≤ N − 1
52 50 47 51 syl2anc ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F < N ↔ N ⁢ F ≤ N − 1
53 32 52 mpbid ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F ≤ N − 1
54 peano2rem ⊢ N ∈ ℝ → N − 1 ∈ ℝ
55 5 54 syl ⊢ N ∈ ℕ → N − 1 ∈ ℝ
56 55 adantl ⊢ M ∈ ℤ ∧ N ∈ ℕ → N − 1 ∈ ℝ
57 lemuldiv2 ⊢ F ∈ ℝ ∧ N − 1 ∈ ℝ ∧ N ∈ ℝ ∧ 0 < N → N ⁢ F ≤ N − 1 ↔ F ≤ N − 1 N
58 26 56 29 57 syl3anc ⊢ M ∈ ℤ ∧ N ∈ ℕ → N ⁢ F ≤ N − 1 ↔ F ≤ N − 1 N
59 53 58 mpbid ⊢ M ∈ ℤ ∧ N ∈ ℕ → F ≤ N − 1 N
60 11 simp3d ⊢ M ∈ ℤ ∧ N ∈ ℕ → M N = Z + F
61 12 59 60 3jca ⊢ M ∈ ℤ ∧ N ∈ ℕ → 0 ≤ F ∧ F ≤ N − 1 N ∧ M N = Z + F