Algo.fibonacci_heap.Points definitions
DefinitionAlgo_fibonacci_heap_PointsDefinitions and required structural lemmas from Algo.fibonacci_heap.Points. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.
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_fibonacci_heap_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.«fibonacci_heap» open _root_.Algo2LeanGenerated Algo2LeanGenerated -- Named locations are independent of the compiled module body. -- Before source line 67, column 9; location only, not reachability. def FibonacciHeap.link.At.link_child : Configuration → Prop | .active _ (.fn_FibonacciHeap_link 17 _) _ => True | _ => False def FibonacciHeap.link.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_link pc s) _ => if pc = 17 then some s.v0 else none | _ => none def FibonacciHeap.link.Local.child : Configuration → Option Int | .active _ (.fn_FibonacciHeap_link pc s) _ => if pc = 17 then some s.v1 else none | _ => none def FibonacciHeap.link.Local.parent : Configuration → Option Int | .active _ (.fn_FibonacciHeap_link pc s) _ => if pc = 17 then some s.v2 else none | _ => none -- Before source line 90, column 9; location only, not reachability. def FibonacciHeap.consolidate.At.consume_roots : Configuration → Prop | .active _ (.fn_FibonacciHeap_consolidate 17 _) _ => True | _ => False -- Before source line 100, column 13; location only, not reachability. def FibonacciHeap.consolidate.At.equal_degree : Configuration → Prop | .active _ (.fn_FibonacciHeap_consolidate 23 _) _ => True | _ => False -- Before source line 115, column 9; location only, not reachability. def FibonacciHeap.consolidate.At.rebuild_roots : Configuration → Prop | .active _ (.fn_FibonacciHeap_consolidate 4 _) _ => True | _ => False def FibonacciHeap.consolidate.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_consolidate pc s) _ => if pc = 4 ∨ pc = 17 ∨ pc = 23 then some s.v0 else none | _ => none def FibonacciHeap.consolidate.Local.table : Configuration → Option SeqRef | .active _ (.fn_FibonacciHeap_consolidate pc s) _ => if pc = 4 ∨ pc = 17 ∨ pc = 23 then some s.v1 else none | _ => none def FibonacciHeap.consolidate.Element.table (state : Configuration) (index : Int) : Option Int := (_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Local.table state).map (fun ref => state.heap.read ref index) def FibonacciHeap.consolidate.Local.maximum_degree : Configuration → Option Int | .active _ (.fn_FibonacciHeap_consolidate pc s) _ => if pc = 4 ∨ pc = 17 ∨ pc = 23 then some s.v2 else none | _ => none def FibonacciHeap.consolidate.Local.vertex : Configuration → Option Int | .active _ (.fn_FibonacciHeap_consolidate pc s) _ => if pc = 23 then some s.v3 else none | _ => none def FibonacciHeap.consolidate.Local.degree : Configuration → Option Int | .active _ (.fn_FibonacciHeap_consolidate pc s) _ => if pc = 4 ∨ pc = 23 then some s.v4 else none | _ => none -- Before source line 132, column 9; location only, not reachability. def FibonacciHeap.cut.At.cut_to_root : Configuration → Prop | .active _ (.fn_FibonacciHeap_cut 7 _) _ => True | _ => False def FibonacciHeap.cut.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_cut pc s) _ => if pc = 7 then some s.v0 else none | _ => none def FibonacciHeap.cut.Local.vertex : Configuration → Option Int | .active _ (.fn_FibonacciHeap_cut pc s) _ => if pc = 7 then some s.v1 else none | _ => none def FibonacciHeap.cut.Local.parent : Configuration → Option Int | .active _ (.fn_FibonacciHeap_cut pc s) _ => if pc = 7 then some s.v2 else none | _ => none -- Before source line 139, column 9; location only, not reachability. def FibonacciHeap.cascading_cut.At.cascade : Configuration → Prop | .active _ (.fn_FibonacciHeap_cascading_cut 4 _) _ => True | _ => False def FibonacciHeap.cascading_cut.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_cascading_cut pc s) _ => if pc = 4 then some s.v0 else none | _ => none def FibonacciHeap.cascading_cut.Local.vertex : Configuration → Option Int | .active _ (.fn_FibonacciHeap_cascading_cut pc s) _ => if pc = 4 then some s.v1 else none | _ => none def FibonacciHeap.cascading_cut.Local.parent : Configuration → Option Int | .active _ (.fn_FibonacciHeap_cascading_cut pc s) _ => if pc = 4 then some s.v2 else none | _ => none -- Before source line 158, column 13; location only, not reachability. def FibonacciHeap.push_or_decrease.At.insert_root : Configuration → Prop | .active _ (.fn_FibonacciHeap_push_or_decrease 33 _) _ => True | _ => False def FibonacciHeap.push_or_decrease.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_push_or_decrease pc s) _ => if pc = 33 then some s.v0 else none | _ => none def FibonacciHeap.push_or_decrease.Local.vertex : Configuration → Option Int | .active _ (.fn_FibonacciHeap_push_or_decrease pc s) _ => if pc = 33 then some s.v1 else none | _ => none def FibonacciHeap.push_or_decrease.Local.key : Configuration → Option Int | .active _ (.fn_FibonacciHeap_push_or_decrease pc s) _ => if pc = 33 then some s.v2 else none | _ => none -- Before source line 181, column 9; location only, not reachability. def FibonacciHeap.pop_min.At.promote_children : Configuration → Prop | .active _ (.fn_FibonacciHeap_pop_min 21 _) _ => True | _ => False def FibonacciHeap.pop_min.Local.self : Configuration → Option Ref_FibonacciHeap | .active _ (.fn_FibonacciHeap_pop_min pc s) _ => if pc = 21 then some s.v0 else none | _ => none def FibonacciHeap.pop_min.Local.vertex : Configuration → Option Int | .active _ (.fn_FibonacciHeap_pop_min pc s) _ => if pc = 21 then some s.v1 else none | _ => none end Algo.«fibonacci_heap»