Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

If the truth of a Boolean reading descends, two raw states with equal profiles have equal readings

Proved
APFB01.read_eq_of_descends

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

apffoundation-ledgersib-v44-2026-11

If the truth of a Boolean reading descends, two raw states with equal profiles have equal readings.

Preamble
import Definitions.Def_APF_B01_DeclaredInput

set_option autoImplicit false
universe uX uP uF uR uO uA uM

namespace APFB01
end APFB01
open APFB01
Formal statement
theorem APFB01.read_eq_of_descends {X : Type uX} {Process : Type uP}
    (profile : X → Process → Prop) (read : X → Bool)
    (hd : Descends profile (fun x => read x = true))
    (x y : X) (hxy : profile x = profile y) : read x = read y := by sorry
Source
Paper 1 Supplement v9.28:1313-1322,1761-1766,1774-1885,2624-2625,2777-2782,7101

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