apply Or.inr
case cons.succ.succ
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 i : Nat
hps : ps = drop (i + 1) (t :: take j l)
⊢ t ∨ orN l
case cons.succ.succ.h
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 i : Nat
hps : ps = drop (i + 1) (t :: take j l)
⊢ orN l