We define a function f':P(M)->M such that f'(A) is a meme simultaneously making fun of all memes in the set A.
We extend F transfinitely by defining F(l) where l is a limit ordinal to be f'(A) where A is the union of F(a) for a < l.
A place for majestic STEMLORD peacocking, as well as memes about the realities of working in a lab.

Rules
This is a science community. We use the Dawkins definition of meme.
We define a function f':P(M)->M such that f'(A) is a meme simultaneously making fun of all memes in the set A.
We extend F transfinitely by defining F(l) where l is a limit ordinal to be f'(A) where A is the union of F(a) for a < l.
I like your funny words, magic man
It seems possible that there might also be finite closed rings of memes that all make fun of another. In this case there would be no normiest meme, and dankness would not be well-ordered.
Oddly enough, if you take the derivative of f, you get the constant function 0.
Many interpret this to mean that "all memes are derivative", which is true, but not the cause.
The real cause is that the value of any given meme is equal to the value of any other given meme. Doesn't matter which one you look at, they all fail to make you laugh.