proposition: Lemma classify_AbsR S fs : AbsR (projT2 FiniteSetImpl) S fs -> (forall x, Ensembles.In _ S x <-> snd (CallMethod (projT1 FiniteSetImpl) sIn fs x) = true).
proof: Proof. t. { handle_calls_then' ltac:(fun H => match goal with | [ H' : AbsR _ _ _ |- _ ] => specialize (H _ H') end). t. } { handle_calls_then' ltac:(fun H => match goal with | [ H' : AbsR _ _ _ |- _ ] => specialize (H _ H') end). t. } Qed.
imports: Coq.Strings.String Coq.Sets.Ensembles Coq.Sets.Finite_sets Coq.Lists.List Coq.Sorting.Permutation Coq.Classes.RelationPairs Fiat.ADT Fiat.ADT.ComputationalADT Fiat.ADTRefinement.Core Fiat.ADTNotation Fiat.ADTRefinement.GeneralRefinements Fiat.Computation Fiat.Common Fiat.Common.Ensembles Fiat.Common.Ensembles.Tactics Fiat.ComputationalEnsembles Fiat.FiniteSetADTs.FiniteSetADTMethodLaws Fiat.FiniteSetADTs.FiniteSetADT