exact anyPairM_loop_cons_zero a x p h 0
α : Type u
β : Type v
m : Type → Type v
inst✝¹ : Monad m
inst✝ : LawfulMonad m
a : α
x : Array α
p : α → α → m Bool
stop : Nat
h : stop ≤ size x
⊢ anyPairM.loop (cons a x) p (stop + 1) (_ : Nat.succ stop ≤ Nat.succ (size x)) 0 (0 + 1) (_ : 0 < Nat.succ 0) = do
    let b ← anyM (p a) x 0 stop
    if b = true then pure true else anyPairM.loop x p stop h 0 (0 + 1) (_ : 0 < Nat.succ 0)
no goals