Theorems · Theorem · general topology
AddCircle.gcd_mul_addOrderOf_div_eq
∀ {𝕜 : Type u_1} [inst : Field 𝕜] (p : 𝕜) [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [hp : Fact (0 < p)] {n : ℕ}
(m : ℕ), 0 < n → m.gcd n * addOrderOf ↑(↑m / ↑n * p) = n- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Fieldstatement and proof · cited by 7,404
- AddSubgroupstatement · cited by 3,232
- Factstatement and proof · cited by 2,726
- IsStrictOrderedRingstatement and proof · cited by 2,490
- HasQuotient.Quotientstatement and proof · cited by 2,301
- AddSubgroup.zmultiplesstatement and proof · cited by 493
- QuotientAddGroup.mkstatement and proof · cited by 348
- addOrderOfstatement and proof · cited by 208
- addOrderOf_pos_iffproof · cited by 10
- IsOfFinAddOrder.addOrderOf_nsmulproof · cited by 3
- AddCircle.addOrderOf_period_divproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- AddCircle.addOrderOf_div_of_gcd_eq_oneproof · cited by 4
- AddCircle.addOrderOf_eq_pos_iffproof · cited by 2
- AddCircle.nsmul_eq_zero_iffproof · cited by 1