How to use Logical AND operation between two sets in agda? -
i wanted proof if there m less 10 , there n less 15 there exist z less 25.
thm : ((∃ λ m → (m < 10)) , (∃ λ n → (n < 15))) -> (∃ λ z → (z < 25)) thm = ?
how define , here?? please me. , how proof this??
and
corresponds product
in agda. here is corresponding construct in standard library. in case, may want use the non-dependent version _×_
.
Comments
Post a Comment