Sch11.19
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 (= (* ?X 0) 0)) (forall (?X ?Y) (= (* ?X (succ ?Y)) (+ (* ?X ?Y) ?X)))
Conclusion:
(forall ?X (forall ?Y (= (+ ?X ?Y) (+ ?Y ?X))))
Proof Trace