Theorems · Theorem · number theory
padicValRat.mul
∀ {p : ℕ} [hp : Fact (Nat.Prime p)] {q r : ℚ}, q ≠ 0 → r ≠ 0 → padicValRat p (q * r) = padicValRat p q + padicValRat p rA rewrite lemma for padicValRat p (q * r) with conditions q ≠ 0, r ≠ 0.
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 78 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.
Cites14
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_addproof · cited by 586
- Fact.outproof · cited by 328
- Nat.cast_mulproof · cited by 309
- Primeproof · cited by 277
- mul_ne_zeroproof · cited by 178
- multiplicityproof · cited by 117
- padicValRatstatement and proof · cited by 49
- Nat.prime_iff_prime_intproof · cited by 27
- multiplicity_mulproof · cited by 5
- Rat.mkRat_eq_divIntproof · cited by 4
Cited by5
Results whose statement or proof uses this declaration.
- padicValNat.mulproof · cited by 6
- padicValRat.invproof · cited by 5
- padicValRat.powproof · cited by 4
- padicNorm.mulproof · cited by 2
- padicValRat.divproof · cited by 0