Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three-state model with one reading

Definition
APFPaper5_Worlds_OneDistinction

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

apfapf-referencesib-v52-2026-11

Defines the singleton distinction domain, trivial sufficiency/use relations and old-eight predicate on three raw states.

Meaning and scope

Only supplied finite data and the stated Lean predicates are established. EightHold uses the old B02 predicate; revised B02 is checked separately. The B06 distinction domain/actualJoint are existentially chosen, its serving relation is Set.univ, and A2/BW admission is a singleton with constant price. No consistency or independence of the original physical inputs, actual admissibility, occupancy or admitted dynamics is certified. Support novelty is impossible in this model, so its B05 implication is vacuous.

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: APFPaper5_Worlds_OneDistinction
title: A supplied world on three raw states with a single distinction, on the protocol and bill of the two-object worlds
inputs_revision: 2026-11-14.1
revision_note: EightHoldOnN is built from the declared Lean forms as they stood at FOUNDATION_INPUTS revision 2026-10-04.1.
 The sentence added to B02 at revision 2026-11-14.1 is not part of it and is proved of World N separately
 (world_N_meets_B02_r2, Thm_APFB02_r2_checks).
mathlib_rev: 0df444a360eaa60ab8c11dca51a86af692955474
source: the author's statement of 2026-11-14 03:12 HST. Def_APFPaper5_Worlds_TwoObjects (protocol, record and
 bill taken from it unchanged). Def_APFPaper5_Worlds_ThreeObjects (dLow, contT). The eight declared forms,
 unchanged.
standing: supplied data for a test world. Nothing here is a physical claim.
statement: raw states 0, 1, 2. The one distinction is dLow, true at 1 and 2. One protocol, bill 1.
 EightHoldOnN states the eight declared forms on this data with one continuation relation, capacity 2 and
 floor 1, the occupant at state 2.
-/
import Definitions.Def_APFPaper5_Worlds_TwoObjects
import Definitions.Def_APFPaper5_Worlds_ThreeObjects

set_option autoImplicit false
namespace APFPaper5.Worlds

/-- The distinctions: dLow only. -/
abbrev DistN : Type := {d : Fin 3 → Bool // d = dLow}

instance : DecidableEq DistN := fun a b => isTrue (Subtype.ext (a.2.trans b.2.symm))

def suffN (_ : Unit) (_ : Proto) (_ : Set Unit) (_ : DistN) : Prop := True

def usesN (_ : Unit) (_ : Proto) (_ : DistN) (_ : Set Unit) : Prop := True

/-- The eight declared forms on the supplied data, sharing one continuation relation. -/
def EightHoldOnN (Cont : Fin 3 → List Bool → Prop) : Prop :=
  APF_B01_DeclaredInput Cont
      (fun (f : APFB01.PhysicalState Cont → Prop) (x : Fin 3) => f (APFB01.physicalClass Cont x))
      (fun (f : APFB01.PhysicalState Cont → Prop) (x : Fin 3) => f (APFB01.physicalClass Cont x))
      (fun (f : APFB01.PhysicalState Cont → Prop) (x : Fin 3) => f (APFB01.physicalClass Cont x))
      (fun (f : APFB01.PhysicalState Cont → Prop) (x : Fin 3) => f (APFB01.physicalClass Cont x)) ∧
    APFB02.B02SourceMeaning (Context := Unit) (X := fun _ => Fin 3) (Q := fun _ => List Bool)
      (P := fun _ => Proto) (Record := fun _ => Unit)
      (fun _ => Cont) (fun _ d => d = dLow) maint suffN usesN ∧
    APFB03.B03TaskCost (Context := Unit) (D := fun _ => DistN) (P := fun _ => Proto)
      (R := fun _ => Unit) (Record := fun _ => Unit) wholeRes calib maint suffN usesN ∧
    APFB04.B04FiniteCapacity (Context := Unit) (fun _ => (2 : ℝ)) ∧
    APFB05.MarginalFloor (Context := Unit) (D := fun _ => DistN) (P := fun _ => Proto)
      (R := fun _ => Unit) (Record := fun _ => Unit) wholeRes calib maint suffN usesN
      (fun _ _ => True) (fun _ => 2) (fun _ => 1) ∧
    (∃ (D : Unit → Set (APFB01.PhysicalState Cont → Bool))
        (actualJoint : Set (Sigma fun g : Unit => APFB06.OriginalAlignment Cont (D g))),
      APFB06.AmendedB06_20260914 (Context := Unit) (Raw := fun _ => Fin 3)
        (FullProcess := fun _ => List Bool) (Resource := fun _ => Unit)
        (fun _ => Cont) D (fun _ => ({[true]} : Set (List Bool))) (fun _ _ => Set.univ)
        wholeRes calib (fun _ => (2 : NNReal)) actualJoint) ∧
    APFB07a.A2Selection (Interface := Unit) (Configuration := fun _ => APFB01.PhysicalState Cont)
      (fun _ s => s = APFB01.physicalClass Cont 2) (fun _ _ => (1 : ℝ))
      (fun _ => APFB01.physicalClass Cont 2) ∧
    APFB07b.BWUniqueMinimum (Interface := Unit)
      (Configuration := fun _ => APFB01.PhysicalState Cont)
      (fun _ s => s = APFB01.physicalClass Cont 2) (fun _ _ => (1 : ℝ))

end APFPaper5.Worlds
Source
Definitions/Def_APFPaper5_Worlds_OneDistinction.lean; Sib v52 / pullbacks v6; SHA-256 b61620804f0231d679727171be664b1c38c7b2209e4088a8db96650559ebf8c9. 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_APFPaper5_Worlds_OneDistinction.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