AFTD Auto-Formalizing Theoretical Domains

propm_sum_ite_mem

lemmaverified

Summing an indicator of K over a superset B gives the sum over K.

Statement

lemma propm_sum_ite_mem {m : ℕ} (B K : Finset (Fin m)) (hK : K ⊆ B) (f : Fin m → ℝ) :
    ∑ e ∈ B, (if e ∈ K then f e else 0) = ∑ e ∈ K, f e
Source
step towards propm_orientation_of_out_degree_two (PROPm orientations, arXiv:2602.18098 v2, Sec. 6)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

/-- Summing an indicator of `K ⊆ B` over `B` gives the sum over `K`. -/lemma propm_sum_ite_mem {m : ℕ} (B K : Finset (Fin m)) (hK : K ⊆ B) (f : Fin m → ℝ) :    ∑ e ∈ B, (if e ∈ K then f e else 0) = ∑ e ∈ K, f e := by  classical  rw [← Finset.sum_filter, Finset.filter_mem_eq_inter, Finset.inter_eq_right.mpr hK]
See it in the graphDiscuss this resultChallenge it