Metamath Proof Explorer


Theorem modvalp1

Description: The value of the modulo operation (expressed with sum of denominator and nominator). (Contributed by Alexander van der Vekens, 14-Apr-2018)

Ref Expression
Assertion modvalp1 ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A + B - A B + 1 ⁢ B = A mod B

Proof

Step Hyp Ref Expression
1 recn ⊢ A ∈ ℝ → A ∈ ℂ
2 1 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A ∈ ℂ
3 refldivcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ
4 3 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℂ
5 rpcn ⊢ B ∈ ℝ + → B ∈ ℂ
6 5 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ∈ ℂ
7 4 6 mulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ⁢ B ∈ ℂ
8 2 7 6 pnpcan2d ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A + B - A B ⁢ B + B = A − A B ⁢ B
9 4 6 adddirp1d ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B + 1 ⁢ B = A B ⁢ B + B
10 9 oveq2d ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A + B - A B + 1 ⁢ B = A + B - A B ⁢ B + B
11 modvalr ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = A − A B ⁢ B
12 8 10 11 3eqtr4d ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A + B - A B + 1 ⁢ B = A mod B