Goal:
  
  n : t
  a : t
  l : list t
  IHl : forall m : t, n <= m \/ Exists (le n) l -> n <= fold_left max l m
  m : t
  H0 : n <= a
  ============================
   (n <= a)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]