Foundation Primitive Recognition Calculus Prccategory Theory Parse Top Ne Bot

The two truth values

In classical logic, the statements "true" and "false" are different. This seems obvious, but a formal system can collapse them: if a system treats them as the same, then every statement becomes both true and false, and the system is degenerate. The declaration top_ne_bot is a machine-checked proof that, in the framework's foundational logic, the two truth values are distinct. It is a theorem, not an assumption, and it is proved from the definition of truth itself.

The proof is short. The framework defines truth as the proposition that holds, and falsity as the proposition that does not. If they were equal, then any true statement would also be false. The proof assumes they are equal, derives that a true statement is false, and concludes the assumption is impossible. This is a standard argument, but its significance is structural: it guarantees the logic is not trivial.

In the framework's recognition calculus, where reality keeps a discrete record of events, this distinction is foundational. The framework models a formal system whose tokens are truth values, and whose discrimination relation is their inequality. The theorem top_ne_bot is what makes this system expressive: it can tell two things apart. Without it, the system could not even distinguish a yes from a no, and no meaningful recognition could occur.

The theorem also connects to category theory. In the topos of sets, the subobject classifier is the type of truth values, with two global points: truth and falsity. The theorem that these are distinct is the non-degeneracy condition for a topos. The framework proves that this categorical structure embeds its core recognition calculus, and that this embedding is what guarantees the system is not degenerate.

What the theorem does not claim is broader. It does not claim that the framework's logic is the only possible logic, nor that truth and falsity are distinct in every conceivable system. It does not claim that the framework's recognition calculus is the only way to model reality. It is a precise, narrow result: within the framework's foundational logic, the two truth values are distinct, and this distinction is what makes the system capable of expressing a difference.

/-- **Non-degeneracy.** The two truth values are distinct: ⊤ ≠ ⊥. A topos with
⊤ = ⊥ is degenerate (the terminal category, where 0 ≅ 1). -/
theorem top_ne_bot : (True : Omega) ≠ False := by
  intro h
  rw [eq_iff_iff] at h
  exact h.mp trivial

theorem toposSystem_expressive : toposSystem.Expressive := by
  show (True : Omega) ≠ False
  exact top_ne_bot

/-- **The categorical foundation contains the δ core.** -/
theorem toposSystem_embeds_delta : Nonempty (PRCEmbeddingInto toposSystem) :=
  FormalSystemEmbeddingTarget_proved toposSystem toposSystem_expressive

theorem toposSystem_not_degenerate : ¬ DistinctionDichotomy.Degenerate toposSystem :=
  DistinctionDichotomy.not_degenerate_of_realizesDelta toposSystem toposSystem_embeds_delta

What this page does not claim

This theorem does not claim that truth and falsity are distinct in every possible logical system. It does not claim that the framework's recognition calculus is the only way to model reality.

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/PRCCategoryTheoryParse.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: