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

comparison Todo @ 338:bca043423554

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
...
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Sun, 12 Jul 2020 12:32:42 +0900
parents ac872f6b8692
children 9984cdd88da3
comparison
equal deleted inserted replaced
337:de2c472bcbcd 338:bca043423554
1 Tue Jul 23 11:02:50 JST 2019 1 Tue Jul 23 11:02:50 JST 2019
2 2
3 define cardinals 3 define cardinals
4 prove CH in OD→ZF 4 prove CH in OD→ZF
5 define Ultra filter 5 define Ultra filter ... done
6 define L M : ZF ZFSet = M is an OD 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 ) 7 define L N : ZF ZFSet = N = G M (G is a generic fitler on M )
8 prove ¬ CH on L N 8 prove ¬ CH on L N
9 prove no choice function on L N 9 prove no choice function on L N
10 10
11 Mon Jul 8 19:43:37 JST 2019 11 Mon Jul 8 19:43:37 JST 2019
12 12
13 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 ... fixed
14 14
15 remove ord-Ord and prove with some assuption in HOD.agda 15 remove ord-Ord and prove with some assuption in HOD.agda
16 union, power set, replace, inifinite 16 union, power set, replace, inifinite