Making and comparing Sets in Coq
问题 I'm having trouble understanding whether it is possible to prove that two sets (in this case regular languages) are identical and thus interchangeable. From what I understand, sets can be equivalent even if they are not constructively equal. Regular languages are sets of strings, but I don't see how to say that r1 = r2 so that something like symmetry can be used in a proof. Here is my RegularLanguage declaration: Inductive RegularLanguage (A : Set) : Set := | EmptyLang : RegularLanguage A |