Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Algo.prim.prim_fibonacci.Generated definitions

Definition
Algo_prim_prim_fibonacci_Generated

by lunjia · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Definitions and required structural lemmas from Algo.prim.prim_fibonacci.Generated. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.

<!-- algo2lean-provenance-v0.1.4 -->

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.

Definition code
import Definitions.Def_Algo2LeanLib_Modules
import Definitions.Def_Algo2LeanLib_Interface
import Definitions.Def_Algo_prim_graph_Generated
import Definitions.Def_Algo_fibonacci_heap_Generated
import Definitions.Def_Algo_prim_prim_Generated

set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true


-- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean

namespace Algo.«prim».«prim_fibonacci»

open _root_.Algo2LeanGenerated

-- Independently compiled module; imported algorithms keep their own transitions.
def FibonacciHeap_as_PriorityQueue : Algo.«dijkstra».«priority_queue».«PriorityQueue».Code where
  toInterfaceCode := Algo2LeanCore.InterfaceAdapter.code Algo.«fibonacci_heap».Algo2LeanGenerated.Step
  valid := fun heap ref => decide (Algo.«fibonacci_heap».Algo2LeanGenerated.is_FibonacciHeap heap ref)
  entry_PriorityQueue_push_or_decrease := fun input =>
    Algo2LeanCore.InterfaceAdapter.entry (Algo.«fibonacci_heap».entry_FibonacciHeap_push_or_decrease input) (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_push_or_decrease value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_push_or_decrease value) | _ => none)
  entry_PriorityQueue_pop_min := fun input =>
    Algo2LeanCore.InterfaceAdapter.entry (Algo.«fibonacci_heap».entry_FibonacciHeap_pop_min input) (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_pop_min value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_pop_min value) | _ => none)
  entry_PriorityQueue_is_empty := fun input =>
    Algo2LeanCore.InterfaceAdapter.entry (Algo.«fibonacci_heap».entry_FibonacciHeap_is_empty input) (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_is_empty value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_is_empty value) | _ => none)

theorem FibonacciHeap_as_PriorityQueue_summary_push_or_decrease {before after : Heap} {input : ObjectRef × Int × Int} {output : Unit}
    (contract : Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Call before input after output) :
    Algo.«dijkstra».«priority_queue».«PriorityQueue».push_or_decrease.Call FibonacciHeap_as_PriorityQueue before input after output := by
  have receiver_valid : Algo.«fibonacci_heap».Algo2LeanGenerated.is_FibonacciHeap before input.1 := contract.1
  refine ⟨?_, ?_⟩
  · simpa [FibonacciHeap_as_PriorityQueue] using receiver_valid
  · exact Algo2LeanCore.InterfaceAdapter.summary Algo.«fibonacci_heap».Algo2LeanGenerated.terminal contract.2 (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_push_or_decrease value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_push_or_decrease value) | _ => none) rfl

theorem FibonacciHeap_as_PriorityQueue_summary_pop_min {before after : Heap} {input : ObjectRef} {output : Int}
    (contract : Algo.«fibonacci_heap».FibonacciHeap.pop_min.Call before input after output) :
    Algo.«dijkstra».«priority_queue».«PriorityQueue».pop_min.Call FibonacciHeap_as_PriorityQueue before input after output := by
  have receiver_valid : Algo.«fibonacci_heap».Algo2LeanGenerated.is_FibonacciHeap before input := contract.1
  refine ⟨?_, ?_⟩
  · simpa [FibonacciHeap_as_PriorityQueue] using receiver_valid
  · exact Algo2LeanCore.InterfaceAdapter.summary Algo.«fibonacci_heap».Algo2LeanGenerated.terminal contract.2 (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_pop_min value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_pop_min value) | _ => none) rfl

