Mercurial > hg > Members > kono > Proof > ZF-in-agda
diff filter.agda @ 287:5de8905a5a2b
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 07 Jun 2020 20:29:12 +0900 |
parents | d9d3654baee1 |
children | ef93c56ad311 |
line wrap: on
line diff
--- a/filter.agda Sun May 10 09:25:18 2020 +0900 +++ b/filter.agda Sun Jun 07 20:29:12 2020 +0900 @@ -43,8 +43,11 @@ open Filter +L⊆L : (L : OD) → L ⊆ L +L⊆L L = record { incl = λ {x} lt → lt } + L-filter : {L : OD} → (P : Filter L ) → {p : OD} → filter P ∋ p → filter P ∋ L -L-filter {L} P {p} lt = filter1 P {p} {L} {!!} lt {!!} +L-filter {L} P {p} lt = filter1 P {p} {L} (L⊆L L) lt {!!} prime-filter : {L : OD} → Filter L → ∀ {p q : OD } → Set n prime-filter {L} P {p} {q} = filter P ∋ ( p ∪ q) → ( filter P ∋ p ) ∨ ( filter P ∋ q ) @@ -83,7 +86,7 @@ import ordinal -- open ordinal.C-Ordinal-with-choice - + -- both Power and infinite is too ZF, it is better to use simpler one Hω2 : Filter (Power (Power infinite)) Hω2 = {!!}