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

(* Specifications: *)
Lemma rmax_t1_t2t3 : RMAX (bin n t1 (bin p t2 t3)) (bin n t1 t') q.
End RMAX_np.