The discernibility matrix acts as an efficient tool to determine decision-making problems. The discernibility matrix enhances both the logical and theoretical knowledge of an information system. Also, it evaluated the boolean function for enhancing its relevant properties. In this paper, a granular lattice has been discussed to define a consistent set, based on object-oriented concepts. An ordered pair of attributes and objects was constructed to determine the granular lattice using indiscernibility relation. We have introduced two sets, namely the maximum and minimum sets to analyze the indiscernibility object. The indiscernibility object investigates the upper approximation space and extended its effectiveness towards maximum and minimum sets. Furthermore, the properties of the maximum set and minimum set are classified using the granularity concept. An equivalency condition is framed by the maximum set and its results are examined with the help of some theorems and lemma.