(* This file was automatically generated: do not edit *********************)
-include "Basic-1/nf2/defs.ma".
+include "basic_1/nf2/defs.ma".
-include "Basic-1/pr3/pr3.ma".
+include "basic_1/pr3/pr3.ma".
-theorem nf2_pr3_unfold:
+lemma nf2_pr3_unfold:
\forall (c: C).(\forall (t1: T).(\forall (t2: T).((pr3 c t1 t2) \to ((nf2 c
t1) \to (eq T t1 t2)))))
\def
(eq_ind T t3 (\lambda (t: T).(nf2 c t)) H3 t0 (H4 t0 H0)) in (let H6 \def
(eq_ind T t3 (\lambda (t: T).(pr2 c t t0)) H0 t0 (H4 t0 H0)) in (eq_ind_r T
t0 (\lambda (t: T).(eq T t t4)) (H2 H5) t3 (H4 t0 H0)))))))))))) t1 t2 H)))).
-(* COMMENTS
-Initial nodes: 187
-END *)
theorem nf2_pr3_confluence:
\forall (c: C).(\forall (t1: T).((nf2 c t1) \to (\forall (t2: T).((nf2 c t2)
(\lambda (t0: T).(pr3 c t0 t1)) H6 t1 H_y0) in (eq_ind_r T t1 (\lambda (t0:
T).(eq T t1 t0)) (refl_equal T t1) t2 H_y0))))))))) (pr3_confluence c t t2 H2
t1 H1))))))))).
-(* COMMENTS
-Initial nodes: 215
-END *)