Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Occupant family admissible

Proved
APFB06.occupant_family_admissible

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

apfapf-referencesib-v44-2026-11

B06 at the extensional class gives an actual nonempty occupant with every carried subfamily ledger-admissible, and one serving whole protocol available at a raw input.

Preamble
import Definitions.Def_APFB06_ExtensionalJoint
import Theorems.Thm_APFB06_occupant_subfamily_cost
import Mathlib.Data.ENNReal.Basic

set_option autoImplicit false
open APFPaper1.Source

namespace APFB06
end APFB06
open APFB06
Formal statement
theorem APFB06.occupant_family_admissible
    {Context : Type*} {Raw FullProcess Resource : Context → Type*} {Record : Context → Type*}
    (Cont : (g : Context) → Raw g → FullProcess g → Prop)
    (D : (g : Context) → Set (APFB01.PhysicalState (Cont g) → Bool))
    (protocols : (g : Context) → Set (FullProcess g))
    (maintained : (g : Context) → {p // p ∈ protocols g} → Set (Record g))
    (sufficient : (g : Context) → {p // p ∈ protocols g} → Set (Record g) →
      Task (Cont g) (D g) → Prop)
    (usesToRealize : (g : Context) → {p // p ∈ protocols g} → Task (Cont g) (D g) →
      Set (Record g) → Prop)
    (wholeResource : (g : Context) → {p // p ∈ protocols g} → Resource g)
    (calibration : (g : Context) → Resource g → NNReal)
    (C : Context → NNReal)
    (actualJoint : Set (Sigma fun g => OriginalAlignment (Cont g) (D g)))
    (hB06 : AmendedB06_20260914 Cont D protocols
      (fun g => extensionalJoint (maintained g) (sufficient g) (usesToRealize g))
      wholeResource calibration C actualJoint) :
    ∃ o : Sigma fun g => OriginalAlignment (Cont g) (D g),
      o ∈ actualJoint ∧ o.2.carried.Nonempty ∧
      (∀ S' : Finset (Task (Cont o.1) (D o.1)), S' ⊆ o.2.carried →
        familyAdmissible (wholeResource o.1) (calibration o.1) (maintained o.1) (sufficient o.1)
          (usesToRealize o.1) (C o.1 : ℝ) S') ∧
      ∃ p : {p // p ∈ protocols o.1},
        Serves (maintained o.1) (sufficient o.1) (usesToRealize o.1) p o.2.carried ∧
        ∃ x : Raw o.1, Cont o.1 x p.val := by sorry
Source
Paper 1 Supplement v9.28:1313-1322,1761-1766,1774-1885,2624-2625,2777-2782,7101
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

  • 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