proposition: Lemma beq_QType_sym : forall rrT rrT', beq_QType rrT rrT' = beq_QType rrT' rrT.
proof: Proof. intros; eapply fin_beq_sym. 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