Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Suppose I define this set.
Inductive Set_1 : Set :=
| Constr_1 : Set_1
| Constr_2 : Set_1.
Is it possible to prove this statement?
(Constr_1 = Constr_2) = False
If so, what tactics do I use? This might be useful for autorewrite.
(A <-> B) -> A = Bis called propositional extensionality and is implied by classical logic.But you don’t need it for using equivalences with
autorewrite, justRequire Import Coq.Setoids.Setoid.