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)
27@[simp] theorem reduce_correct (A : ConstraintInstance) :
28 Recognizes A ↔ VertexCover.HasCover (reduceRS2VC A) := Iff.rfl
proof body
Term-mode proof.
29
30/-- Polynomial bound predicate: f(n) ≤ c·n^k for some c,k -/
depends on (8)
Lean names referenced from this declaration's body.
-
ConstraintInstance
in IndisputableMonolith.Complexity.RSVC
decl_use
-
Recognizes
in IndisputableMonolith.Complexity.RSVC
decl_use
-
reduceRS2VC
in IndisputableMonolith.Complexity.RSVC
decl_use
-
HasCover
in IndisputableMonolith.Complexity.VertexCover
decl_use
-
A
in IndisputableMonolith.Foundation.IntegrationGap
decl_use
-
for
in IndisputableMonolith.Foundation.UniversalForcingSelfReference
decl_use
-
A
in IndisputableMonolith.Masses.Anchor
decl_use
-
A
in IndisputableMonolith.Modal.Actualization
decl_use