Recursively processes all the if statements.
(vl-stmt-unelse x) → new-x
Theorem:
(defthm len-of-vl-stmtlist-unelse (equal (len (vl-stmtlist-unelse x)) (len x)))
Theorem:
(defthm return-type-of-vl-stmt-unelse (implies (force (vl-stmt-p x)) (vl-stmt-p (vl-stmt-unelse x))))
Theorem:
(defthm return-type-of-vl-stmtlist-unelse (implies (force (vl-stmtlist-p x)) (vl-stmtlist-p (vl-stmtlist-unelse x))))