proposition: Lemma or16_equiv: forall A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15 A16 , or16 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15 A16 <-> A1 \/ A2 \/ A3 \/ A4 \/ A5 \/ A6 \/ A7 \/ A8 \/ A9 \/ A10 \/ A11 \/ A12 \/ A13 \/ A14 \/ A15 \/ A16 .
proof: Proof. intros. split. intros H. rewrite <- or15_equiv. destruct H. constructor 1. exact H. constructor 2. exact H. constructor 3. exact H. constructor 4. exact H. constructor 5. exact H. constructor 6. exact H. constructor 7. exact H. constructor 8. exact H. constructor 9. exact H. constructor 10. exact H. constructor 11. exact H. constructor 12. exact H. constructor 13. exact H. constructor 14. exact H. constructor 15. left. exact H. constructor 15. right. exact H. intros H. destruct H. constructor 1. exact H. rewrite <- or15_equiv in H. destruct H. constructor 2. exact H. constructor 3. exact H. constructor 4. exact H. constructor 5. exact H. constructor 6. exact H. constructor 7. exact H. constructor 8. exact H. constructor 9. exact H. constructor 10. exact H. constructor 11. exact H. constructor 12. exact H. constructor 13. exact H. constructor 14. exact H. constructor 15. exact H. constructor 16. exact H. Qed.
imports: Coq(Setoid Morphisms)