Theorems · Theorem · number theory
Nat.nth_le_of_strictMonoOn_of_mapsTo
∀ {p : ℕ → Prop} (f : ℕ → ℕ),
Set.MapsTo f {n | ∀ (hf : (Set.ofPred p).Finite), n < hf.toFinset.card} (Set.ofPred p) →
StrictMonoOn f {n | ∀ (hf : (Set.ofPred p).Finite), n < hf.toFinset.card} → ∀ {n : ℕ}, Nat.nth p n ≤ f nNat.nth p is the least strictly monotone function whose image is contained in
Set.ofPred p
- Defined in
- Mathlib.Data.Nat.Nth
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredstatement and proof · cited by 6,101
- Finset.cardstatement and proof · cited by 2,327
- Set.Finitestatement and proof · cited by 1,814
- Set.MapsTostatement and proof · cited by 732
- Set.Finite.toFinsetstatement and proof · cited by 351
- StrictMonoOnstatement and proof · cited by 194
- Nat.nthstatement and proof · cited by 84
- Nat.strong_induction_onproof · cited by 52
- csInf_leproof · cited by 51
- Finset.sortproof · cited by 42
- Finset.length_sortproof · cited by 6
- List.getD_eq_defaultproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- Nat.eq_nth_of_strictMonoOn_of_mapsTo_of_surjOnproof · cited by 0