Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate filter.agda @ 372:8c3b59f583f2
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 19 Jul 2020 19:14:12 +0900 |
parents | e75402b1f7d4 |
children | b4a247f9d940 |
rev | line source |
---|---|
190 | 1 open import Level |
236 | 2 open import Ordinals |
3 module filter {n : Level } (O : Ordinals {n}) where | |
4 | |
190 | 5 open import zf |
236 | 6 open import logic |
7 import OD | |
193 | 8 |
363 | 9 open import Relation.Nullary |
10 open import Relation.Binary | |
11 open import Data.Empty | |
190 | 12 open import Relation.Binary |
13 open import Relation.Binary.Core | |
363 | 14 open import Relation.Binary.PropositionalEquality |
191
9eb6a8691f02
choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
190
diff
changeset
|
15 open import Data.Nat renaming ( zero to Zero ; suc to Suc ; ℕ to Nat ; _⊔_ to _n⊔_ ) |
363 | 16 import BAlgbra |
293 | 17 |
18 open BAlgbra O | |
191
9eb6a8691f02
choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
190
diff
changeset
|
19 |
236 | 20 open inOrdinal O |
21 open OD O | |
22 open OD.OD | |
277
d9d3654baee1
seperate choice from LEM
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
276
diff
changeset
|
23 open ODAxiom odAxiom |
190 | 24 |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
25 import ODC |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
26 |
236 | 27 open _∧_ |
28 open _∨_ | |
29 open Bool | |
30 | |
295 | 31 -- Kunen p.76 and p.53, we use ⊆ |
329 | 32 record Filter ( L : HOD ) : Set (suc n) where |
191
9eb6a8691f02
choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
190
diff
changeset
|
33 field |
329 | 34 filter : HOD |
290 | 35 f⊆PL : filter ⊆ Power L |
329 | 36 filter1 : { p q : HOD } → q ⊆ L → filter ∋ p → p ⊆ q → filter ∋ q |
37 filter2 : { p q : HOD } → filter ∋ p → filter ∋ q → filter ∋ (p ∩ q) | |
191
9eb6a8691f02
choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
190
diff
changeset
|
38 |
292 | 39 open Filter |
40 | |
329 | 41 record prime-filter { L : HOD } (P : Filter L) : Set (suc (suc n)) where |
295 | 42 field |
43 proper : ¬ (filter P ∋ od∅) | |
329 | 44 prime : {p q : HOD } → filter P ∋ (p ∪ q) → ( filter P ∋ p ) ∨ ( filter P ∋ q ) |
292 | 45 |
329 | 46 record ultra-filter { L : HOD } (P : Filter L) : Set (suc (suc n)) where |
295 | 47 field |
48 proper : ¬ (filter P ∋ od∅) | |
329 | 49 ultra : {p : HOD } → p ⊆ L → ( filter P ∋ p ) ∨ ( filter P ∋ ( L \ p) ) |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
50 |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
51 open _⊆_ |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
52 |
329 | 53 trans-⊆ : { A B C : HOD} → A ⊆ B → B ⊆ C → A ⊆ C |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
54 trans-⊆ A⊆B B⊆C = record { incl = λ x → incl B⊆C (incl A⊆B x) } |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
55 |
329 | 56 power→⊆ : ( A t : HOD) → Power A ∋ t → t ⊆ A |
331 | 57 power→⊆ A t PA∋t = record { incl = λ {x} t∋x → ODC.double-neg-eilm O (t1 t∋x) } where |
329 | 58 t1 : {x : HOD } → t ∋ x → ¬ ¬ (A ∋ x) |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
59 t1 = zf.IsZF.power→ isZF A t PA∋t |
292 | 60 |
329 | 61 ∈-filter : {L p : HOD} → (P : Filter L ) → filter P ∋ p → p ⊆ L |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
62 ∈-filter {L} {p} P lt = power→⊆ L p ( incl (f⊆PL P) lt ) |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
63 |
329 | 64 ∪-lemma1 : {L p q : HOD } → (p ∪ q) ⊆ L → p ⊆ L |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
65 ∪-lemma1 {L} {p} {q} lt = record { incl = λ {x} p∋x → incl lt (case1 p∋x) } |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
66 |
329 | 67 ∪-lemma2 : {L p q : HOD } → (p ∪ q) ⊆ L → q ⊆ L |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
68 ∪-lemma2 {L} {p} {q} lt = record { incl = λ {x} p∋x → incl lt (case2 p∋x) } |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
69 |
329 | 70 q∩q⊆q : {p q : HOD } → (q ∩ p) ⊆ q |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
71 q∩q⊆q = record { incl = λ lt → proj1 lt } |
265 | 72 |
331 | 73 open HOD |
74 | |
295 | 75 ----- |
76 -- | |
77 -- ultra filter is prime | |
78 -- | |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
79 |
329 | 80 filter-lemma1 : {L : HOD} → (P : Filter L) → ∀ {p q : HOD } → ultra-filter P → prime-filter P |
295 | 81 filter-lemma1 {L} P u = record { |
82 proper = ultra-filter.proper u | |
83 ; prime = lemma3 | |
84 } where | |
329 | 85 lemma3 : {p q : HOD} → filter P ∋ (p ∪ q) → ( filter P ∋ p ) ∨ ( filter P ∋ q ) |
295 | 86 lemma3 {p} {q} lt with ultra-filter.ultra u (∪-lemma1 (∈-filter P lt) ) |
87 ... | case1 p∈P = case1 p∈P | |
88 ... | case2 ¬p∈P = case2 (filter1 P {q ∩ (L \ p)} (∪-lemma2 (∈-filter P lt)) lemma7 lemma8) where | |
331 | 89 lemma5 : ((p ∪ q ) ∩ (L \ p)) =h= (q ∩ (L \ p)) |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
90 lemma5 = record { eq→ = λ {x} lt → record { proj1 = lemma4 x lt ; proj2 = proj2 lt } |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
91 ; eq← = λ {x} lt → record { proj1 = case2 (proj1 lt) ; proj2 = proj2 lt } |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
92 } where |
331 | 93 lemma4 : (x : Ordinal ) → odef ((p ∪ q) ∩ (L \ p)) x → odef q x |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
94 lemma4 x lt with proj1 lt |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
95 lemma4 x lt | case1 px = ⊥-elim ( proj2 (proj2 lt) px ) |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
96 lemma4 x lt | case2 qx = qx |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
97 lemma6 : filter P ∋ ((p ∪ q ) ∩ (L \ p)) |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
98 lemma6 = filter2 P lt ¬p∈P |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
99 lemma7 : filter P ∋ (q ∩ (L \ p)) |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
100 lemma7 = subst (λ k → filter P ∋ k ) (==→o≡ lemma5 ) lemma6 |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
101 lemma8 : (q ∩ (L \ p)) ⊆ q |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
102 lemma8 = q∩q⊆q |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
103 |
295 | 104 ----- |
105 -- | |
106 -- if Filter contains L, prime filter is ultra | |
107 -- | |
108 | |
329 | 109 filter-lemma2 : {L : HOD} → (P : Filter L) → filter P ∋ L → prime-filter P → ultra-filter P |
296
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
110 filter-lemma2 {L} P f∋L prime = record { |
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
111 proper = prime-filter.proper prime |
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
112 ; ultra = λ {p} p⊆L → prime-filter.prime prime (lemma p p⊆L) |
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
113 } where |
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
114 open _==_ |
331 | 115 p+1-p=1 : {p : HOD} → p ⊆ L → L =h= (p ∪ (L \ p)) |
116 eq→ (p+1-p=1 {p} p⊆L) {x} lt with ODC.decp O (odef p x) | |
296
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
117 eq→ (p+1-p=1 {p} p⊆L) {x} lt | yes p∋x = case1 p∋x |
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
118 eq→ (p+1-p=1 {p} p⊆L) {x} lt | no ¬p = case2 (record { proj1 = lt ; proj2 = ¬p }) |
331 | 119 eq← (p+1-p=1 {p} p⊆L) {x} ( case1 p∋x ) = subst (λ k → odef L k ) diso (incl p⊆L ( subst (λ k → odef p k) (sym diso) p∋x )) |
296
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
120 eq← (p+1-p=1 {p} p⊆L) {x} ( case2 ¬p ) = proj1 ¬p |
329 | 121 lemma : (p : HOD) → p ⊆ L → filter P ∋ (p ∪ (L \ p)) |
296
42f89e5efb00
if Filter contains L, prime filter is ultra
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
295
diff
changeset
|
122 lemma p p⊆L = subst (λ k → filter P ∋ k ) (==→o≡ (p+1-p=1 p⊆L)) f∋L |
293 | 123 |
329 | 124 record Dense (P : HOD ) : Set (suc n) where |
269
30e419a2be24
disjunction and conjunction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
268
diff
changeset
|
125 field |
329 | 126 dense : HOD |
368 | 127 incl : dense ⊆ Power P |
329 | 128 dense-f : HOD → HOD |
368 | 129 dense-d : { p : HOD} → p ⊆ P → dense ∋ dense-f p |
130 dense-p : { p : HOD} → p ⊆ P → p ⊆ (dense-f p) | |
266 | 131 |
329 | 132 record Ideal ( L : HOD ) : Set (suc n) where |
293 | 133 field |
329 | 134 ideal : HOD |
293 | 135 i⊆PL : ideal ⊆ Power L |
329 | 136 ideal1 : { p q : HOD } → q ⊆ L → ideal ∋ p → q ⊆ p → ideal ∋ q |
137 ideal2 : { p q : HOD } → ideal ∋ p → ideal ∋ q → ideal ∋ (p ∪ q) | |
293 | 138 |
139 open Ideal | |
140 | |
329 | 141 proper-ideal : {L : HOD} → (P : Ideal L ) → {p : HOD} → Set n |
293 | 142 proper-ideal {L} P {p} = ideal P ∋ od∅ |
143 | |
329 | 144 prime-ideal : {L : HOD} → Ideal L → ∀ {p q : HOD } → Set n |
293 | 145 prime-ideal {L} P {p} {q} = ideal P ∋ ( p ∩ q) → ( ideal P ∋ p ) ∨ ( ideal P ∋ q ) |
146 | |
364 | 147 ------- |
363 | 148 -- the set of finite partial functions from ω to 2 |
149 -- | |
150 -- | |
151 | |
152 import OPair | |
153 open OPair O | |
154 | |
370 | 155 data Two : Set n where |
156 i0 : Two | |
157 i1 : Two | |
158 | |
159 record PFunc : Set (suc n) where | |
160 field | |
161 restrict : Nat → Set n | |
162 map : (x : Nat ) → restrict x → Two | |
163 | |
164 open PFunc | |
165 | |
166 record _f⊆_ (f g : PFunc) : Set (suc n) where | |
167 field | |
371 | 168 extend : (x : Nat) → (fr : restrict f x ) → restrict g x |
169 feq : (x : Nat) → (fr : restrict f x ) → map f x fr ≡ map g x (extend x fr) | |
170 | |
372 | 171 open _f⊆_ |
370 | 172 |
372 | 173 _f∩_ : (f g : PFunc) → PFunc |
174 f f∩ g = record { restrict = λ x → (restrict f x ) ∧ (restrict g x ) ∧ ((fr : restrict f x ) → (gr : restrict g x ) → map f x fr ≡ map g x gr) | |
175 ; map = λ x p → map f x (proj1 p) } | |
370 | 176 |
177 _↑_ : (Nat → Two) → Nat → PFunc | |
178 f ↑ i = record { restrict = λ x → Lift n (x ≤ i) ; map = λ x _ → f x } | |
179 | |
372 | 180 record Gf (f : Nat → Two) (p : PFunc ) : Set (suc n) where |
371 | 181 field |
182 gn : Nat | |
183 f<n : p f⊆ (f ↑ gn) | |
184 | |
372 | 185 open Gf |
186 | |
371 | 187 record F-Filter (L : Set (suc n)) (PL : (L → Set (suc n)) → Set n) ( _⊆_ : L → L → Set (suc n)) (_∩_ : L → L → L ) : Set (suc (suc n)) where |
370 | 188 field |
371 | 189 filter : L → Set (suc n) |
190 f⊆P : PL filter | |
191 filter1 : { p q : L } → filter p → p ⊆ q → filter q | |
192 filter2 : { p q : L } → filter p → filter q → filter (p ∩ q) | |
193 | |
372 | 194 GF : (Nat → Two ) → F-Filter PFunc (λ x → One) _f⊆_ _f∩_ |
371 | 195 GF f = record { |
372 | 196 filter = λ p → Gf f p |
371 | 197 ; f⊆P = OneObj |
372 | 198 ; filter1 = λ {p} {q} fp p⊆q → record { gn = gn fp ; f<n = f1 fp p⊆q } |
371 | 199 ; filter2 = λ {p} {q} fp fq → record { gn = {!!} ; f<n = {!!} } |
372 | 200 } where |
201 f1 : {p q : PFunc } → (fp : Gf f p ) → ( p⊆q : p f⊆ q ) → q f⊆ (f ↑ gn fp) | |
202 f1 {p} {q} fp p⊆q = record { extend = λ x fr → extend (f<n fp) x {!!} ; feq = λ x fr → {!!} } where | |
203 f2 : (x : Nat) → x ≤ gn fp | |
204 f2 x = ? -- extend (f<n fp) x ? | |
370 | 205 |
363 | 206 ODSuc : (y : HOD) → infinite ∋ y → HOD |
207 ODSuc y lt = Union (y , (y , y)) | |
208 | |
366 | 209 data Hω2 : (i : Nat) ( x : Ordinal ) → Set n where |
210 hφ : Hω2 0 o∅ | |
211 h0 : {i : Nat} {x : Ordinal } → Hω2 i x → | |
212 Hω2 (Suc i) (od→ord (Union ((< nat→ω i , nat→ω 0 >) , ord→od x ))) | |
213 h1 : {i : Nat} {x : Ordinal } → Hω2 i x → | |
214 Hω2 (Suc i) (od→ord (Union ((< nat→ω i , nat→ω 1 >) , ord→od x ))) | |
215 he : {i : Nat} {x : Ordinal } → Hω2 i x → | |
216 Hω2 (Suc i) x | |
217 | |
218 record Hω2r (x : Ordinal) : Set n where | |
219 field | |
220 count : Nat | |
221 hω2 : Hω2 count x | |
222 | |
223 open Hω2r | |
363 | 224 |
225 HODω2 : HOD | |
366 | 226 HODω2 = record { od = record { def = λ x → Hω2r x } ; odmax = next o∅ ; <odmax = odmax0 } where |
365 | 227 ω<next : {y : Ordinal} → infinite-d y → y o< next o∅ |
228 ω<next = ω<next-o∅ ho< | |
366 | 229 lemma : {i j : Nat} {x : Ordinal } → od→ord (Union (< nat→ω i , nat→ω j > , ord→od x)) o< next x |
230 lemma = {!!} | |
231 odmax0 : {y : Ordinal} → Hω2r y → y o< next o∅ | |
232 odmax0 {y} r with hω2 r | |
233 ... | hφ = x<nx | |
234 ... | h0 {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) (lemma {i} {0} {x}) | |
235 ... | h1 {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) (lemma {i} {1} {x}) | |
236 ... | he {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) x<nx | |
363 | 237 |
370 | 238 ω→2 : HOD |
239 ω→2 = Replace (Power infinite) (λ p p⊆i → Replace infinite (λ x i∋x → < x , repl p x > )) where | |
240 repl : HOD → HOD → HOD | |
241 repl p x with ODC.∋-p O p x | |
242 ... | yes _ = nat→ω 1 | |
243 ... | no _ = nat→ω 0 | |
368 | 244 |
370 | 245 record _↑n (f : HOD) (ω→2∋f : ω→2 ∋ f ) : Set n where |
246 -- field | |
247 -- n : HOD | |
248 -- ? : Select f (λ x f∋x → ω→nat (π1 f∋x) < ω→nat n | |
249 | |
372 | 250 -- Gf : {f : HOD} → ω→2 ∋ f → HOD |
251 -- Gf {f} lt = Select HODω2 (λ x H∋x → {!!} ) | |
368 | 252 |
253 G : (Nat → Two) → Filter HODω2 | |
254 G f = record { | |
365 | 255 filter = {!!} |
256 ; f⊆PL = {!!} | |
257 ; filter1 = {!!} | |
258 ; filter2 = {!!} | |
259 } where | |
260 filter0 : HOD | |
261 filter0 = {!!} | |
262 f⊆PL1 : filter0 ⊆ Power HODω2 | |
263 f⊆PL1 = {!!} | |
264 filter11 : { p q : HOD } → q ⊆ HODω2 → filter0 ∋ p → p ⊆ q → filter0 ∋ q | |
265 filter11 = {!!} | |
266 filter12 : { p q : HOD } → filter0 ∋ p → filter0 ∋ q → filter0 ∋ (p ∩ q) | |
267 filter12 = {!!} | |
268 | |
363 | 269 -- the set of finite partial functions from ω to 2 |
270 | |
271 Hω2f : Set (suc n) | |
272 Hω2f = (Nat → Set n) → Two | |
273 | |
274 Hω2f→Hω2 : Hω2f → HOD | |
275 Hω2f→Hω2 p = record { od = record { def = λ x → (p {!!} ≡ i0 ) ∨ (p {!!} ≡ i1 )}; odmax = {!!} ; <odmax = {!!} } | |
276 | |
277 |