Theorems · Theorem · number theory
padicValNat.mul
∀ {p a b : ℕ} [hp : Fact (Nat.Prime p)], a ≠ 0 → b ≠ 0 → padicValNat p (a * b) = padicValNat p a + padicValNat p bA rewrite lemma for padicValNat p (a * b) with conditions a ≠ 0, b ≠ 0.
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fact
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Factstatement and proof · cited by 2,726
- Nat.Primestatement and proof · cited by 2,059
- Nat.cast_zeroproof · cited by 1,870
- padicValNatstatement and proof · cited by 106
- padicValRatproof · cited by 49
- padicValRat.mulproof · cited by 5
Cited by6
Results whose statement or proof uses this declaration.
- padicValNat.div_of_dvdproof · cited by 4
- sub_one_mul_padicValNat_choose_eq_sub_sum_digits'proof · cited by 1
- padicValNat_factorial_mul_addproof · cited by 1
- padicValNat_mul_pow_leftproof · cited by 1
- padicValInt.mulproof · cited by 1
- padicValNat_add_le_selfproof · cited by 0