If I would have a formula A in propositional logic that is the disjunciton of $2$ formulas A$1$ OR A$2,$ and

the number of nodes, not including terminal nodes, of the $($RO$)$BDD for A$1$ is N$1$ and the number of nodes for $($RO$)$BDD for A$2$ is N$2.$

Could we affirm that the size of the $($RO$)$BDD for formula A $($A$1$ OR A$2)$ be greater than or equal to N$1+$ N$2?$