Definition simple_t := neg (conj (disj top bot) (neg bot)). Local Lemma l1: geval bool_algebra tt top = true. Proof. apply idpath. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.Combinatorics.StandardFiniteSets. Require Import UniMath.Combinatorics.MoreLists. Require Import UniMath.Algebra.Universal.TermAlgebras. Require Import UniMath.Algebra.Universal.Examples.Nat. Require Import UniMath.Algebra.Universal.Examples.Bool. Import UniMath.Algebra.Universal.Examples.Bool.GTerm.