Theorems · Theorem · commutative algebra
FractionalIdeal.count.congr_simp
∀ {R : Type u_1} [inst : CommRing R] (K : Type u_2) [inst_1 : Field K] [inst_2 : Algebra R K]
[inst_3 : IsFractionRing R K] [inst_4 : IsDedekindDomain R] (v v_1 : IsDedekindDomain.HeightOneSpectrum R),
v = v_1 →
∀ (I I_1 : FractionalIdeal (nonZeroDivisors R) K),
I = I_1 → FractionalIdeal.count K v I = FractionalIdeal.count K v_1 I_1- Cited by
- 2 results in Mathlib
- Foundations
- Depth 149 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CommRingstatement and proof · cited by 17,173
- Algebrastatement and proof · cited by 11,388
- Fieldstatement and proof · cited by 7,404
- nonZeroDivisorsstatement and proof · cited by 895
- IsFractionRingstatement and proof · cited by 738
- IsDedekindDomainstatement and proof · cited by 668
- FractionalIdealstatement and proof · cited by 423
- IsDedekindDomain.HeightOneSpectrumstatement and proof · cited by 338
- FractionalIdeal.countstatement and proof · cited by 25
Cited by2
Results whose statement or proof uses this declaration.
- FractionalIdeal.count_coe_nonnegproof · cited by 1
- FractionalIdeal.finite_factorsproof · cited by 0