proposition: Lemma compute_finnat_ind_zero (P : forall n : nat, FinNat n -> Type) (z : forall n : nat, P n.+1 (zero_finnat n)) (s : forall (n : nat) (u : FinNat n), P n u -> P n.+1 (succ_finnat u)) (n : nat) : finnat_ind P z s (zero_finnat n) = z n.
proof: Proof. cbn. by induction (hset_path2 1 (path_zero_finnat n leq_1_Sn)). Defined.
imports: HoTT.Basics HoTT.Types HoTT.HSet HoTT.Spaces.Nat.Core HoTT.Spaces.Finite.Fin