Theorems · Theorem · general algebraic systems
Finsupp.mk.congr_simp
∀ {α : Type u_9} {M : Type u_10} [inst : Zero M] (support support_1 : Finset α) (e_support : support = support_1)
(toFun toFun_1 : α → M) (e_toFun : toFun = toFun_1) (mem_support_toFun : ∀ (a : α), a ∈ support ↔ toFun a ≠ 0),
{ support := support, toFun := toFun, mem_support_toFun := mem_support_toFun } =
{ support := support_1, toFun := toFun_1, mem_support_toFun := ⋯ }- Defined in
- Mathlib.Data.Finsupp.Defs
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Zero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by9
Results whose statement or proof uses this declaration.
- Nat.factorization_zeroproof · cited by 32
- Nat.primeFactorsList_count_eqproof · cited by 11
- Nat.factorization_oneproof · cited by 10
- Finsupp.comapDomain_single_of_not_mem_rangeproof · cited by 6
- SpecialLinearGroup.mem_center_iffproof · cited by 2
- Finset.mem_finsuppAntidiagproof · cited by 2
- FirstOrder.Ring.lift_genericPolyMapproof · cited by 2
- MvPolynomial.prod_X_powproof · cited by 1
- Finset.finsuppAntidiag_zeroproof · cited by 0