proposition: Lemma negweqstnsn0 (n : nat) : ¬ (⟦S n⟧ ≃ stn O).
proof: Proof. unfold neg. assert (lp: ⟦S n⟧) by apply lastelement. intro X. apply weqstn0toempty. apply (pr1 X lp). Defined.
imports: UniMath.Foundations.NaturalNumbers UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.NegativePropositions