Theorems · Theorem · number theory
Nat.find_min
∀ {p : ℕ → Prop} [inst : DecidablePred p] (H : ∃ n, p n) {m : ℕ}, m < Nat.find H → ¬p m- Defined in
- Mathlib.Data.Nat.Find
- Cited by
- 30 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses no axioms
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by30
Results whose statement or proof uses this declaration.
- Nat.find_min'proof · cited by 28
- CharP.existsproof · cited by 16
- pow_dvd_of_le_emultiplicityproof · cited by 8
- Nat.notMem_of_lt_sInfproof · cited by 4
- Ideal.ramificationIdx'_ne_one_iffproof · cited by 4
- LieModule.genWeightSpace_nsmul_add_ne_bot_of_leproof · cited by 3
- Ideal.exists_mul_mem_of_mem_minimalPrimesproof · cited by 2
- Nat.exists_not_and_succ_of_not_zero_of_existsproof · cited by 2
- exists_nat_pow_nearproof · cited by 2
- PiNat.inter_cylinder_longestPrefix_nonemptyproof · cited by 2
- WittVector.verschiebung_nonzeroproof · cited by 2
- Nat.find_comp_succproof · cited by 2