Definition indprinciple_3_aux (n : nat) :=
  forall P : term -> Prop,
  (forall (a : ad) (tl : term_list),
   (forall u : term, term_list_occur u tl -> P u) -> P (app a tl)) ->
  forall t : term, term_high t <= n -> P t.

Lemma Ndouble_plus_one_inv_xI : forall (x : ad) (p : positive), Ndouble_plus_one x = Npos (xI p) -> x = Npos p.