I just want to make sure I’m thinking about this right. I did a game where one rule said if H is in, G is not. And another rule said if J is not in, S is in. So when diagramming, if the slash is through the right variable (necessary condition) it’s always true that both can be out but both can’t be in. If the slash is through the left (sufficient condition) it’s always true that both can be in but both can’t be out (at least one must be in). Right? I tend to make reversal mistakes so I’m trying to make sure I fully understand.