Theorems · Theorem · commutative algebra
EuclideanDomain.dvd_gcd
- #69 of the 100 theorems: Greatest Common Divisor Algorithm
∀ {R : Type u} [inst : EuclideanDomain R] [inst_1 : DecidableEq R] {a b c : R},
c ∣ a → c ∣ b → c ∣ EuclideanDomain.gcd a b- Defined in
- Mathlib.Algebra.EuclideanDomain.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- EuclideanDomainDecidableEq
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.
- EuclideanDomainstatement and proof · cited by 124
- EuclideanDomain.gcdstatement and proof · cited by 39
- EuclideanDomain.gcd_zero_leftproof · cited by 7
- EuclideanDomain.gcd_valproof · cited by 5
- EuclideanDomain.GCD.inductionproof · cited by 5
- EuclideanDomain.dvd_mod_iffproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Int.natAbs_euclideanDomain_gcdproof · cited by 0
- EuclideanDomain.gcdMonoidproof · cited by 0