LoF records support control exactly when each allowed cell has a common successful response
ProvedAPFLoFAshby.RecordControl.policy_iffFix any state space, Boolean readings of its variables, a finite family of LoF expressions, and a set of successful responses for each state. A policy depending only on the recorded values of those expressions succeeds at every state if and only if, for each attained record profile, one response succeeds on every potential state allowed by those same records. The proof identifies the allowed set with the observation fiber and applies the existing attained-fiber control theorem. Only attained profiles are quantified over; no independence of variables or nonemptiness of the state/response spaces is assumed. This is a mathematical existence criterion using classical choice. It does not assert that a physical protocol realizes the policy, that a B06 occupant exists, or any resource bound.
import Definitions.Def_APFLoFAshby_RecordControl import Theorems.Thm_APFControlCriterion_attained_fiber_policy_iff
theorem APFLoFAshby.RecordControl.policy_iff {X R : Type} {n : Nat}
(r : Nat → X → Bool) (F : Fin n → LawsOfForm.Expr) (W : X → Set R) :
APFControlCriterion.HasPolicy (APFLoFAshby.RecordControl.observe r F) W ↔
∀ m : APFControlCriterion.Attained (APFLoFAshby.RecordControl.observe r F),
∃ response : R, ∀ x ∈ APFLoFAshby.RecordControl.cell r F m.val, response ∈ W x := by sorry