Trainhooking

Trainhooking is Brainhooking but only ONE INSTRUCTION. its also made by User:Yayimhere. the change is: loop is gone and now the +(n) is +(n)[k] which will afterwards check if the cell is negative(after applying the command. if so then jump to line n. also it has only 2 cells now

TC proof

translation from Minsky machine(Short Minsky Machine Notation) to Trainhooking:

℘xy -> +(11)[x]
℘y -> +(01)[?] the ? can be anything

the pointer shifts between the first and second register. so if you want to increment first register without changing the second one:

+(01)[1]
+(0)[1]
+(01)[1]

is this the smallest BF minimilazation?

idk. i think so