Mercurial > hg > Members > kono > Proof > ZF-in-agda
view Todo @ 148:6e767ad3edc2
give up
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Mon, 08 Jul 2019 19:45:59 +0900 |
parents | |
children | ac872f6b8692 |
line wrap: on
line source
Mon Jul 8 19:43:37 JST 2019 ordinal-definable.agda assumes all ZF Set are ordinals, that it too restrictive remove ord-Ord and prove with some assuption in HOD.agda union, power set, replace, inifinite