Eviledon/Turing-completeness proof

Here's a proof of Turing-completeness of Eviledon.

We can make a Brainfuck-to-Eviledon compiler using:

Chimpanzini Bananini Tung Tung Tung Sahur Sahur Sahur Sahur Sahur
Lirili Larila Sahur
 Tralalero Tralala Bombardotto Aquilotto
 Tralalero Tralala Tung Sahur
 Ballerina Cappucina -
 Tralalero Tralala Sahur
Bananita Dolfinita

as the start of the program,

Tralalero Tralala Sahur
Ballerina Cappucina +
Bombardilo Crocodilo
Tralalero Tralala Bombardotto Aquilotto
Bombardilo Crocodilo

as the > instruction,

Bombardilo Crocodilo
Tralalero Tralala Sahur
Ballerina Cappucina +
Bombardilo Crocodilo
Tralalero Tralala Bombardotto Aquilotto

as the < instruction,

Tralalero Tralala Tung Sahur
Ballerina Cappucina +
Tralalero Tralala Bombardotto Aquilotto

as the + instruction,

Tralalero Tralala Tung Sahur
Ballerina Cappucina -
Tralalero Tralala Bombardotto Aquilotto

as the - instruction,

Tralalero Tralala Bombombini Gusini
Ballerina Cappucina -
Frigo Camelo Brr Brr Patapim Bombombini Gusini

as the , instruction,

Lavacca Saturno Saturnita Bombombini Gusini Brr Brr Patapim

as the . instruction and

Cappucino Assasino Sahur
 #stuff#
Bananita Dolfinita

as the [] loops.