Goal:
  
  A : Type
  i : positive
  IHi : forall (j : positive) (m : tree' A),
        i <> j -> get i (rem' j m) = get' i m
  j : positive
  m1 : tree' A
  m2 : tree' A
  H : xI i <> xO j
  ============================
   (get (xI i) (Node (rem' j m1) None (Nodes m2)) = get' i m2)


DEBUG:Going to execute:
congruence