Having trouble wrapping my head around how to prove this. My first question about this is what it means for the tree method to determine that the set of sentences implies A. I'm taking it to mean that if we apply the tree method with every sentence in T and -A as inputs, then after the tree is finished, there are no open paths? Is this the correct way to unpack the original assumption?
From there, i'm confused as to where to go. Using the definition I wasn't sure about, my first thought was to try a proof by contradiction and show that there couldn't possibly be an open path if the truth tree method determines T implies A, but i'm not sure how to show this. Any help/insight would be greatly appreciated. Thanks in advance!