Another proof of the strong completeness of the intuitionistic fuzzy logic
Mitio Takano · Tsukuba Journal of Mathematics · 1987
5. $\forall x(CA(x))\Rightarrow C\forall xA(x)$ , wherewhere $p$ is any propositional variable not occurring in the lower sequent.We call that system $TT^{-}$ which is obtained from TT by deleting Extra Inference Rule for TT.