`mathlibNNOCert_holds`

proved

show as: view math explainer →

module: IndisputableMonolith.Foundation.UniversalForcing.Strict.MathlibNNO
domain: Foundation
line: 48 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Foundation.UniversalForcing.Strict.MathlibNNO on GitHub at line 48.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

depends on

formal source

  45      g LogicNat.zero = base → (∀ n, g (LogicNat.succ n) = step (g n)) →
  46      f = g
  47
  48theorem mathlibNNOCert_holds : MathlibNNOCert :=
  49{ exists_rec := logicNat_has_type_NNO_universal_property
  50  unique_rec := logicNat_NNO_uniqueness }
  51
  52end
  53
  54end IndisputableMonolith.Foundation.UniversalForcing.Strict.MathlibNNO

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.