Mathlib Map

Theorems · Theorem · order theory

Set.biUnion_accumulate

∀ {α : Type u_1} {β : Type u_2} {s : α → Set β} [inst : Preorder α] (x : α),
  ⋃ y, ⋃ (_ : y ≤ x), Set.accumulate s y = ⋃ y, ⋃ (_ : y ≤ x), s y
Defined in
Mathlib.Order.SetAccumulate
Cited by
0 results in Mathlib
Foundations
Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Preorder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Set · cited by 53352SetPreorder · cited by 7952PreorderSet.iUnion · cited by 2483Set.iUnionSet.Subset.antisymm · cited by 213Subset.antisymmSet.iUnion₂_subset · cited by 48Set.iUnion₂_subsetSet.accumulate · cited by 32Set.accumulateSet.iUnion₂_mono · cited by 21Set.iUnion₂_monoSet.monotone_accumulate · cited by 10Set.monotone_accumulateSet.subset_accumulate · cited by 3Set.subset_accumulateSet.biUnion_accumulateCITED BYCITES

Cites9

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.