Considering the complexity classes $NP$, $co-NP$ and $PP$:$NP$ and $co-NP$ are both contained in $PP$.For any Language $L$ suppose we have the mechanism that: If the oracle of $co-NP$ implies $No$ on a modified version of $L$ (lets call it $L'$), then that we can be certain that for every run of $PP$ on $L$ would return $No$.Does that imply something about the complexity of $PP$/$coPP$ (as $PP$ and $coPP$ are same) vs. $coNP$?Wouldn't that mean $PP \subseteq coNP$ ? 
Query regarding PP complexity class vs NP?
complexity theory;complexity classes