Ah, true. So, what if we just pass only some resources from the ptx in and apply the checks to them only? It won’t support all possible checks (namely, we can’t check that the partial transaction doesn’t include something or some statement holds for all resources in a ptx), but it seems that it is a good enough subset, at least for now (discussed in more details here: Forall / negative checks in resource logics). If logics contain statements “there must be a resource in the ptx that satisfies x”, whoever creates the proof will have to provide all the sufficient resources from the ptx to have the logic return true