Theorems · Theorem · number theory
NNRat.num_mul_num_eq_num_mul_gcd
∀ (q₁ q₂ : ℚ≥0), q₁.num * q₂.num = (q₁ * q₂).num * (q₁.num * q₂.num).gcd (q₁.den * q₂.den)
A version of NNRat.mul_num without division.
- Defined in
- Mathlib.Data.NNRat.Lemmas
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- NNRatstatement and proof · cited by 523
- Nat.cast_mulproof · cited by 309
- NNRat.castproof · cited by 235
- NNRat.numstatement and proof · cited by 53
- NNRat.denstatement and proof · cited by 51
- NNRat.num_coeproof · cited by 14
- Rat.num_mul_num_eq_num_mul_gcdproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.