Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate generic-filter.agda @ 392:55f44ec2a0c6
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sat, 25 Jul 2020 17:36:27 +0900 |
parents | e98b5774d180 |
children | 43b0a6ca7602 |
rev | line source |
---|---|
190 | 1 open import Level |
236 | 2 open import Ordinals |
387 | 3 module generic-filter {n : Level } (O : Ordinals {n}) where |
236 | 4 |
387 | 5 import filter |
190 | 6 open import zf |
236 | 7 open import logic |
387 | 8 open import partfunc {n} O |
236 | 9 import OD |
193 | 10 |
363 | 11 open import Relation.Nullary |
12 open import Relation.Binary | |
13 open import Data.Empty | |
190 | 14 open import Relation.Binary |
15 open import Relation.Binary.Core | |
363 | 16 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
|
17 open import Data.Nat renaming ( zero to Zero ; suc to Suc ; ℕ to Nat ; _⊔_ to _n⊔_ ) |
363 | 18 import BAlgbra |
293 | 19 |
20 open BAlgbra O | |
191
9eb6a8691f02
choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
190
diff
changeset
|
21 |
236 | 22 open inOrdinal O |
23 open OD O | |
24 open OD.OD | |
277
d9d3654baee1
seperate choice from LEM
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
276
diff
changeset
|
25 open ODAxiom odAxiom |
190 | 26 |
294
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
27 import ODC |
4340ffcfa83d
ultra-filter P → prime-filter P done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
293
diff
changeset
|
28 |
387 | 29 open filter O |
30 | |
236 | 31 open _∧_ |
32 open _∨_ | |
33 open Bool | |
34 | |
265 | 35 |
331 | 36 open HOD |
37 | |
379 | 38 ------- |
39 -- the set of finite partial functions from ω to 2 | |
40 -- | |
41 -- | |
42 | |
392 | 43 open import Data.List hiding (filter) |
387 | 44 open import Data.Maybe |
379 | 45 |
46 import OPair | |
47 open OPair O | |
48 | |
49 open PFunc | |
50 | |
387 | 51 _f∩_ : (f g : PFunc (Lift n Nat) (Lift n Two) ) → PFunc (Lift n Nat) (Lift n Two) |
52 f f∩ g = record { dom = λ x → (dom f x ) ∧ (dom g x ) ∧ ((fr : dom f x ) → (gr : dom g x ) → pmap f x fr ≡ pmap g x gr) | |
53 ; pmap = λ x p → pmap f x (proj1 p) ; meq = meq f } | |
381 | 54 |
387 | 55 _↑_ : (Nat → Two) → Nat → PFunc (Lift n Nat) (Lift n Two) |
56 _↑_ f i = record { dom = λ x → Lift n (lower x ≤ i) ; pmap = λ x _ → lift (f (lower x)) ; meq = λ {x} {p} {q} → refl } | |
381 | 57 |
387 | 58 record _f⊆_ (f g : PFunc (Lift n Nat) (Lift n Two) ) : Set (suc n) where |
59 field | |
60 extend : {x : Nat} → (fr : dom f (lift x) ) → dom g (lift x ) | |
61 feq : {x : Nat} → {fr : dom f (lift x) } → pmap f (lift x) fr ≡ pmap g (lift x) (extend fr) | |
381 | 62 |
387 | 63 open _f⊆_ |
64 open import Data.Nat.Properties | |
375
8cade5f660bd
Select : (X : HOD ) → ((x : HOD ) → X ∋ x → Set n ) → HOD does not work
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
374
diff
changeset
|
65 |
363 | 66 ODSuc : (y : HOD) → infinite ∋ y → HOD |
67 ODSuc y lt = Union (y , (y , y)) | |
68 | |
366 | 69 data Hω2 : (i : Nat) ( x : Ordinal ) → Set n where |
70 hφ : Hω2 0 o∅ | |
71 h0 : {i : Nat} {x : Ordinal } → Hω2 i x → | |
72 Hω2 (Suc i) (od→ord (Union ((< nat→ω i , nat→ω 0 >) , ord→od x ))) | |
73 h1 : {i : Nat} {x : Ordinal } → Hω2 i x → | |
74 Hω2 (Suc i) (od→ord (Union ((< nat→ω i , nat→ω 1 >) , ord→od x ))) | |
75 he : {i : Nat} {x : Ordinal } → Hω2 i x → | |
76 Hω2 (Suc i) x | |
77 | |
78 record Hω2r (x : Ordinal) : Set n where | |
79 field | |
80 count : Nat | |
81 hω2 : Hω2 count x | |
82 | |
83 open Hω2r | |
363 | 84 |
85 HODω2 : HOD | |
366 | 86 HODω2 = record { od = record { def = λ x → Hω2r x } ; odmax = next o∅ ; <odmax = odmax0 } where |
365 | 87 ω<next : {y : Ordinal} → infinite-d y → y o< next o∅ |
88 ω<next = ω<next-o∅ ho< | |
366 | 89 lemma : {i j : Nat} {x : Ordinal } → od→ord (Union (< nat→ω i , nat→ω j > , ord→od x)) o< next x |
90 lemma = {!!} | |
91 odmax0 : {y : Ordinal} → Hω2r y → y o< next o∅ | |
92 odmax0 {y} r with hω2 r | |
93 ... | hφ = x<nx | |
94 ... | h0 {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) (lemma {i} {0} {x}) | |
95 ... | h1 {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) (lemma {i} {1} {x}) | |
96 ... | he {i} {x} t = next< (odmax0 record { count = i ; hω2 = t }) x<nx | |
363 | 97 |
387 | 98 3→Hω2 : List (Maybe Two) → HOD |
385 | 99 3→Hω2 t = list→hod t 0 where |
387 | 100 list→hod : List (Maybe Two) → Nat → HOD |
385 | 101 list→hod [] _ = od∅ |
387 | 102 list→hod (just i0 ∷ t) i = Union (< nat→ω i , nat→ω 0 > , ( list→hod t (Suc i) )) |
103 list→hod (just i1 ∷ t) i = Union (< nat→ω i , nat→ω 1 > , ( list→hod t (Suc i) )) | |
104 list→hod (nothing ∷ t) i = list→hod t (Suc i ) | |
385 | 105 |
387 | 106 Hω2→3 : (x : HOD) → HODω2 ∋ x → List (Maybe Two) |
385 | 107 Hω2→3 x = lemma where |
387 | 108 lemma : { y : Ordinal } → Hω2r y → List (Maybe Two) |
385 | 109 lemma record { count = 0 ; hω2 = hφ } = [] |
387 | 110 lemma record { count = (Suc i) ; hω2 = (h0 hω3) } = just i0 ∷ lemma record { count = i ; hω2 = hω3 } |
111 lemma record { count = (Suc i) ; hω2 = (h1 hω3) } = just i1 ∷ lemma record { count = i ; hω2 = hω3 } | |
112 lemma record { count = (Suc i) ; hω2 = (he hω3) } = nothing ∷ lemma record { count = i ; hω2 = hω3 } | |
385 | 113 |
370 | 114 ω→2 : HOD |
379 | 115 ω→2 = Replace (Power infinite) (λ p → Replace infinite (λ x → < x , repl p x > )) where |
370 | 116 repl : HOD → HOD → HOD |
117 repl p x with ODC.∋-p O p x | |
118 ... | yes _ = nat→ω 1 | |
119 ... | no _ = nat→ω 0 | |
368 | 120 |
385 | 121 ω→2f : (x : HOD) → ω→2 ∋ x → Nat → Two |
122 ω→2f x = {!!} | |
123 | |
124 ↑n : (f n : HOD) → ((ω→2 ∋ f ) ∧ (infinite ∋ n)) → HOD | |
125 ↑n f n lt = 3→Hω2 ( ω→2f f (proj1 lt) 3↑ (ω→nat n (proj2 lt) )) | |
126 | |
363 | 127 |
386 | 128 record CountableOrdinal : Set (suc (suc n)) where |
129 field | |
130 ctl→ : Nat → Ordinal | |
131 ctl← : Ordinal → Nat | |
132 ctl-iso→ : { x : Ordinal } → ctl→ (ctl← x ) ≡ x | |
133 ctl-iso← : { x : Nat } → ctl← (ctl→ x ) ≡ x | |
388 | 134 |
135 record CountableHOD : Set (suc (suc n)) where | |
136 field | |
390 | 137 mhod : HOD |
138 mtl→ : Nat → Ordinal | |
139 mtl→∈P : (i : Nat) → odef mhod (mtl→ i) | |
140 mtl← : (x : Ordinal) → odef mhod x → Nat | |
141 mtl-iso→ : { x : Ordinal } → (lt : odef mhod x ) → mtl→ (mtl← x lt ) ≡ x | |
142 mtl-iso← : { x : Nat } → mtl← (mtl→ x ) (mtl→∈P x) ≡ x | |
388 | 143 |
386 | 144 |
387 | 145 open CountableOrdinal |
388 | 146 open CountableHOD |
387 | 147 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
148 PGHOD : (i : Nat) → (C : CountableOrdinal) → (P : HOD) → (p : Ordinal) → HOD |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
149 PGHOD i C P p = record { od = record { def = λ x → odef P x ∧ odef (ord→od (ctl→ C i)) x ∧ ( (y : Ordinal ) → odef (ord→od p) y → odef (ord→od x) y ) } |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
150 ; odmax = odmax P ; <odmax = λ {y} lt → <odmax P (proj1 lt) } |
388 | 151 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
152 next-p : (C : CountableOrdinal) (P : HOD ) (i : Nat) → (p : Ordinal) → Ordinal |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
153 next-p C P i p with ODC.decp O ( PGHOD i C P p =h= od∅ ) |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
154 next-p C P i p | yes y = p |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
155 next-p C P i p | no not = od→ord (ODC.minimal O (PGHOD i C P p ) not) |
387 | 156 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
157 find-p : (C : CountableOrdinal) (P : HOD ) (i : Nat) → (x : Ordinal) → Ordinal |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
158 find-p C P Zero x = x |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
159 find-p C P (Suc i) x = find-p C P i ( next-p C P i x ) |
388 | 160 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
161 record PDN (C : CountableOrdinal) (P : HOD ) (x : Ordinal) : Set n where |
388 | 162 field |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
163 gr : Nat |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
164 pn<gr : (y : Ordinal) → odef (ord→od x) y → odef (ord→od (find-p C P gr o∅)) y |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
165 px∈ω : odef P x |
388 | 166 |
167 open PDN | |
386 | 168 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
169 PDHOD : (C : CountableOrdinal) → (P : HOD ) → HOD |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
170 PDHOD C P = record { od = record { def = λ x → PDN C P x } |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
171 ; odmax = odmax (Power P) ; <odmax = {!!} } where |
388 | 172 |
173 -- | |
174 -- p 0 ≡ ∅ | |
175 -- p (suc n) = if ∃ q ∈ ord→od ( ctl→ n ) ∧ p n ⊆ q → q | |
176 --- else p n | |
386 | 177 |
391
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
178 P-GenericFilter : (C : CountableOrdinal) → (P : HOD ) → GenericFilter P |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
179 P-GenericFilter C P = record { |
e98b5774d180
generic filter defined
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
390
diff
changeset
|
180 genf = record { filter = PDHOD C P ; f⊆PL = {!!} ; filter1 = {!!} ; filter2 = {!!} } |
386 | 181 ; generic = λ D → {!!} |
182 } | |
392 | 183 |
184 open GenericFilter | |
185 open Filter | |
186 | |
187 record Incompatible (P : HOD ) : Set (suc (suc n)) where | |
188 field | |
189 except : HOD → ( HOD ∧ HOD ) | |
190 incompatible : { p : HOD } → P ∋ p → P ∋ proj1 (except p ) → P ∋ proj2 (except p ) | |
191 → ( p ⊆ proj1 (except p) ) ∧ ( p ⊆ proj2 (except p) ) | |
192 → ∀ ( r : HOD ) → P ∋ r → ¬ (( proj1 (except p) ⊆ r ) ∧ ( proj2 (except p) ⊆ r )) | |
193 | |
194 lemma725 : (M : CountableHOD ) (C : CountableOrdinal) (P : HOD ) → mhod M ∋ P | |
195 → Incompatible P → ¬ ( mhod M ∋ filter ( genf ( P-GenericFilter C P ))) | |
196 lemma725 = {!!} | |
197 | |
198 lemma725-1 : Incompatible HODω2 | |
199 lemma725-1 = {!!} | |
200 | |
201 lemma726 : (C : CountableOrdinal) (P : HOD ) | |
202 → Union ( filter ( genf ( P-GenericFilter C HODω2 ))) =h= ω→2 | |
203 lemma726 = {!!} | |
204 | |
205 -- | |
206 -- val x G = { val y G | ∃ p → G ∋ p → x ∋ < y , p > } | |
207 -- | |
208 | |
209 | |
210 | |
211 |