 ZF set theory does not formalize the notion of classes, so each formula with classes must be reduced syntactically to a formula without classes.For example, one can reduce the formula formula_1 to formula_2.Semantically, in a metalanguage, the classes can be described as equivalence classes of logical formulas