proposition: Remark elsewhere2_y : forall y : F, y <> y0 -> (fun x : E => change_x0y0 x y) = (fun x : E => t x y).
proof: Proof. intros; apply funct_eq. intros; unfold change_x0y0 in |- *. case (eq_E_dec e x0); intros. rewrite e0; rewrite here. rewrite elsewhere; auto. rewrite elsewhere; auto. Qed.
imports: List finite