Annorlunda, knäppa religoner sökes

Inductive proof: Everything is a goat.
1) Base case: Consider a set of elements consisting of one goat. That goat is a goat, so all elements in this set are goats.
2) Inductive hypothesis: If any set of k elements are all goats, then any set of k+1 elements are all goats.

Proof of inductive hypothesis: Let S be any set of k+1 goats. Number them 1 to k+1, by any selection method you like.
Now remove goat #1. The remaining set of goats 2 to k+1 is a set of k goats. So by assumption, they are all goats.
Now put back goat #1 and remove goat #k+1. Again, the remaining set of k goats (#1 to #k) are goats.
Now since there was an overlap between the two sets (for example, goat #2 was in both sets), and in each set all the goats are goats, then all the goats in the larger set of k+1 must also be goats.
We have proven by induction that any set of things, of whatever size, consists of goats. So everything is a goat.