pith. machine review for the scientific record. sign in
theorem proved term proof

primeCounting_mono

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 402theorem primeCounting_mono {m n : ℕ} (h : m ≤ n) : primeCounting m ≤ primeCounting n := by

proof body

Term-mode proof.

 403  simp only [primeCounting]
 404  exact Nat.monotone_primeCounting h
 405
 406/-! ### Liouville-squarefree connection -/
 407
 408/-- For squarefree n, λ(n) = μ(n). -/

depends on (1)

Lean names referenced from this declaration's body.