Tue Jul 23 11:02:50 JST 2019 define cardinals prove CH in OD→ZF define Ultra filter define L M : ZF ZFSet = M is an OD define L N : ZF ZFSet = N = G M (G is a generic fitler on M ) prove ¬ CH on L N prove no choice function on L N 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