Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Candidate separation by the distinction family

Definition
APFB02_ToldApart

by FiniteUniverse · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v52-2026-11

ToldApart says equality of every distinction reading implies equality of continuation profiles.

Meaning and scope

Unadopted named predicate. It concludes continuation equality, not equality of arbitrary raw representatives. B01 quotient equality follows only with the correct original profile binding.

Status: conditional reference mathematics. The supplied predicates and model assumptions are not additional Foundation inputs. These records do not establish K1, K3 or K4 closure.

Definition code
/-
APF Foundation Ledger — definition node DRAFT (session EthanBrooke-01WrrBvu, 2026-11-14; not gated, not reviewed)
name: APFB02_ToldApart
title: The statement that a region's distinctions tell its states apart
inputs_revision: 2026-11-14.1
revision_note: a named clause on the author's statement of 2026-11-14 03:12 HST. It is NOT in the inputs at
 revision 2026-11-14.1.
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author's statement of 2026-11-14 03:12 HST ("This is next - region's distinctions tell its states
 apart. It's true."). FOUNDATION_INPUTS B01 (a physical state is a class of raw states with one continuation
 profile) and B02 ("A distinction is a finite, enforceable separator of continuation profiles"), unchanged.
standing: a named clause of the K layer, typed so that it can be tested. It is not one of the eight declared
 inputs.
statement: ToldApart Cont reads says: two raw states that every distinction reads alike have the same
 continuation profile. By B01 they are then one physical state.
-/
import Mathlib.Logic.Basic

set_option autoImplicit false
namespace APFB02

/-- States that no distinction tells apart have the same continuation profile. -/
def ToldApart {X Q D : Type*} (Cont : X → Q → Prop) (reads : D → X → Bool) : Prop :=
  ∀ x y : X, (∀ d : D, reads d x = reads d y) → Cont x = Cont y

end APFB02
Source
Definitions/Def_APFB02_ToldApart.lean; Sib v52 / pullbacks v6; SHA-256 b965aaaf22fd2484c4af4fb565c0f3e63d2e1592b784fc880854c989a24689c8. Papers/Paper 01 - The Enforceability of Distinction/Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex; lines 1224-1243,1276-1332,1741-1771,1833-1885,2601-2680; APF Reference Docs/APF Reconstruction Spine/FOUNDATION_INPUTS.json; revision 2026-11-14.1; input B02; source/Definitions/Def_APFB02_ToldApart.lean
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me