Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.16 — min(D ∨ ¬Elsewhere(Δ)) is the ≾-minimal solution when D is ≤c-minimal

Proved
BiAbduction.Systematic.lemma_3_16

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

abductionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1separation-logic

Let Δ\DeltaΔ and HHH be predicates and consider the abduction question Δ∗M⊨H\Delta*M\models HΔ∗M⊨H. Let DDD be a minimal solution w.r.t. the compatible preorder ≤c\le_c≤c​: Δ∗D⊨H\Delta*D\models HΔ∗D⊨H, and D≤cFD\le_c FD≤c​F for every predicate FFF with Δ∗F⊨H\Delta*F\models HΔ∗F⊨H. Then

min⁡(D∨¬Elsewhere(Δ))\min\big(D\vee\neg\mathrm{Elsewhere}(\Delta)\big)min(D∨¬Elsewhere(Δ))

is the minimal solution w.r.t. ≾\precsim≾: it is a solution, and it is ≾\precsim≾-below every solution M′M'M′ (every predicate with Δ∗M′⊨H\Delta*M'\models HΔ∗M′⊨H).

This lemma reduces the computation of the best solution to three phases: a ≤c\le_c≤c​-minimal solution, the incompatible solutions ¬Elsewhere(Δ)\neg\mathrm{Elsewhere}(\Delta)¬Elsewhere(Δ), and min⁡\minmin.

Formalization Note The page states the lemma for the symbolic heaps Δ\DeltaΔ, HHH of (5); its proof uses no syntax, and the statement here holds for arbitrary predicates Δ\DeltaΔ, HHH, DDD, which includes the page's case.

Preamble
import Mathlib
import Definitions.Def_BiAbduction_Systematic_Semantics
Formal statement
namespace BiAbduction.Systematic

/-- Lemma 3.16 (p. 27). If `D` is a minimal solution of `Δ ∗ ? ⊨ H` w.r.t. `≤c`, then
`min(D ∨ ¬Elsewhere(Δ))` is the minimal solution w.r.t. `≾`. -/
theorem lemma_3_16 (Δ H D : Pred) (hD : IsCompatMinSolution Δ H D) :
    IsLeastSolution Δ H (minSet (D ∪ (Elsewhere Δ)ᶜ)) := by sorry

end BiAbduction.Systematic
Source
Calcagno, Distefano, O'Hearn, Yang, Compositional Shape Analysis by means of Bi-Abduction, J. ACM (2011), p. 27, Lemma 3.16
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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