∀ x P, P x ⇒ ∀ y, x = y ⇒ P y

Theorem rewrite_l : forall A, forall (x:A), forall (P:(A -> Prop)), (P x) -> forall (y:A), (eq (A) x y) -> P y.

theorem rewrite_l : \forall A. \forall (x:A). \forall (P:A -> Prop). (P x) -> \forall (y:A). ((eq) (A) x y) -> P y.

theorem rewrite_l : forall (A : Type) , forall (x:A) , forall (P:(A) -> Prop) , ((P) (x)) -> forall (y:A) , ((((logic.eq_) (A)) (x)) (y)) -> (P) (y).

rewrite_l [A:TYPE+] : LEMMA (FORALL(x:A):(FORALL(P:[A -> bool]):(P(x) => (FORALL(y:A):(logic_sttfa.eq[A](x)(y) => P(y))))))

Printing for OpenTheory is not working at the moment.