recognition / Foundation / Foundation.UniversalForcing.ModularRealization / modular_arithmetic_invariant

def

`modular_arithmetic_invariant`

definition

show as: view math explainer →

module: IndisputableMonolith.Foundation.UniversalForcing.ModularRealization
domain: Foundation
line: 82 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Foundation.UniversalForcing.ModularRealization on GitHub at line 82.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

depends on

used by

modular_arithmetic_invariant IndisputableMonolith.Foundation.ModularLogicRealization

formal source

  79    simp [zmodCost, hne]
  80
  81/-- Modular realization carries the universal forced arithmetic. -/
  82noncomputable def modular_arithmetic_invariant (n : ℕ) [Fact (1 < n)]
  83    (R : LogicRealization.{0, 0}) :
  84    (arithmeticOf (modularRealization n)).peano.carrier
  85      ≃ (arithmeticOf R).peano.carrier :=
  86  ArithmeticOf.equivOfInitial (arithmeticOf (modularRealization n)) (arithmeticOf R)
  87
  88end ModularRealization
  89end UniversalForcing
  90end Foundation
  91end IndisputableMonolith

papers checked against this theorem

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