suppose s is a recursively defined set, defined by - the number 1 is in s - if n is in s, then so is 3n 2 - if n is in s, then so is 5n - 1 - if n is in s, then so is n 7. suppose you want to prove using structural induction that all members of s have a certain property. what do you have to prove in the base step?