theorem FibonacciHeap_as_PriorityQueue_summary_is_empty {before after : Heap} {input : ObjectRef} {output : Bool}
    (contract : Algo.«fibonacci_heap».FibonacciHeap.is_empty.Call before input after output) :
    Algo.«dijkstra».«priority_queue».«PriorityQueue».is_empty.Call FibonacciHeap_as_PriorityQueue before input after output := by
  have receiver_valid : Algo.«fibonacci_heap».Algo2LeanGenerated.is_FibonacciHeap before input := contract.1
  refine ⟨?_, ?_⟩
  · simpa [FibonacciHeap_as_PriorityQueue] using receiver_valid
  · exact Algo2LeanCore.InterfaceAdapter.summary Algo.«fibonacci_heap».Algo2LeanGenerated.terminal contract.2 (fun result : Algo.«fibonacci_heap».Algo2LeanGenerated.Result => match result with | .fn_FibonacciHeap_is_empty value => some (Algo.«dijkstra».«priority_queue».«PriorityQueue».Result.fn_PriorityQueue_is_empty value) | _ => none) rfl

def use_prim_prim_0 : Algo.«prim».«prim».Dependencies where
  «PriorityQueue» := FibonacciHeap_as_PriorityQueue

namespace Algo2LeanGenerated

abbrev Ref__a2l_import_0_Edge := Algo.«prim».«graph».Algo2LeanGenerated.Ref_Edge
abbrev Ref__a2l_import_0_Graph := Algo.«prim».«graph».Algo2LeanGenerated.Ref_Graph
abbrev Ref__a2l_import_1_FibonacciHeap := Algo.«fibonacci_heap».Algo2LeanGenerated.Ref_FibonacciHeap
abbrev Ref__a2l_import_2_PriorityQueue := ObjectRef

abbrev is__a2l_import_0_Edge := Algo.«prim».«graph».Algo2LeanGenerated.is_Edge
abbrev create__a2l_import_0_Edge := Algo.«prim».«graph».Algo2LeanGenerated.create_Edge
abbrev field__a2l_import_0_Edge_target := Algo.«prim».«graph».Algo2LeanGenerated.field_Edge_target
abbrev set__a2l_import_0_Edge_target := Algo.«prim».«graph».Algo2LeanGenerated.set_Edge_target
abbrev field__a2l_import_0_Edge_weight := Algo.«prim».«graph».Algo2LeanGenerated.field_Edge_weight
abbrev set__a2l_import_0_Edge_weight := Algo.«prim».«graph».Algo2LeanGenerated.set_Edge_weight
abbrev field__a2l_import_0_Edge_next := Algo.«prim».«graph».Algo2LeanGenerated.field_Edge_next
abbrev set__a2l_import_0_Edge_next := Algo.«prim».«graph».Algo2LeanGenerated.set_Edge_next

abbrev is__a2l_import_0_Graph := Algo.«prim».«graph».Algo2LeanGenerated.is_Graph
abbrev create__a2l_import_0_Graph := Algo.«prim».«graph».Algo2LeanGenerated.create_Graph
abbrev field__a2l_import_0_Graph_size := Algo.«prim».«graph».Algo2LeanGenerated.field_Graph_size
abbrev set__a2l_import_0_Graph_size := Algo.«prim».«graph».Algo2LeanGenerated.set_Graph_size
abbrev field__a2l_import_0_Graph_heads := Algo.«prim».«graph».Algo2LeanGenerated.field_Graph_heads
abbrev set__a2l_import_0_Graph_heads := Algo.«prim».«graph».Algo2LeanGenerated.set_Graph_heads

