Metamath Proof Explorer


Theorem flpmodeq

Description: Partition of a division into its integer part and the remainder. (Contributed by Alexander van der Vekens, 14-Apr-2018)

Ref Expression
Assertion flpmodeq ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ⁢ B + A mod B = A

Proof

Step Hyp Ref Expression
1 modvalr ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = A − A B ⁢ B
2 1 eqcomd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A − A B ⁢ B = A mod B
3 recn ⊢ A ∈ ℝ → A ∈ ℂ
4 3 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A ∈ ℂ
5 rerpdivcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ
6 flcl ⊢ A B ∈ ℝ → A B ∈ ℤ
7 6 zcnd ⊢ A B ∈ ℝ → A B ∈ ℂ
8 5 7 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℂ
9 rpcn ⊢ B ∈ ℝ + → B ∈ ℂ
10 9 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ∈ ℂ
11 8 10 mulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ⁢ B ∈ ℂ
12 modcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B ∈ ℝ
13 12 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B ∈ ℂ
14 4 11 13 subaddd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A − A B ⁢ B = A mod B ↔ A B ⁢ B + A mod B = A
15 2 14 mpbid ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ⁢ B + A mod B = A