A superset of a quorum is a quorum
ProvedOpenSearchCoordination.quorum_monoFor every voting configuration c and lists of node ids a and b such that every element of a occurs in b: if c.hasQuorum a = true then c.hasQuorum b = true. Adding votes never destroys a quorum.
import Definitions.Def_OpenSearchCoordination
theorem OpenSearchCoordination.quorum_mono (c : VotingConfiguration) (a b : List NodeId) (hab : ∀ x, x ∈ a → x ∈ b)
(ha : c.hasQuorum a = true) : c.hasQuorum b = true := by sorryRead-back
What the Lean code literally says, in plain math · claude-opus-5-5 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: OpenSearchCoordination.quorum_mono
Notions used
Voting configurations. A voting configuration is a strictly increasing, hence duplicate-free, list of natural numbers (node ids). It stands for a finite set .
Quorum test. For a list of naturals:
that is, , a strict majority of . Membership is tested with List.contains on ℕ, which agrees with .
1. Declaration
Binders.
- : a voting configuration;
- : lists of natural numbers.
Hypotheses, in order.
- : . Every id occurring in occurs in . This is inclusion of the underlying sets, not a sublist or multiset relation.
- : .
Conclusion. .
2. What is not constrained
- may contain any extra ids, inside or outside , in any order and with repetitions.
- No hypothesis is unsatisfiable. For example, , , satisfies them.
- The statement is about a fixed configuration . It says nothing about changing the configuration.
3. Plain-language summary
Enlarging a vote list never destroys a quorum: if every id of is also in and is a strict-majority quorum of , then so is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.