Modelling an IF-THEN statement with multiple conditions in Mixed Integer Linear Programming (MILP)

I need some help modelling the following logic as a mixed integer linear programming constraints for a vehicle routing problem.

The Variables involved are the following:

1. X_ij, SDV_lmj, and MDV_hkbj are binary decision variables. They equal to 1 when a certain link (ij) or route/path (lmj or hkbj) is passed.
2. SOC^L_i and SOC_j^R are both system variables and are continuous between 0 and 100, that represent the state of charge of a vehicle which determines its travelling range at a particular node.

Indices

All indices (i,j,l,m,h,k,b) pertain to nodes in a network and refer to distinct nodes when used within a particular constraint. indices i and j will be the focus of my problem.

Logic

IF (X_ij = 1 AND (SDV_lmj = MDV_hkbj = 0) THEN (SOC^L_i = SOC_j^R).

When this logic does not hold true, I want the values for SOC^L_i and SOC_j^R to be non-binding.

Additional notes on other current constraints that might shed more light (no need for help on these).

1. SDV_lmj + MDV_hkbj <= 1 for all j
2. SDV_lmj or MDV_hkbj can only be = 1 if X_ij = 1 for all nodes j. But X_ij can be = 1 even if both SDV_lmj and MDV_hkbj are = 0. (I have this down already. Just providing more context for the logic im trying to achieve)

What I have so far...

(1) SOC^L_i <= SOC_j^R + BigM(1-X_ij)

(2) SOC^L_i => SOC_j^R - BigM(1-X_ij)

(3) SDV_lmj+MDV_hkbj<=1

(4) SDV_lmj+MDV_hkbj<= X_ij

The problem with this current formulation however, is that when (SDV_lmj + MDV_hkbj) = 1, X_ij must be equal to 1 based on constraint (4), which multiplies the BigM in constraints (1) and (2) by zero, effectively binding the values SOC^L_i to equal SOC_j^R which I am trying to avoid.

Any help would be much appreciated.