fact: Definition le_induction' {n p} (Hp: p.+1 <= n.+1) (P: forall p (Hp: p.+1 <= n.+1), Type) (H_base: P n (♢ n.+1)) (H_step: forall p (H : p.+2 <= n.+1), P p.+1 H -> P p (↓ H)): P p Hp := le_induction (⇓ Hp) (fun p Hp => P p (⇑ Hp)) H_base (fun q Hq => H_step q (⇑ Hq)).
imports: Bonak(Notation) Bonak(LeInductive)