abbrev is__a2l_import_1_FibonacciHeap := Algo.«fibonacci_heap».Algo2LeanGenerated.is_FibonacciHeap
abbrev create__a2l_import_1_FibonacciHeap := Algo.«fibonacci_heap».Algo2LeanGenerated.create_FibonacciHeap
abbrev field__a2l_import_1_FibonacciHeap_keys := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_keys
abbrev set__a2l_import_1_FibonacciHeap_keys := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_keys
abbrev field__a2l_import_1_FibonacciHeap_parents := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_parents
abbrev set__a2l_import_1_FibonacciHeap_parents := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_parents
abbrev field__a2l_import_1_FibonacciHeap_children := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_children
abbrev set__a2l_import_1_FibonacciHeap_children := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_children
abbrev field__a2l_import_1_FibonacciHeap_left := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_left
abbrev set__a2l_import_1_FibonacciHeap_left := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_left
abbrev field__a2l_import_1_FibonacciHeap_right := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_right
abbrev set__a2l_import_1_FibonacciHeap_right := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_right
abbrev field__a2l_import_1_FibonacciHeap_degrees := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_degrees
abbrev set__a2l_import_1_FibonacciHeap_degrees := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_degrees
abbrev field__a2l_import_1_FibonacciHeap_marks := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_marks
abbrev set__a2l_import_1_FibonacciHeap_marks := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_marks
abbrev field__a2l_import_1_FibonacciHeap_present := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_present
abbrev set__a2l_import_1_FibonacciHeap_present := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_present
abbrev field__a2l_import_1_FibonacciHeap_table := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_table
abbrev set__a2l_import_1_FibonacciHeap_table := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_table
abbrev field__a2l_import_1_FibonacciHeap_minimum := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_minimum
abbrev set__a2l_import_1_FibonacciHeap_minimum := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_minimum
abbrev field__a2l_import_1_FibonacciHeap_size := Algo.«fibonacci_heap».Algo2LeanGenerated.field_FibonacciHeap_size
abbrev set__a2l_import_1_FibonacciHeap_size := Algo.«fibonacci_heap».Algo2LeanGenerated.set_FibonacciHeap_size

def seq__a2l_import_0_Edge_optional : SequenceType (Option Ref__a2l_import_0_Edge) where
  name := "prim.graph.Edge?"
  encode := fun value => (match value with | some ref => ObjectValue.objectValue ref | none => ObjectValue.noneValue)
  decode := ObjectValue.asNullableObject
  decode_encode := by intro value; cases value <;> rfl

structure State_prim_fibonacci where
  v0 : Ref__a2l_import_0_Graph := 0 -- graph
  v1 : Int := 0 -- root
  v2 : SeqRef := 0 -- parent
  v3 : SeqRef := 0 -- key
  v4 : SeqRef := 0 -- selected
  v5 : Ref__a2l_import_1_FibonacciHeap := 0 -- queue
  t6 : SeqRef := 0 -- temporary
  t7 : Ref__a2l_import_0_Graph := 0 -- temporary
  t8 : Int := 0 -- temporary
  t9 : Ref__a2l_import_2_PriorityQueue := 0 -- temporary
  t10 : SeqRef := 0 -- temporary
  t11 : SeqRef := 0 -- temporary
  t12 : SeqRef := 0 -- temporary
  t13 : Ref__a2l_import_1_FibonacciHeap := 0 -- temporary
  t14 : SeqRef := 0 -- temporary
  t15 : Int := 0 -- temporary
  t16 : SeqRef := 0 -- temporary
  t17 : Int := 0 -- temporary
  t18 : Bool := false -- temporary
  t19 : SeqRef := 0 -- temporary
  t20 : SeqRef := 0 -- temporary
  t21 : Int := 0 -- temporary

inductive Frame where
  | invalid
  | fn_prim_fibonacci (pc : Nat) (state : State_prim_fibonacci)
  | import_1 (frame : Algo.«fibonacci_heap».Algo2LeanGenerated.Frame) (inner : Algo.«fibonacci_heap».Algo2LeanGenerated.Stack) (resume : Algo.«fibonacci_heap».Algo2LeanGenerated.Result → Frame)
  | import_3_use_prim_prim_0 (frame : (Algo.«prim».«prim».Algo2LeanGenerated.Frame use_prim_prim_0)) (inner : (Algo.«prim».«prim».Algo2LeanGenerated.Stack use_prim_prim_0)) (resume : Algo.«prim».«prim».Algo2LeanGenerated.Result → Frame)

inductive Result where
  | fn_prim_fibonacci (value : SeqRef)

abbrev Configuration := Algo2LeanCore.Config Heap (Frame) Result
abbrev Stack := Algo2LeanCore.Stack (Frame) Result
abbrev Transcript := List (Configuration)

