(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(* Contribution to the Coq Library   V6.3 (July 1999)                    *)
(****************************************************************)
(*           The Calculus of Inductive Constructions            *)
(*                       COQ v5.10                              *)
(*                                                              *)
(* Laurent Arditi.  Laboratoire I3S. CNRS ura 1376.             *)
(* Universite de Nice - Sophia Antipolis                        *)
(* arditi@unice.fr, http://wwwi3s.unice.fr/~arditi/lolo.html    *)
(*                                                              *)
(* date: november 1995                                          *)
(* file: Fill_defs                                              *)
(* contents: proof of a memory block instruction: Fills cx words*)
(* in memory starting at address di with value al.              *)
(* Definitions of operators, sizes...                           *)
(****************************************************************)
Require Export IncrDecr.
Require Export Memo.
Parameter a_size d_size : nat.  (* address and data sizes *)
Parameter di_init cx_init al_init : BV.
Parameter mem_init : Memo.
Fixpoint IsNull (v : BV) : bool :=
match v return bool with
| nil => true
| b :: w =>
match b return bool with
| true => false
| false => IsNull w
end
end.
auto.
Qed.
simple induction a. simpl in |- *. auto. trivial.
Qed.

Lemma IsNull_cons :
forall (a : bool) (v : BV), IsNull (consbv a v) = true -> IsNull v = true.