Remark rmax_1 : occ (bin n t1 (bin p t2 t3)) q.Remark rmax_2 : n < p.Remark rmax_3 : min n t'.Remark rmax_4 : search (bin n t1 t').Remark rmax_5 : n < q.Remark rmax_6 :
      forall p0 : nat, occ (bin n t1 (bin p t2 t3)) p0 -> p0 <= q.Remark rmax_7 :
      forall q' : nat,
      occ (bin n t1 t') q' -> occ (bin n t1 (bin p t2 t3)) q'.Remark rmax_8 : ~ occ (bin n t1 t') q.Remark rmax_9 :
      forall q0 : nat,
      occ (bin n t1 (bin p t2 t3)) q0 -> occ (bin n t1 t') q0 \/ q = q0.

Lemma rmax : forall t : nat_tree, search t -> binp t -> {q : nat & {t' : nat_tree | RMAX t t' q}}.