Написать функцию, которая проверяет образует ли список убывающую последовательность

(defun decreasing (w) (eval (cons '> w)))
 
> (decreasing '(3 2 1))
T
> (decreasing '(3 2 2))
NIL

(defun decreasing (w) (when w (eval (cons '> w))))
 
> (decreasing '())
NIL

(defun decreasing (w) (if w (eval (cons '> w)) t))
 
> (decreasing '())
T

(defun decreasing (w) (when w (apply #'> w)))
 
> (decreasing '(3 2 1))
T
> (decreasing '(3 2 2))
NIL
> (decreasing '())
NIL

(defun task (lst)
  (apply '> lst))
 
==> TASK
 
(task '(11 10 9 8 7))
 
==> T
 
(task '(11 10 9 8 17))
 
==> NIL

(defun task (lst)
  (cond ((null (cdr lst)) t)
        ((> (car lst) (cadr lst)) (task (cdr lst)))
        (t nil)))
 
==> TASK
(task '(11 10 9 8 17))
 
==> NIL
(task '(11 10 9 8 7))
 
==> T
 
(task '(11 10 9 8 7 7))
 
==> NIL

(defun decreasing (w)
  (cond ((null (cdr w)))
        ((> (car w) (cadr w)) (decreasing (cdr w)))
        (t nil)))
 
> (decreasing '(3 2 1))
T
> (decreasing '(3 2 2))
NIL
> (decreasing '(3))
T
> (decreasing '())
T

(defun decreasing (w)
  (if (cdr w) (when (> (car w) (cadr w)) (decreasing (cdr w))) t))
 
> (decreasing '(3 2 1))
T
> (decreasing '(3 2 2))
NIL
> (decreasing '(3))
T
> (decreasing '())
T

(defun decreasing (w)
  (when (some #'numberp w)
    (decr (remove-if-not #'numberp w))))
 
(defun decr (w)
  (cond ((null (cdr w)))
        ((> (car w) (cadr w)) (decr (cdr w)))
        (t nil)))
 
> (decreasing '(a 3 b 2 c 1 d))
T
> (decreasing '(a 3 b 2 c 2 d))
NIL
> (decreasing '(3))
T
> (decreasing '(a))
NIL
> (decreasing '())
NIL

(defun task (lst)
  (apply '> (remove-if-not 'numberp lst)))