proposition: Lemma is_empty_app {A} : forall (l l' : list A), is_empty (l ++ l') = andb (is_empty l) (is_empty l').
proof: Proof. induction l; simpl; eauto. Qed.
imports: Coq.Vectors.Vector Coq.ZArith.ZArith Coq.Strings.Ascii Coq.Strings.String Coq.Bool.Bool Coq.Vectors.Vector Coq.Lists.List Fiat.Common.BoundedLookup Fiat.Common.SumType Fiat.Common.EnumType Fiat.Narcissus.Formats.DomainNameOpt Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.Heading Fiat.QueryStructure.Specification.Representation.Tuple Bedrock.Word Bedrock.Memory Fiat.Narcissus.Examples.DNS.SimpleRRecordTypes