Brainfuck is not turing complete

This page is obviously a joke.

Today I will bring you a very difficult proof question. I'm willing to bet that even if all the deceased mathematicians and programming contributors around the globe were alive, they wouldn't necessarily have done it.

"Please prove that Brainfuck is not a Turing-complete programming language."

We all know three things:

1. befunge is turing complete
2. brainfuck is 1d
3. befunge is 2d

∵befunge=F

brainfuck=B

F=2D

turing-complete=T

F=T

F=2D=T

2D=T

B=1D

1D≠2D

1D≠T

∴B≠T

Join me as we prove things that are wrong right, and destroy the world one peice at a time.

If brainfuck were turing complete, 1=2

Proof

B=T

F=T

F=2D

B=1D

2D=1D

Divide both sides of the equation by D at the same time to get: 1=2