Theorems · Inductive type · order theory

Set.FiniteExhaustion

{α : Type u_1} → Set α → Type u_1

A FiniteExhaustion of a set s is a monotonically increasing sequence of finite sets such that their union is s.

Defined in: Mathlib.Data.Set.FiniteExhaustion
Cited by: 14 results in Mathlib
Foundations: Depth 1 from the axioms · uses no axioms

Mathlib docs Source Loogle LeanSearch

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.

Setstatement · cited by 53,352

Cited by23

Results whose statement or proof uses this declaration.

Set.FiniteExhaustion.toFunstatement and proof · cited by 4
Set.nonempty_finiteExhaustion_iffstatement and proof · cited by 1
Set.Countable.finiteExhaustionstatement · cited by 1
Set.FiniteExhaustion.finitestatement and proof · cited by 1
Set.FiniteExhaustion.finite'statement and proof · cited by 1
Set.FiniteExhaustion.iUnion_eqstatement and proof · cited by 1
Set.FiniteExhaustion.iUnion_eq'statement and proof · cited by 1
Set.FiniteExhaustion.prodstatement and proof · cited by 1
Set.FiniteExhaustion.mk.injstatement · cited by 1
Set.FiniteExhaustion.subset_succ'statement and proof · cited by 1
Set.FiniteExhaustion.mk.noConfusionstatement · cited by 1
Set.FiniteExhaustion.casesOnstatement and proof · cited by 0