proposition: Lemma fold_right_and_True_app ls ls' : fold_right and True (ls ++ ls') <-> (fold_right and True ls /\ fold_right and True ls').
proof: Proof. revert ls'; induction ls as [|?? IHls]; simpl; intros; try tauto. rewrite IHls; clear IHls. tauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts