Mathlib Map

Theorems · Theorem · order theory

Set.finite_range_findGreatest

∀ {α : Type u} {P : α → ℕ → Prop} [inst : (x : α) → DecidablePred (P x)] {b : ℕ},
  (Set.range fun x => Nat.findGreatest (P x) b).Finite
Defined in
Mathlib.Data.Set.Finite.Basic
Cited by
0 results in Mathlib
Foundations
Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidablePred
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Set.range · cited by 4705Set.rangeSet.Finite · cited by 1814Set.FiniteSet.Finite.subset · cited by 285Finite.subsetSet.range_subset_iff · cited by 99Set.range_subset_iffNat.findGreatest · cited by 25Nat.findGreatestSet.finite_le_nat · cited by 16Set.finite_le_natNat.findGreatest_le · cited by 7Nat.findGreatest_leSet.finite_range_findGreatestCITED BYCITES

Cites7

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.