inductive Step : Configuration → Configuration → Prop where
  | prim_fibonacci_pc1 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) (defined : s.t6 < h.nextRef) :
      Step (.active h (Frame.fn_prim_fibonacci 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_prim_fibonacci (s.t6)) stack)
  | prim_fibonacci_pc2 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 2 s) stack) (.active h (Frame.import_3_use_prim_prim_0 (Algo.«prim».«prim».entry_prim use_prim_prim_0 (s.t7, s.t8, s.t9, s.t10, s.t11, s.t12)) [] (fun value => match value with | .fn_prim result => (Frame.fn_prim_fibonacci 1 { s with t6 := result }) | _ => .invalid)) stack)
  | prim_fibonacci_pc3 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 3 s) stack) (.active h (Frame.fn_prim_fibonacci 2 { s with t12 := s.v4 }) stack)
  | prim_fibonacci_pc4 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 4 s) stack) (.active h (Frame.fn_prim_fibonacci 3 { s with t11 := s.v2 }) stack)
  | prim_fibonacci_pc5 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 5 s) stack) (.active h (Frame.fn_prim_fibonacci 4 { s with t10 := s.v3 }) stack)
  | prim_fibonacci_pc6 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 6 s) stack) (.active h (Frame.fn_prim_fibonacci 5 { s with t9 := s.v5 }) stack)
  | prim_fibonacci_pc7 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 7 s) stack) (.active h (Frame.fn_prim_fibonacci 6 { s with t8 := s.v1 }) stack)
  | prim_fibonacci_pc8 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 8 s) stack) (.active h (Frame.fn_prim_fibonacci 7 { s with t7 := s.v0 }) stack)
  | prim_fibonacci_pc9 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 9 s) stack) (.active h (Frame.fn_prim_fibonacci 8 { s with v5 := s.t13 }) stack)
  | prim_fibonacci_pc10 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 10 s) stack) (.active h (Frame.import_1 (Algo.«fibonacci_heap».entry_FibonacciHeap ()) [] (fun value => match value with | .fn_FibonacciHeap result => (Frame.fn_prim_fibonacci 9 { s with t13 := result }) | _ => .invalid)) stack)
  | prim_fibonacci_pc11 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 11 s) stack) (.active h (Frame.fn_prim_fibonacci 10 { s with v4 := s.t14 }) stack)
  | prim_fibonacci_pc12 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 12 s) stack) (.active (h.allocate (fun _ => s.t15)) (Frame.fn_prim_fibonacci 11 { s with t14 := h.nextRef }) stack)
  | prim_fibonacci_pc13 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 13 s) stack) (.active h (Frame.fn_prim_fibonacci 12 { s with t15 := (0 : Int) }) stack)
  | prim_fibonacci_pc14 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 14 s) stack) (.active h (Frame.fn_prim_fibonacci 13 { s with v3 := s.t16 }) stack)
  | prim_fibonacci_pc15 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 15 s) stack) (.active (h.allocate (fun _ => s.t17)) (Frame.fn_prim_fibonacci 14 { s with t16 := h.nextRef }) stack)
  | prim_fibonacci_pc16 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 16 s) stack) (.active h (Frame.fn_prim_fibonacci 15 { s with t17 := (0 : Int) }) stack)
  | prim_fibonacci_pc17 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) (defined : s.t19 < h.nextRef) :
      Step (.active h (Frame.fn_prim_fibonacci 17 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_prim_fibonacci (s.t19)) stack)
  | prim_fibonacci_pc18 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 18 s) stack) (.active h (Frame.fn_prim_fibonacci 17 { s with t19 := s.v2 }) stack)
  | prim_fibonacci_pc19_true (h : Heap) (s : State_prim_fibonacci) (stack : Stack) (condition : s.t18 = true) :
      Step (.active h (Frame.fn_prim_fibonacci 19 s) stack) (.active h (Frame.fn_prim_fibonacci 18 s) stack)
  | prim_fibonacci_pc19_false (h : Heap) (s : State_prim_fibonacci) (stack : Stack) (condition : s.t18 = false) :
      Step (.active h (Frame.fn_prim_fibonacci 19 s) stack) (.active h (Frame.fn_prim_fibonacci 16 s) stack)
  | prim_fibonacci_pc20 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) (defined : (((decide ((s.v1 < (0 : Int)))) = false → ((((field__a2l_import_0_Graph_size h (s.v0)).isSome = true)))))) :
      Step (.active h (Frame.fn_prim_fibonacci 20 s) stack) (.active h (Frame.fn_prim_fibonacci 19 { s with t18 := ((decide ((s.v1 < (0 : Int)))) || (decide ((s.v1 ≥ ((field__a2l_import_0_Graph_size h (s.v0)).getD 0))))) }) stack)
  | prim_fibonacci_pc21 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 21 s) stack) (.active h (Frame.fn_prim_fibonacci 20 { s with v2 := s.t20 }) stack)
  | prim_fibonacci_pc22 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 22 s) stack) (.active (h.allocate (fun _ => s.t21)) (Frame.fn_prim_fibonacci 21 { s with t20 := h.nextRef }) stack)
  | prim_fibonacci_pc23 (h : Heap) (s : State_prim_fibonacci) (stack : Stack) :
      Step (.active h (Frame.fn_prim_fibonacci 23 s) stack) (.active h (Frame.fn_prim_fibonacci 22 { s with t21 := (-(1 : Int)) }) stack)
  | import_1 (h : Heap) (frame : Algo.«fibonacci_heap».Algo2LeanGenerated.Frame) (inner : Algo.«fibonacci_heap».Algo2LeanGenerated.Stack)
      (resume : Algo.«fibonacci_heap».Algo2LeanGenerated.Result → Frame) (caller : Stack) (after : Algo.«fibonacci_heap».Algo2LeanGenerated.Configuration)
      (transition : Algo.«fibonacci_heap».Algo2LeanGenerated.Step (.active h frame inner) after) :
      Step (.active h (Frame.import_1 frame inner resume) caller)
        (Algo2LeanCore.ModuleCall.config Frame.import_1 resume caller after)
  | import_3_use_prim_prim_0 (h : Heap) (frame : (Algo.«prim».«prim».Algo2LeanGenerated.Frame use_prim_prim_0)) (inner : (Algo.«prim».«prim».Algo2LeanGenerated.Stack use_prim_prim_0))
      (resume : Algo.«prim».«prim».Algo2LeanGenerated.Result → Frame) (caller : Stack) (after : (Algo.«prim».«prim».Algo2LeanGenerated.Configuration use_prim_prim_0))
      (transition : (Algo.«prim».«prim».Algo2LeanGenerated.Step use_prim_prim_0) (.active h frame inner) after) :
      Step (.active h (Frame.import_3_use_prim_prim_0 frame inner resume) caller)
        (Algo2LeanCore.ModuleCall.config Frame.import_3_use_prim_prim_0 resume caller after)

