Mathlib Map

Theorems · Definition · combinatorics

Finset.piecewise

{ι : Type u_1} →
  {π : ι → Sort u_2} →
    (s : Finset ι) → ((i : ι) → π i) → ((i : ι) → π i) → [(j : ι) → Decidable (j ∈ s)] → (i : ι) → π i

s.piecewise f g is the function equal to f on the finset s, and to g on its complement.

Defined in
Mathlib.Data.Finset.Piecewise
Cited by
64 results in Mathlib
Foundations
Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Decidable

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites1

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

  • Finsetstatement and proof · cited by 13,712

Cited by65

Results whose statement or proof uses this declaration.