Mercurial > hg > Members > kono > Proof > ZF-in-agda

comparison Todo @ 187:ac872f6b8692

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
add Todo
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Tue, 23 Jul 2019 11:08:24 +0900
parents 6e767ad3edc2
children bca043423554
comparison
equal deleted inserted replaced
186:914cc522c53a 187:ac872f6b8692
1 Tue Jul 23 11:02:50 JST 2019
2
3 define cardinals
4 prove CH in OD→ZF
5 define Ultra filter
6 define L M : ZF ZFSet = M is an OD
7 define L N : ZF ZFSet = N = G M (G is a generic fitler on M )
8 prove ¬ CH on L N
9 prove no choice function on L N
10
1 Mon Jul 8 19:43:37 JST 2019 11 Mon Jul 8 19:43:37 JST 2019
2 12
3 ordinal-definable.agda assumes all ZF Set are ordinals, that it too restrictive 13 ordinal-definable.agda assumes all ZF Set are ordinals, that it too restrictive
4 14
5 remove ord-Ord and prove with some assuption in HOD.agda 15 remove ord-Ord and prove with some assuption in HOD.agda