theorem terminal (h : Heap) (result : Result) :
    Algo2LeanCore.Terminal Step (.done h result) := by
  intro next transition
  cases transition

theorem import_1_simulates :
    Algo2LeanCore.ModuleCall.Simulates Frame.import_1 Algo.«fibonacci_heap».Algo2LeanGenerated.Step Step := by
  apply Algo2LeanCore.ModuleCall.Delegates.simulates
  · exact Step.import_1
  · exact Algo.«fibonacci_heap».Algo2LeanGenerated.terminal

theorem import_3_use_prim_prim_0_simulates :
    Algo2LeanCore.ModuleCall.Simulates Frame.import_3_use_prim_prim_0 (Algo.«prim».«prim».Algo2LeanGenerated.Step use_prim_prim_0) Step := by
  apply Algo2LeanCore.ModuleCall.Delegates.simulates
  · exact Step.import_3_use_prim_prim_0
  · exact (Algo.«prim».«prim».Algo2LeanGenerated.terminal use_prim_prim_0)

end Algo2LeanGenerated

open Algo2LeanGenerated

def entry_prim_fibonacci (input : Ref__a2l_import_0_Graph × Int) : Frame :=
  (Frame.fn_prim_fibonacci 23 ({ v0 := input.1, v1 := input.2 } : State_prim_fibonacci))

