Fibonacci heap: a fresh empty queue satisfies its representation
ProvedFibonacciModuleAnalysis.new_heap_representationFor every initial heap h, newHeap h contains a valid empty Fibonacci queue at h.nextObject with emptyLayout h. The finite forest is empty. This representation lemma supplies the starting invariant for compiled queue calls; it does not by itself assert a constructor execution.
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_support_fibonacci_heap_Analysis set_option autoImplicit true set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true set_option autoImplicit false
theorem FibonacciModuleAnalysis.new_heap_representation :
∀ (heap : Algo2LeanGenerated.Heap),
FibonacciModuleAnalysis.QueueRep (FibonacciModuleAnalysis.newHeap heap) heap.nextObject
(FibonacciModuleAnalysis.emptyLayout heap) List.nil.{0} := by
sorry