Where Memes Come True

@emeraldwhale

general set-up of an inductive proof: first, we prove [statement] is true for our base case (usually like. 0 or 1). then, we assume [statement] is true for some arbitrary n (because we know it is true for at least one of them), and prove that [statement] must also be true for n+1, so we can conclude [statement] is always true

so: we want to show that, for any group of horses of any size, they are all the same color.

step 1: prove the base case (n=1). for any group of 1 horses, obviously they are all the same color

step 2: now, assume for some arbitrary n, this statement is true (which we are allowed to do, because it is true for some n). so for any group of n horses, they are all the same color.

step 3: add one horse to our group (so it is now n+1 horses)

step 4: remove some arbitrary horse from the group. we are back to a group of n horses, which we already KNOW are all the same color. because we can do this no matter what horse we remove from our group, then we can conclude a group of n+1 horses are all the same color

I really like how the scientology speedrunning trend is developing, in this clip we see that the participants are

Not deterred by the closed door

Working as a group

Protecting their identities

Inflicting material costs to the institution via property destruction

Getting away at the end