(* This file was automatically generated: do not edit *********************)
-include "Base-1/types/defs.ma".
+include "Ground-1/types/defs.ma".
theorem ex2_sym:
\forall (A: Set).(\forall (P: ((A \to Prop))).(\forall (Q: ((A \to
(\lambda (x: A).(Q x)) (\lambda (x: A).(P x))) (\lambda (x: A).(\lambda (H0:
(P x)).(\lambda (H1: (Q x)).(ex_intro2 A (\lambda (x0: A).(Q x0)) (\lambda
(x0: A).(P x0)) x H1 H0)))) H)))).
+(* COMMENTS
+Initial nodes: 91
+END *)