Theorems · Theorem · combinatorics

SimpleGraph.interedges_biUnion_right

∀ {ι : Type u_2} {α : Type u_4} (G : SimpleGraph α) [inst : DecidableRel G.Adj] [inst_1 : DecidableEq α] (s : Finset α)
  (t : Finset ι) (f : ι → Finset α), G.interedges s (t.biUnion f) = t.biUnion fun b => G.interedges s (f b)

Defined in: Mathlib.Combinatorics.SimpleGraph.Density
Cited by: 0 results in Mathlib
Foundations: Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: DecidableRel DecidableEq

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites6

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
SimpleGraphstatement and proof · cited by 3,072
SimpleGraph.Adjstatement and proof · cited by 1,346
Finset.biUnionstatement · cited by 217
SimpleGraph.interedgesstatement · cited by 23
Rel.interedges_biUnion_rightproof · cited by 3

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.