(* 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                                                     *)
Definition is_tauto (be : bool_expr) :=
N.eqb BDDone
(fst
(snd (BDDof_bool_expr initBDDconfig initBDDneg_memo initBDDor_memo be))).
Definition is_valid (be : bool_expr) :=
forall vb : var_binding, bool_fun_of_bool_expr be vb = true.

Lemma is_tauto_is_complete :
forall be : bool_expr, is_valid be -> is_tauto be = true.