I agree Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our website without changing the browser settings you grant us permission to store that information on your device.
theory Defs imports "HOL-Data_Structures.Binomial_Heap" begin abbreviation "heap_ins \<equiv> Binomial_Heap.insert" end
theory Template imports Defs begin definition \<Phi> where "\<Phi> _ = undefined" abbreviation c where "c \<equiv> undefined" lemma amortised_insert: assumes "invar_bheap ts" shows "t_insert x ts + \<Phi> (insert x ts) - \<Phi> ts = c" sorry end
theory Check imports Template begin lemma amortised_insert: shows "invar_bheap ts \<Longrightarrow> t_insert x ts + \<Phi> (insert x ts) - \<Phi> ts = c" by (rule amortised_insert) end