Dijkstra: progress from an abstract priority-queue contract
ProvedComposableDijkstraAnalysis.extraction_progressLet model be a priority-queue model satisfying Contracts, with capacity at least the graph's vertex count. For any queue state and list of remaining vertices satisfying LoopInvariant, the next extraction satisfies Execution.Progress for the represented graph. This is the induction step used to prove the generic Dijkstra loop; it assumes the invariant, not an arbitrary malformed queue state.
Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.
import Definitions.Def_Algo_dijkstra_dijkstra_Analysis set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true set_option autoImplicit false
theorem ComposableDijkstraAnalysis.extraction_progress :
∀ {dependencies : Algo.dijkstra.dijkstra.Dependencies} {client : ComposableDijkstraAnalysis.Client}
(model : PriorityQueueAnalysis.Model dependencies.PriorityQueue client.queue client.protection),
PriorityQueueAnalysis.Contracts model ComposableDijkstraAnalysis.reservedClocks →
LE.le.{0} client.size model.capacity →
∀ (state : ComposableDijkstraAnalysis.QueueState model) (remaining : List.{0} Int),
ComposableDijkstraAnalysis.LoopInvariant model state remaining →
Algo2Lean.Dijkstra.Execution.Progress
(ComposableDijkstraAnalysis.executionInterface model)
(Algo2Lean.Dijkstra.representedEdges client.size client.adjacency) client.adjacency
state remaining := by
sorry