simp only [hps, orN_cons, drop_zero] at hp
case cons.succ.zero
t : Prop
l : List Prop
ih : ∀ {ps : List Prop} {i j : Nat}, orN ps → ps = drop i (take j l) → orN l
ps : List Prop
hp : orN ps
j : Nat
hps : ps = drop 0 (t :: take j l)
⊢ t ∨ orN l
case cons.succ.zero
t : Prop
l : List Prop
ih : ∀ {ps : List Prop} {i j : Nat}, orN ps → ps = drop i (take j l) → orN l
ps : List Prop
j : Nat
hps : ps = drop 0 (t :: take j l)
hp : t ∨ orN (take j l)
⊢ t ∨ orN l