Sch11.17
Premises:
(forall ?X (not (= 0 (succ ?X)))) (forall (?X ?Y) (=> (= (succ ?X) (succ ?Y)) (= ?X ?Y))) (forall ?X (= (+ ?X 0) ?X)) (forall (?X ?Y) (= (+ ?X (succ ?Y)) (succ (+ ?X ?Y)))) (forall (?X ?Y) (= (+ ?X ?Y) (+ ?Y ?X))) (forall (?X ?Y) (= (* ?X ?Y) (* ?Y ?X)))
Conclusion:
(forall ?X (= (+ 0 ?X) ?X))
Proof Trace