Goal:
  
  A : Type
  i : positive
  x : A
  IHi : forall (m : tree' A) (j : positive),
        i <> j -> get' i (set' j x m) = get' i m
  m : tree' A
  j : positive
  H : xI i <> xI j
  ============================
   (i <> j)


DEBUG:Going to execute:
congruence
DEBUG LTAC Evaluated term: gso0