Theorems · Definition
Function.sometimes
{α : Sort u_1} → {β : Sort u_2} → [Nonempty β] → (α → β) → βsometimes f evaluates to some value of f, if it exists. This function is especially
interesting in the case where α is a proposition, in which case f is necessarily a
constant function, so that sometimes f = f a for all a.
- Defined in
- Mathlib.Logic.Function.Basic
- Cited by
- 86 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by86
Results whose statement or proof uses this declaration.
- Function.sometimes_specstatement · cited by 84
- IsLindelof.elim_countable_subcoverproof · cited by 10
- IsCompact.disjoint_nhdsSet_leftproof · cited by 6
- HasDerivAt.lhopital_zero_right_on_Iooproof · cited by 5
- MonotoneOn.countable_setOfPred_two_preimagesproof · cited by 5
- MeasureTheory.measure_null_of_locally_nullproof · cited by 5
- Polynomial.splits_iff_exists_multiset'proof · cited by 4
- Set.Countable.isLindelof_biUnionproof · cited by 4
- BoundedVariationOn.tendsto_eVariationOn_Ici_zero_of_filterproof · cited by 3
- Filter.map_atTop_eq_of_gc_preorderproof · cited by 3
- countable_image_lt_image_Ioi_withinproof · cited by 3
- countable_setOfPred_covBy_rightproof · cited by 3