If we can (theoretically) represent the outputs being spent by a tx as a single aggregate inclusion proof then we potentially unlink inputs from outputs entirely. The anonymity set of those inputs (outputs being spent) is the entire UTXO set at that point in time. We don’t know which outputs are being spent or even how many outputs are being spent.
This would appear to potentially address the concerns raised in https://www.youtube.com/watch?v=YgtF7psIKWg&feature=youtu.be&t=5041 around the size of the “decoy set”.