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

operative_to_laws_of_logic

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)

  64theorem operative_to_laws_of_logic
  65    (C : ComparisonOperator)
  66    (hOp : OperativePositiveRatioComparison C)
  67    (hFinite : FinitePairwisePolynomialClosure C) :
  68    SatisfiesLawsOfLogic C where
  69  identity := hOp.identity

proof body

Term-mode proof.

  70  non_contradiction := hOp.non_contradiction
  71  excluded_middle := hOp.continuous
  72  scale_invariant := hOp.scale_invariant
  73  route_independence := hFinite
  74  non_trivial := hOp.non_trivial
  75
  76/-- **RCL as the finite pairwise polynomial algebra of positive-ratio comparison.**
  77
  78Any operative positive-ratio comparison with finite pairwise polynomial
  79closure has a derived cost satisfying the Recognition Composition Law family.
  80This theorem uses the existing d'Alembert inevitability theorem, since its
  81hypothesis is the broader polynomial-degree-two closure condition.
  82-/

used by (4)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (23)

Lean names referenced from this declaration's body.