Currently the transformations for expressions with patterns `((x & m) u<= m)` or `((m & x) u<= m)` to `true` is in BoolNode::Ideal function with a new constant node of value `1` created. However, this is technically a type-improving (reduction in range) transformation that's better suited in BoolNode::Value function.

Test cases with IR test framework should also be added to ensure such transformations are correct and in effect.