proposition: Theorem testthm : forall n, n = n + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0.
proof: Proof. intros. assert (forall y, y + 0 = y) as tm. intros. omega. specialize (tm n). apply_under_subgoal ltac:(rewrite tm) ltac:(try reflexivity). Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Vectors.Vector Coq.Strings.Ascii Coq.Bool.Bool Coq.Bool.Bvector Coq.Lists.List Fiat.Computation.ListComputations Fiat.QueryStructure.Automation.MasterPlan Fiat.QueryStructure.Implementation.DataStructures.BagADT.BagADT Fiat.QueryStructure.Automation.IndexSelection Fiat.QueryStructure.Specification.SearchTerms.ListPrefix Fiat.QueryStructure.Automation.SearchTerms.FindPrefixSearchTerms Fiat.QueryStructure.Automation.QSImplementation Fiat.Narcissus.Examples.DNS.SimpleDNSPacket Fiat.Examples.DnsServer.AuthoritativeDNSSchema Fiat.Examples.DnsServer.SimpleDnsLemmas