English
StepBound is defined by stepBound(n) = n · 4^n.
Русский
StepBound определяется как stepBound(n) = n · 4^n.
LaTeX
$$$\\mathrm{stepBound}(n) = n \\cdot 4^n$$$
Lean4
/-- Pretty printer defined by `notation3` command. -/
@[local delab✝ app.HDiv.hDiv]
public meta def
_aux_Mathlib_Combinatorics_SimpleGraph_Regularity_Bound___delab_app__private_Mathlib_Combinatorics_SimpleGraph_Regularity_Bound_0_termM_1 :
Delab✝ :=
whenPPOption✝ getPPNotation✝ <|
whenNotPPOption✝ getPPExplicit✝ <|
withOverApp✝ 6
(getExpr✝ >>= fun e✝ =>
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `HDiv.hDiv)) (matchExpr✝ (Expr.isConstOf✝ · `Nat)))
(matchExpr✝ (Expr.isConstOf✝ · `Nat)))
(matchExpr✝ (Expr.isConstOf✝ · `Nat)))
pure✝)
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Fintype.card)) (matchFVar✝ `α (matchExpr✝ isType'✝)))
pure✝))
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `SzemerediRegularity.stepBound))
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset.card))
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset)) (matchFVar✝ `α (matchExpr✝ isType'✝))))
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finpartition.parts))
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset))
(matchFVar✝ `α (matchExpr✝ isType'✝))))
pure✝)
pure✝)
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset.univ))
(matchFVar✝ `α (matchExpr✝ isType'✝)))
pure✝))
(matchFVar✝ `P
(matchApp✝
(matchApp✝
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finpartition))
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset))
(matchFVar✝ `α (matchExpr✝ isType'✝))))
pure✝)
pure✝)
(matchApp✝
(matchApp✝ (matchExpr✝ (Expr.isConstOf✝ · `Finset.univ))
(matchFVar✝ `α (matchExpr✝ isType'✝)))
pure✝)))))) >=>
pure✝)
MatchState.empty✝ >>=
fun s✝ => withHeadRefIfTagAppFns✝ `(m))
