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