Foundation Primitive Recognition Calculus Prcinevitability Instances Set Foundat

The set-theoretic witness

The declaration setFoundationSystem_embeds_delta is a machine-checked proof that a particular formal system, built from the empty set and the universal set on a one-point domain, contains a copy of the minimal recognition calculus. The recognition calculus, a discrete record of events where each step distinguishes one token from another, is the framework's basic substrate. The proof shows that the set-theoretic distinction between ∅ and the full set, the same separation that starts the von Neumann hierarchy of ordinals, already realizes this core.

The construction is deliberately minimal. The formal system takes the empty set as one token and the universal set as another, and declares that two expressions are distinguished exactly when they are not equal. The proof then verifies that this system is expressive: it can tell the two endpoints apart. From that single fact, a general theorem supplies the embedding. The same argument works for any type with two distinct elements, which is why the set-theoretic instance is one of four structurally different foundations, alongside the logical carrier with true and false, the arithmetic system with 0 and 1, and the type-theoretic two-element type, that all realize the same delta core.

The declaration does not claim that set theory, as usually written down, is fully captured by this construction. The docstring is explicit that these are honest small witnesses, not full faithful parses of the foundations. The embedding shows that the primitive distinction is not an artifact of one notation, but it does not formalize the axioms of Zermelo-Fraenkel set theory, the axiom of choice, or the cumulative hierarchy beyond its first step. What the proof establishes is narrower and precise: wherever two primitives can be told apart, the recognition calculus is already present.

This matters because it locates the framework's starting point. The recognition calculus does not need to be imposed on a foundation from outside; it emerges from the mere ability to distinguish. The set-theoretic witness shows that the distinction is not a quirk of Boolean logic or arithmetic, but a structural feature of any system with two distinct objects. The proof is one of four parallel witnesses, and together they show the delta core is universal across the standard foundations.

theorem setFoundationSystem_embeds_delta :
    Nonempty (PRCEmbeddingInto setFoundationSystem) :=
  two_distinct_realizes_delta (∅ : Set Unit) Set.univ Set.empty_ne_univ

/-- **Item 4 (generic).** Any foundation exposing two distinguishable primitives
realizes the δ core. -/
theorem two_distinct_realizes_delta {α : Type} (a₀ a₁ : α) (hne : a₀ ≠ a₁) :
    Nonempty (PRCEmbeddingInto (ofTwoDistinct a₀ a₁ hne)) :=
  FormalSystemEmbeddingTarget_proved _ (ofTwoDistinct_expressive a₀ a₁ hne)

/-- **Item 4, widened.** Four structurally different foundations, the logical
two-valued carrier, the arithmetic `0 ≠ 1`, the set-theoretic `∅ ≠ {∅}`, and the
type-theoretic `𝟚`, each realize the δ core. The primitive distinction is not an
artifact of one foundation's notation; it appears wherever two primitives can be
told apart. -/
theorem named_foundations_embed_delta :
    Nonempty (PRCEmbeddingInto boolLogicSystem)
      ∧ Nonempty (PRCEmbeddingInto peanoSystem)
      ∧ Nonempty (PRCEmbeddingInto setFoundationSystem)
      ∧ Nonempty (PRCEmbeddingInto typeTheorySystem) :=
  ⟨boolLogicSystem_embeds_delta, peanoSystem_embeds_delta,
    setFoundationSystem_embeds_delta, typeTheorySystem_embeds_delta⟩

What this page does not claim

The declaration does not formalize the axioms of Zermelo-Fraenkel set theory or the cumulative hierarchy beyond its first step. The proof does not show that set theory, as usually written down, is fully captured by the recognition calculus. The embedding does not establish that the recognition calculus is the unique foundation for set theory.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: