\lambda H:n=n.\lambda g:(?\to (le n 0))\to True.(g \lambda f.(f n H))
###### INTERPRETATION NUMBER 1 ######
### (* disambiguation environment *)
-alias id True = cic:/Coq/Init/Logic/True.ind#1/1
-alias id le = cic:/Coq/Init/Peano/le.ind#1/1
-alias id nat = cic:/Coq/Init/Datatypes/nat.ind#1/1
+alias id True = cic:/Coq/Init/Logic/True.ind#xpointer(1/1)
+alias id le = cic:/Coq/Init/Peano/le.ind#xpointer(1/1)
+alias id nat = cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)
alias num (instance 0) = "natural number"
alias symbol "eq" (instance 0) = "leibnitz's equality"
### (* METASENV after disambiguation *)