def prim_fibonacci.ValidInput (h : Heap) (input : Ref__a2l_import_0_Graph × Int) : Prop := is__a2l_import_0_Graph h input.1
def prim_fibonacci.initial (h : Heap) (input : Ref__a2l_import_0_Graph × Int) : Configuration :=
  Algo2LeanCore.start h (Frame.fn_prim_fibonacci 23 ({ v0 := input.1, v1 := input.2 } : State_prim_fibonacci))
def prim_fibonacci.Run (h : Heap) (input : Ref__a2l_import_0_Graph × Int) (h' : Heap) (output : SeqRef) : Prop :=
  _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.initial h input) (.done h' (Result.fn_prim_fibonacci output))
def prim_fibonacci.ValidHeapTranscript (h : Heap) (input : Ref__a2l_import_0_Graph × Int) (trace : Transcript) : Prop :=
  _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.initial h input) trace final
def prim_fibonacci.Call (h : Heap) (input : Ref__a2l_import_0_Graph × Int) (h' : Heap) (output : SeqRef) : Prop :=
  _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_prim_fibonacci 23 ({ v0 := input.1, v1 := input.2 } : State_prim_fibonacci)) h' (Result.fn_prim_fibonacci output)
-- Complete this function from the supplied local state, under any caller stack.
def prim_fibonacci.CallFrom (state : Configuration) (finalHeap : Heap) (output : SeqRef) : Prop :=
  match state with
  | .active heap (Frame.fn_prim_fibonacci pc locals) _ =>
      Algo2LeanCore.Summary Step heap (Frame.fn_prim_fibonacci pc locals) finalHeap (Result.fn_prim_fibonacci output)
  | _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def prim_fibonacci.load (input : Heap × (Ref__a2l_import_0_Graph × Int)) : Heap × (Ref__a2l_import_0_Graph × Int) := input
def prim_fibonacci.ValidTranscript (my_input : Heap × (Ref__a2l_import_0_Graph × Int)) (trace : Transcript) : Prop :=
  let loaded := _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.load my_input
  _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ValidHeapTranscript loaded.1 loaded.2 trace
def prim_fibonacci.Returns (my_input : Heap × (Ref__a2l_import_0_Graph × Int)) (my_output : Seq) : Prop :=
  let loaded := _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.load my_input
  ∃ finalHeap result, _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Run loaded.1 loaded.2 finalHeap result ∧ finalHeap.store result = my_output

-- Output and clock increments from one completed execution.
def prim_fibonacci.ReturnsWithCost (my_input : Heap × (Ref__a2l_import_0_Graph × Int)) (my_output : Seq) (costs : Clocks) : Prop :=
  let loaded := _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.load my_input
  ∃ finalHeap result, _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Run loaded.1 loaded.2 finalHeap result ∧ finalHeap.store result = my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem prim_fibonacci.ReturnsWithCost.returns {input output costs}
    (run : _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ReturnsWithCost input output costs) : _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Returns input output := by
  obtain ⟨heap, result, execution, value, _⟩ := run
  exact ⟨heap, result, execution, value⟩
theorem prim_fibonacci.Returns.withCost {input output}
    (run : _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Returns input output) : ∃ costs, _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.ReturnsWithCost input output costs := by
  obtain ⟨heap, result, execution, value⟩ := run
  exact ⟨Heap.cost (_root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.load input).1 heap, heap, result, execution, value, rfl⟩

theorem prim_fibonacci.Call.run {before input after output}
    (call : _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Call before input after output) :
    _root_.Algo.«prim».«prim_fibonacci».prim_fibonacci.Run before input after output :=
  ⟨call.1, call.2.root⟩

end Algo.«prim».«prim_fibonacci»
Source
https://github.com/lunjiah/algo2lean/blob/d832a5655d7cac6d032e728a4798128147b27922/examples/prim/prim_fibonacci.algo

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