Theorems · Theorem · number theory
Nat.eq_of_factorization_eq
∀ {a b : ℕ}, a ≠ 0 → b ≠ 0 → (∀ (p : ℕ), a.factorization p = b.factorization p) → a = b- Defined in
- Mathlib.Data.Nat.Factorization.Defs
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsuppstatement · cited by 5,255
- Nat.factorizationstatement and proof · cited by 215
- Nat.primeFactorsList_count_eqproof · cited by 11
- Nat.eq_of_perm_primeFactorsListproof · cited by 1
Cited by7
Results whose statement or proof uses this declaration.
- Nat.ordCompl_self_powproof · cited by 1
- IsPrimePow.exists_ordCompl_eq_oneproof · cited by 1
- Nat.eq_of_factorization_eq'proof · cited by 1
- Nat.exists_eq_pow_of_exponent_coprime_of_pow_eq_powproof · cited by 1
- Nat.factorization_injproof · cited by 0
- Nat.Squarefree.ext_iffproof · cited by 0
- Nat.eq_iff_prime_padicValNat_eqproof · cited by 0