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

Popular posts from this blog

facebook - android ACTION_SEND to share with specific application only -

python - Creating a new virtualenv gives a permissions error -

javascript - cocos2d-js draw circle not instantly -