src/HOLCF/IOA/Storage/Action.thy

merged the silly lemmas into the eqvt proof of subtype

(*  Title:      HOLCF/IOA/ABP/Action.thy
    ID:         $Id$
    Author:     Olaf Müller
*)

header {* The set of all actions of the system *}

theory Action
imports Main
begin

datatype action = New  | Loc nat | Free nat

lemma [cong]: "!!x. x = y ==> action_case a b c x = action_case a b c y"
  by simp

ML {* use_legacy_bindings (the_context ()) *}

end