|
1200
|
1 {-# OPTIONS --allow-unsolved-metas #-}
|
|
1244
|
2 import Level
|
|
431
|
3 open import Ordinals
|
|
1242
|
4 module generic-filter {n : Level.Level } (O : Ordinals {n}) where
|
|
431
|
5
|
|
1244
|
6 import filter
|
|
431
|
7 open import zf
|
|
|
8 open import logic
|
|
|
9 -- open import partfunc {n} O
|
|
1244
|
10 import OD
|
|
431
|
11
|
|
1244
|
12 open import Relation.Nullary
|
|
|
13 open import Relation.Binary
|
|
|
14 open import Data.Empty
|
|
431
|
15 open import Relation.Binary
|
|
|
16 open import Relation.Binary.Core
|
|
|
17 open import Relation.Binary.PropositionalEquality
|
|
1244
|
18 open import Data.Nat
|
|
|
19 import BAlgebra
|
|
431
|
20
|
|
1124
|
21 open BAlgebra O
|
|
431
|
22
|
|
|
23 open inOrdinal O
|
|
|
24 open OD O
|
|
|
25 open OD.OD
|
|
|
26 open ODAxiom odAxiom
|
|
|
27 import OrdUtil
|
|
|
28 import ODUtil
|
|
|
29 open Ordinals.Ordinals O
|
|
|
30 open Ordinals.IsOrdinals isOrdinal
|
|
|
31 open Ordinals.IsNext isNext
|
|
|
32 open OrdUtil O
|
|
|
33 open ODUtil O
|
|
|
34
|
|
|
35
|
|
|
36 import ODC
|
|
|
37
|
|
|
38 open filter O
|
|
|
39
|
|
|
40 open _∧_
|
|
|
41 open _∨_
|
|
|
42 open Bool
|
|
|
43
|
|
|
44
|
|
|
45 open HOD
|
|
|
46
|
|
|
47 -------
|
|
|
48 -- the set of finite partial functions from ω to 2
|
|
|
49 --
|
|
|
50 --
|
|
|
51
|
|
|
52 open import Data.List hiding (filter)
|
|
1244
|
53 open import Data.Maybe
|
|
431
|
54
|
|
1218
|
55 open import ZProduct O
|
|
431
|
56
|
|
1242
|
57 record CountableModel : Set (Level.suc (Level.suc n)) where
|
|
431
|
58 field
|
|
461
|
59 ctl-M : HOD
|
|
1242
|
60 ctl→ : ℕ → Ordinal
|
|
1244
|
61 ctl<M : (x : ℕ) → odef (ctl-M) (ctl→ x)
|
|
1242
|
62 ctl← : (x : Ordinal )→ odef (ctl-M ) x → ℕ
|
|
1244
|
63 ctl-iso→ : { x : Ordinal } → (lt : odef (ctl-M) x ) → ctl→ (ctl← x lt ) ≡ x
|
|
1248
|
64 TC : {x y : Ordinal} → odef ctl-M x → odef (* x) y → odef ctl-M y
|
|
1249
|
65 is-model : (x : HOD) → & x o< & ctl-M → ctl-M ∋ (x ∩ ctl-M)
|
|
1174
|
66 -- we have no otherway round
|
|
1242
|
67 -- ctl-iso← : { x : ℕ } → ctl← (ctl→ x ) (ctl<M x) ≡ x
|
|
446
|
68 --
|
|
|
69 -- almmost universe
|
|
|
70 -- find-p contains ∃ x : Ordinal → x o< & M → ∀ r ∈ M → ∈ Ord x
|
|
1244
|
71 --
|
|
436
|
72
|
|
1244
|
73 -- we expect P ∈ * ctl-M ∧ G ⊆ L ⊆ Power P , ¬ G ∈ * ctl-M,
|
|
434
|
74
|
|
1244
|
75 open CountableModel
|
|
431
|
76
|
|
|
77 ----
|
|
|
78 -- a(n) ∈ M
|
|
1239
|
79 -- ∃ q ∈ L ⊆ Power P → q ∈ a(n) ∧ p(n) ⊆ q
|
|
431
|
80 --
|
|
1242
|
81 PGHOD : (i : ℕ) (L : HOD) (C : CountableModel ) → (p : Ordinal) → HOD
|
|
457
|
82 PGHOD i L C p = record { od = record { def = λ x →
|
|
1239
|
83 odef L x ∧ odef (* (ctl→ C i)) x ∧ ( (y : Ordinal ) → odef (* p) y → odef (* x) y ) }
|
|
1244
|
84 ; odmax = odmax L ; <odmax = λ {y} lt → <odmax L (proj1 lt) }
|
|
431
|
85
|
|
|
86 ---
|
|
1239
|
87 -- p(n+1) = if ({q | q ∈ a(n) ∧ p(n) ⊆ q)} != ∅ then q otherwise p(n)
|
|
1244
|
88 --
|
|
1242
|
89 find-p : (L : HOD ) (C : CountableModel ) (i : ℕ) → (x : Ordinal) → Ordinal
|
|
|
90 find-p L C zero x = x
|
|
|
91 find-p L C (suc i) x with is-o∅ ( & ( PGHOD i L C (find-p L C i x)) )
|
|
457
|
92 ... | yes y = find-p L C i x
|
|
|
93 ... | no not = & (ODC.minimal O ( PGHOD i L C (find-p L C i x)) (λ eq → not (=od∅→≡o∅ eq))) -- axiom of choice
|
|
431
|
94
|
|
|
95 ---
|
|
1239
|
96 -- G = { r ∈ L ⊆ Power P | ∃ n → r ⊆ p(n) }
|
|
431
|
97 --
|
|
457
|
98 record PDN (L p : HOD ) (C : CountableModel ) (x : Ordinal) : Set n where
|
|
431
|
99 field
|
|
1242
|
100 gr : ℕ
|
|
1244
|
101 pn<gr : (y : Ordinal) → odef (* x) y → odef (* (find-p L C gr (& p))) y
|
|
457
|
102 x∈PP : odef L x
|
|
431
|
103
|
|
|
104 open PDN
|
|
|
105
|
|
|
106 ---
|
|
|
107 -- G as a HOD
|
|
|
108 --
|
|
457
|
109 PDHOD : (L p : HOD ) (C : CountableModel ) → HOD
|
|
|
110 PDHOD L p C = record { od = record { def = λ x → PDN L p C x }
|
|
1244
|
111 ; odmax = odmax L ; <odmax = λ {y} lt → <odmax L {y} (PDN.x∈PP lt) }
|
|
431
|
112
|
|
|
113 open PDN
|
|
|
114
|
|
|
115 ----
|
|
1242
|
116 -- Generic Filter on Power P for HOD's Countable Ordinal (G ⊆ Power P ≡ G i.e. ℕ → P → Set )
|
|
431
|
117 --
|
|
|
118 -- p 0 ≡ ∅
|
|
434
|
119 -- p (suc n) = if ∃ q ∈ M ∧ p n ⊆ q → q (by axiom of choice) ( q = * ( ctl→ n ) )
|
|
431
|
120 --- else p n
|
|
|
121
|
|
|
122 P∅ : {P : HOD} → odef (Power P) o∅
|
|
|
123 P∅ {P} = subst (λ k → odef (Power P) k ) ord-od∅ (lemma o∅ o∅≡od∅) where
|
|
|
124 lemma : (x : Ordinal ) → * x ≡ od∅ → odef (Power P) (& od∅)
|
|
|
125 lemma x eq = power← P od∅ (λ {x} lt → ⊥-elim (¬x<0 lt ))
|
|
|
126 x<y→∋ : {x y : Ordinal} → odef (* x) y → * x ∋ * y
|
|
|
127 x<y→∋ {x} {y} lt = subst (λ k → odef (* x) k ) (sym &iso) lt
|
|
|
128
|
|
1242
|
129 gf05 : {a b : HOD} {x : Ordinal } → (odef (a ∪ b) x ) → ¬ odef a x → ¬ odef b x → ⊥
|
|
1244
|
130 gf05 {a} {b} {x} (case1 ax) nax nbx = nax ax
|
|
1242
|
131 gf05 {a} {b} {x} (case2 bx) nax nbx = nbx bx
|
|
|
132
|
|
|
133 gf02 : {P a b : HOD } → (P ＼ a) ∩ (P ＼ b) ≡ ( P ＼ (a ∪ b) )
|
|
1250
|
134 gf02 {P} {a} {b} = ==→o≡ record { eq→ = gf03 ; eq← = gf04 } where
|
|
1242
|
135 gf03 : {x : Ordinal} → odef ((P ＼ a) ∩ (P ＼ b)) x → odef (P ＼ (a ∪ b)) x
|
|
|
136 gf03 {x} ⟪ ⟪ Px , ¬ax ⟫ , ⟪ _ , ¬bx ⟫ ⟫ = ⟪ Px , (λ pab → gf05 {a} {b} {x} pab ¬ax ¬bx ) ⟫
|
|
|
137 gf04 : {x : Ordinal} → odef (P ＼ (a ∪ b)) x → odef ((P ＼ a) ∩ (P ＼ b)) x
|
|
1244
|
138 gf04 {x} ⟪ Px , abx ⟫ = ⟪ ⟪ Px , (λ ax → abx (case1 ax) ) ⟫ , ⟪ Px , (λ bx → abx (case2 bx) ) ⟫ ⟫
|
|
1242
|
139
|
|
1250
|
140 gf45 : {P a b : HOD } → (P ＼ a) ∪ (P ＼ b) ≡ ( P ＼ (a ∩ b) )
|
|
|
141 gf45 {P} {a} {b} = ==→o≡ record { eq→ = gf03 ; eq← = gf04 } where
|
|
|
142 gf03 : {x : Ordinal} → odef ((P ＼ a) ∪ (P ＼ b)) x → odef (P ＼ (a ∩ b)) x
|
|
|
143 gf03 {x} (case1 pa) = ⟪ proj1 pa , (λ ab → proj2 pa (proj1 ab) ) ⟫
|
|
|
144 gf03 {x} (case2 pb) = ⟪ proj1 pb , (λ ab → proj2 pb (proj2 ab) ) ⟫
|
|
|
145 gf04 : {x : Ordinal} → odef (P ＼ (a ∩ b)) x → odef ((P ＼ a) ∪ (P ＼ b)) x
|
|
|
146 gf04 {x} ⟪ Px , nab ⟫ with ODC.p∨¬p O (odef b x)
|
|
|
147 ... | case1 bx = case1 ⟪ Px , ( λ ax → nab ⟪ ax , bx ⟫ ) ⟫
|
|
|
148 ... | case2 nbx = case2 ⟪ Px , ( λ bx → nbx bx ) ⟫
|
|
|
149
|
|
446
|
150 open import Data.Nat.Properties
|
|
|
151 open import nat
|
|
433
|
152
|
|
1242
|
153 p-monotonic1 : (L p : HOD ) (C : CountableModel ) → {n : ℕ} → (* (find-p L C n (& p))) ⊆ (* (find-p L C (suc n) (& p)))
|
|
1096
|
154 p-monotonic1 L p C {n} {x} with is-o∅ (& (PGHOD n L C (find-p L C n (& p))))
|
|
|
155 ... | yes y = refl-⊆ {* (find-p L C n (& p))}
|
|
1242
|
156 ... | no not = λ lt → proj2 (proj2 fmin∈PGHOD) _ lt where
|
|
447
|
157 fmin : HOD
|
|
457
|
158 fmin = ODC.minimal O (PGHOD n L C (find-p L C n (& p))) (λ eq → not (=od∅→≡o∅ eq))
|
|
|
159 fmin∈PGHOD : PGHOD n L C (find-p L C n (& p)) ∋ fmin
|
|
|
160 fmin∈PGHOD = ODC.x∋minimal O (PGHOD n L C (find-p L C n (& p))) (λ eq → not (=od∅→≡o∅ eq))
|
|
438
|
161
|
|
1242
|
162 p-monotonic : (L p : HOD ) (C : CountableModel ) → {n m : ℕ} → n ≤ m → (* (find-p L C n (& p))) ⊆ (* (find-p L C m (& p)))
|
|
|
163 p-monotonic L p C {zero} {zero} n≤m = refl-⊆ {* (find-p L C zero (& p))}
|
|
|
164 p-monotonic L p C {zero} {suc m} z≤n lt = p-monotonic1 L p C {m} (p-monotonic L p C {zero} {m} z≤n lt )
|
|
|
165 p-monotonic L p C {suc n} {suc m} (s≤s n≤m) with <-cmp n m
|
|
1244
|
166 ... | tri< a ¬b ¬c = λ lt → p-monotonic1 L p C {m} (p-monotonic L p C {suc n} {m} a lt)
|
|
1096
|
167 ... | tri≈ ¬a refl ¬c = λ x → x
|
|
446
|
168 ... | tri> ¬a ¬b c = ⊥-elim ( nat-≤> n≤m c )
|
|
438
|
169
|
|
1242
|
170 record Dense {L P : HOD } (LP : L ⊆ Power P) : Set (Level.suc n) where
|
|
1239
|
171 field
|
|
|
172 dense : HOD
|
|
|
173 d⊆P : dense ⊆ L
|
|
|
174 dense-f : {p : HOD} → L ∋ p → HOD
|
|
|
175 dense-d : { p : HOD} → (lt : L ∋ p) → dense ∋ dense-f lt
|
|
1245
|
176 dense-p : { p : HOD} → (lt : L ∋ p) → p ⊆ dense-f lt
|
|
1239
|
177
|
|
1242
|
178 record GenericFilter {L P : HOD} (LP : L ⊆ Power P) (M : HOD) : Set (Level.suc n) where
|
|
1239
|
179 field
|
|
|
180 genf : Filter {L} {P} LP
|
|
|
181 rgen : HOD
|
|
|
182 rgen = Replace (Filter.filter genf) (λ x → P ＼ x )
|
|
1248
|
183 field
|
|
|
184 generic : (D : Dense {L} {P} LP ) → M ∋ Dense.dense D → ¬ ( (Dense.dense D ∩ Replace (Filter.filter genf) (λ x → P ＼ x )) ≡ od∅ )
|
|
1252
|
185 gfilter1 : {p q : HOD} → rgen ∋ p → q ⊆ p → L ∋ ( P ＼ q) → rgen ∋ q
|
|
1248
|
186 gfilter2 : {p q : HOD} → (rgen ∋ p ) ∧ (rgen ∋ q) → rgen ∋ (p ∪ q)
|
|
1239
|
187
|
|
1244
|
188 P-GenericFilter : (P L p0 : HOD ) → (LP : L ⊆ Power P) → L ∋ p0
|
|
1245
|
189 → (CAP : {p q : HOD} → L ∋ p → L ∋ q → L ∋ (p ∩ q )) -- L is a Boolean Algebra
|
|
1244
|
190 → (UNI : {p q : HOD} → L ∋ p → L ∋ q → L ∋ (p ∪ q ))
|
|
1243
|
191 → (NEG : ({p : HOD} → L ∋ p → L ∋ ( P ＼ p)))
|
|
1241
|
192 → (C : CountableModel ) → GenericFilter {L} {P} LP ( ctl-M C )
|
|
1244
|
193 P-GenericFilter P L p0 L⊆PP Lp0 CAP UNI NEG C = record {
|
|
|
194 genf = record { filter = Replace (PDHOD L p0 C) (λ x → P ＼ x) ; f⊆L = gf01 ; filter1 = f1 ; filter2 = f2 }
|
|
1240
|
195 ; generic = λ D cd → subst (λ k → ¬ (Dense.dense D ∩ k) ≡ od∅ ) (sym gf00) (fdense D cd )
|
|
1248
|
196 ; gfilter1 = gfilter1
|
|
|
197 ; gfilter2 = gfilter2
|
|
431
|
198 } where
|
|
1248
|
199 GP = Replace (PDHOD L p0 C) (λ x → P ＼ x)
|
|
|
200 GPR = Replace GP (_＼_ P)
|
|
|
201 f⊆PL : PDHOD L p0 C ⊆ L
|
|
|
202 f⊆PL lt = x∈PP lt
|
|
|
203 gf01 : Replace (PDHOD L p0 C) (λ x → P ＼ x) ⊆ L
|
|
|
204 gf01 {x} record { z = z ; az = az ; x=ψz = x=ψz } = subst (λ k → odef L k) (sym x=ψz) ( NEG (subst (λ k → odef L k) (sym &iso) (f⊆PL az)) )
|
|
|
205 gf141 : {xp xq : Ordinal } → (Pp : PDN L p0 C xp) (Pq : PDN L p0 C xq) → (* xp ∪ * xq) ⊆ P
|
|
|
206 gf141 Pp Pq {x} (case1 xpx) = L⊆PP (PDN.x∈PP Pp) _ xpx
|
|
|
207 gf141 Pp Pq {x} (case2 xqx) = L⊆PP (PDN.x∈PP Pq) _ xqx
|
|
|
208 gf121 : {p q : HOD} (gp : GP ∋ p) (gq : GP ∋ q) → p ∩ q ≡ P ＼ * (& (* (Replaced.z gp) ∪ * (Replaced.z gq)))
|
|
|
209 gf121 {p} {q} gp gq = begin
|
|
|
210 p ∩ q ≡⟨ cong₂ (λ j k → j ∩ k ) (sym *iso) (sym *iso) ⟩
|
|
|
211 (* (& p)) ∩ (* (& q)) ≡⟨ cong₂ (λ j k → ( * j ) ∩ ( * k)) (Replaced.x=ψz gp) (Replaced.x=ψz gq) ⟩
|
|
|
212 * (& (P ＼ (* xp ))) ∩ (* (& (P ＼ (* xq )))) ≡⟨ cong₂ (λ j k → j ∩ k ) *iso *iso ⟩
|
|
|
213 (P ＼ (* xp )) ∩ (P ＼ (* xq )) ≡⟨ gf02 {P} {* xp} {* xq} ⟩
|
|
|
214 P ＼ ((* xp) ∪ (* xq)) ≡⟨ cong (λ k → P ＼ k) (sym *iso) ⟩
|
|
|
215 P ＼ * (& (* xp ∪ * xq)) ∎ where
|
|
|
216 open ≡-Reasoning
|
|
|
217 xp = Replaced.z gp
|
|
|
218 xq = Replaced.z gq
|
|
|
219 gf131 : {p q : HOD} (gp : GP ∋ p) (gq : GP ∋ q) → P ＼ (p ∩ q) ≡ * (Replaced.z gp) ∪ * (Replaced.z gq)
|
|
|
220 gf131 {p} {q} gp gq = trans (cong (λ k → P ＼ k) (gf121 gp gq))
|
|
|
221 (trans ( L＼Lx=x (subst (λ k → k ⊆ P) (sym *iso) (gf141 (Replaced.az gp) (Replaced.az gq))) ) *iso )
|
|
1242
|
222
|
|
1248
|
223 f1 : {p q : HOD} → L ∋ q → Replace (PDHOD L p0 C) (λ x → P ＼ x) ∋ p → p ⊆ q → Replace (PDHOD L p0 C) (λ x → P ＼ x) ∋ q
|
|
|
224 f1 {p} {q} L∋q record { z = z ; az = az ; x=ψz = x=ψz } p⊆q = record { z = _
|
|
|
225 ; az = record { gr = gr az ; pn<gr = f04 ; x∈PP = NEG L∋q } ; x=ψz = f05 } where
|
|
|
226 open ≡-Reasoning
|
|
|
227 f04 : (y : Ordinal) → odef (* (& (P ＼ q))) y → odef (* (find-p L C (gr az ) (& p0))) y
|
|
|
228 f04 y qy = PDN.pn<gr az _ (subst (λ k → odef k y ) f06 (f03 qy )) where
|
|
|
229 f06 : * (& (P ＼ p)) ≡ * z
|
|
|
230 f06 = begin
|
|
|
231 * (& (P ＼ p)) ≡⟨ *iso ⟩
|
|
|
232 P ＼ p ≡⟨ cong (λ k → P ＼ k) (sym *iso) ⟩
|
|
|
233 P ＼ (* (& p)) ≡⟨ cong (λ k → P ＼ k) (cong (*) x=ψz) ⟩
|
|
|
234 P ＼ (* (& (P ＼ * z))) ≡⟨ cong ( λ k → P ＼ k) *iso ⟩
|
|
|
235 P ＼ (P ＼ * z) ≡⟨ L＼Lx=x (λ {x} lt → L⊆PP (x∈PP az) _ lt ) ⟩
|
|
|
236 * z ∎
|
|
|
237 f03 : odef (* (& (P ＼ q))) y → odef (* (& (P ＼ p))) y
|
|
|
238 f03 pqy with subst (λ k → odef k y ) *iso pqy
|
|
|
239 ... | ⟪ Py , nqy ⟫ = subst (λ k → odef k y ) (sym *iso) ⟪ Py , (λ py → nqy (p⊆q py) ) ⟫
|
|
|
240 f05 : & q ≡ & (P ＼ * (& (P ＼ q)))
|
|
|
241 f05 = cong (&) ( begin
|
|
|
242 q ≡⟨ sym (L＼Lx=x (λ {x} lt → L⊆PP L∋q _ (subst (λ k → odef k x) (sym *iso) lt) )) ⟩
|
|
|
243 P ＼ (P ＼ q ) ≡⟨ cong ( λ k → P ＼ k) (sym *iso) ⟩
|
|
|
244 P ＼ * (& (P ＼ q)) ∎ )
|
|
|
245 f2 : {p q : HOD} → GP ∋ p → GP ∋ q → L ∋ (p ∩ q) → GP ∋ (p ∩ q)
|
|
|
246 f2 {p} {q} record { z = xp ; az = Pp ; x=ψz = peq }
|
|
|
247 record { z = xq ; az = Pq ; x=ψz = qeq } L∋pq with <-cmp (gr Pp) (gr Pq)
|
|
|
248 ... | tri< a ¬b ¬c = record { z = & ( (* xp) ∪ (* xq) ) ; az = gf10 ; x=ψz = cong (&) (gf121 gp gq) } where
|
|
|
249 gp = record { z = xp ; az = Pp ; x=ψz = peq }
|
|
|
250 gq = record { z = xq ; az = Pq ; x=ψz = qeq }
|
|
|
251 gf10 : odef (PDHOD L p0 C) (& (* xp ∪ * xq))
|
|
|
252 gf10 = record { gr = PDN.gr Pq ; pn<gr = gf15 ; x∈PP = subst (λ k → odef L k) (cong (&) (gf131 gp gq)) ( NEG L∋pq ) } where
|
|
|
253 gf16 : gr Pp ≤ gr Pq
|
|
|
254 gf16 = <to≤ a
|
|
|
255 gf15 : (y : Ordinal) → odef (* (& (* xp ∪ * xq))) y → odef (* (find-p L C (gr Pq) (& p0))) y
|
|
|
256 gf15 y gpqy with subst (λ k → odef k y ) *iso gpqy
|
|
|
257 ... | case1 xpy = p-monotonic L p0 C gf16 (PDN.pn<gr Pp y xpy )
|
|
|
258 ... | case2 xqy = PDN.pn<gr Pq _ xqy
|
|
|
259 ... | tri≈ ¬a eq ¬c = record { z = & (* xp ∪ * xq) ; az = record { gr = gr Pp ; pn<gr = gf21 ; x∈PP = gf22 } ; x=ψz = gf23 } where
|
|
|
260 gp = record { z = xp ; az = Pp ; x=ψz = peq }
|
|
|
261 gq = record { z = xq ; az = Pq ; x=ψz = qeq }
|
|
|
262 gf22 : odef L (& (* xp ∪ * xq))
|
|
|
263 gf22 = UNI (subst (λ k → odef L k ) (sym &iso) (PDN.x∈PP Pp)) (subst (λ k → odef L k ) (sym &iso) (PDN.x∈PP Pq))
|
|
|
264 gf21 : (y : Ordinal) → odef (* (& (* xp ∪ * xq))) y → odef (* (find-p L C (gr Pp) (& p0))) y
|
|
|
265 gf21 y xpqy with subst (λ k → odef k y) *iso xpqy
|
|
|
266 ... | case1 xpy = PDN.pn<gr Pp _ xpy
|
|
|
267 ... | case2 xqy = subst (λ k → odef (* (find-p L C k (& p0))) y ) (sym eq) ( PDN.pn<gr Pq _ xqy )
|
|
|
268 gf25 : odef L (& p)
|
|
|
269 gf25 = subst (λ k → odef L k ) (sym peq) ( NEG (subst (λ k → odef L k) (sym &iso) (PDN.x∈PP Pp) ))
|
|
|
270 gf27 : {x : Ordinal} → odef p x → odef (P ＼ * xp) x
|
|
|
271 gf27 {x} px = subst (λ k → odef k x) (subst₂ (λ j k → j ≡ k ) *iso *iso (cong (*) peq)) px
|
|
|
272 -- gf02 : {P a b : HOD } → (P ＼ a) ∩ (P ＼ b) ≡ ( P ＼ (a ∪ b) )
|
|
|
273 gf23 : & (p ∩ q) ≡ & (P ＼ * (& (* xp ∪ * xq)))
|
|
|
274 gf23 = cong (&) (gf121 gp gq )
|
|
|
275 ... | tri> ¬a ¬b c = record { z = & ( (* xp) ∪ (* xq) ) ; az = gf10 ; x=ψz = cong (&) (gf121 gp gq ) } where
|
|
|
276 gp = record { z = xp ; az = Pp ; x=ψz = peq }
|
|
|
277 gq = record { z = xq ; az = Pq ; x=ψz = qeq }
|
|
|
278 gf10 : odef (PDHOD L p0 C) (& (* xp ∪ * xq))
|
|
|
279 gf10 = record { gr = PDN.gr Pp ; pn<gr = gf15 ; x∈PP = subst (λ k → odef L k) (cong (&) (gf131 gp gq)) ( NEG L∋pq ) } where
|
|
|
280 gf16 : gr Pq ≤ gr Pp
|
|
|
281 gf16 = <to≤ c
|
|
|
282 gf15 : (y : Ordinal) → odef (* (& (* xp ∪ * xq))) y → odef (* (find-p L C (gr Pp) (& p0))) y
|
|
|
283 gf15 y gpqy with subst (λ k → odef k y ) *iso gpqy
|
|
|
284 ... | case1 xpy = PDN.pn<gr Pp _ xpy
|
|
|
285 ... | case2 xqy = p-monotonic L p0 C gf16 (PDN.pn<gr Pq y xqy )
|
|
|
286 gf00 : Replace (Replace (PDHOD L p0 C) (λ x → P ＼ x)) (_＼_ P) ≡ PDHOD L p0 C
|
|
|
287 gf00 = ==→o≡ record { eq→ = gf20 ; eq← = gf22 } where
|
|
|
288 gf20 : {x : Ordinal} → odef (Replace (Replace (PDHOD L p0 C) (λ x₁ → P ＼ x₁)) (_＼_ P)) x → PDN L p0 C x
|
|
|
289 gf20 {x} record { z = z₁ ; az = record { z = z ; az = az ; x=ψz = x=ψz₁ } ; x=ψz = x=ψz } =
|
|
|
290 subst (λ k → PDN L p0 C k ) (begin
|
|
|
291 z ≡⟨ sym &iso ⟩
|
|
|
292 & (* z) ≡⟨ cong (&) (sym (L＼Lx=x gf21 )) ⟩
|
|
|
293 & (P ＼ ( P ＼ (* z) )) ≡⟨ cong (λ k → & ( P ＼ k)) (sym *iso) ⟩
|
|
|
294 & (P ＼ (* ( & (P ＼ (* z ))))) ≡⟨ cong (λ k → & (P ＼ (* k))) (sym x=ψz₁) ⟩
|
|
|
295 & (P ＼ (* z₁)) ≡⟨ sym x=ψz ⟩
|
|
|
296 x ∎ ) az where
|
|
|
297 open ≡-Reasoning
|
|
|
298 gf21 : {x : Ordinal } → odef (* z) x → odef P x
|
|
|
299 gf21 {x} lt = L⊆PP ( PDN.x∈PP az) _ lt
|
|
|
300 gf22 : {x : Ordinal} → PDN L p0 C x → odef (Replace (Replace (PDHOD L p0 C) (λ x₁ → P ＼ x₁)) (_＼_ P)) x
|
|
|
301 gf22 {x} pdx = record { z = _ ; az = record { z = _ ; az = pdx ; x=ψz = refl } ; x=ψz = ( begin
|
|
|
302 x ≡⟨ sym &iso ⟩
|
|
|
303 & (* x) ≡⟨ cong (&) (sym (L＼Lx=x gf21 )) ⟩
|
|
|
304 & (P ＼ (P ＼ * x)) ≡⟨ cong (λ k → & ( P ＼ k)) (sym *iso) ⟩
|
|
|
305 & (P ＼ * (& (P ＼ * x))) ∎ ) } where
|
|
|
306 open ≡-Reasoning
|
|
|
307 gf21 : {z : Ordinal } → odef (* x) z → odef P z
|
|
|
308 gf21 {z} lt = L⊆PP ( PDN.x∈PP pdx ) z lt
|
|
|
309 fdense : (D : Dense {L} {P} L⊆PP ) → (ctl-M C ) ∋ Dense.dense D → ¬ (Dense.dense D ∩ (PDHOD L p0 C)) ≡ od∅
|
|
|
310 fdense D MD eq0 = ⊥-elim ( ∅< {Dense.dense D ∩ PDHOD L p0 C} fd01 (≡od∅→=od∅ eq0 )) where
|
|
|
311 open Dense
|
|
|
312 fd09 : (i : ℕ ) → odef L (find-p L C i (& p0))
|
|
|
313 fd09 zero = Lp0
|
|
|
314 fd09 (suc i) with is-o∅ ( & ( PGHOD i L C (find-p L C i (& p0))) )
|
|
|
315 ... | yes _ = fd09 i
|
|
|
316 ... | no not = fd17 where
|
|
|
317 fd19 = ODC.minimal O ( PGHOD i L C (find-p L C i (& p0))) (λ eq → not (=od∅→≡o∅ eq))
|
|
|
318 fd18 : PGHOD i L C (find-p L C i (& p0)) ∋ fd19
|
|
|
319 fd18 = ODC.x∋minimal O (PGHOD i L C (find-p L C i (& p0))) (λ eq → not (=od∅→≡o∅ eq))
|
|
|
320 fd17 : odef L ( & (ODC.minimal O ( PGHOD i L C (find-p L C i (& p0))) (λ eq → not (=od∅→≡o∅ eq))) )
|
|
|
321 fd17 = proj1 fd18
|
|
|
322 an : ℕ
|
|
|
323 an = ctl← C (& (dense D)) MD
|
|
|
324 pn : Ordinal
|
|
|
325 pn = find-p L C an (& p0)
|
|
|
326 pn+1 : Ordinal
|
|
|
327 pn+1 = find-p L C (suc an) (& p0)
|
|
|
328 d=an : dense D ≡ * (ctl→ C an)
|
|
|
329 d=an = begin dense D ≡⟨ sym *iso ⟩
|
|
|
330 * ( & (dense D)) ≡⟨ cong (*) (sym (ctl-iso→ C MD )) ⟩
|
|
|
331 * (ctl→ C an) ∎ where open ≡-Reasoning
|
|
|
332 fd07 : odef (dense D) pn+1
|
|
|
333 fd07 with is-o∅ ( & ( PGHOD an L C (find-p L C an (& p0))) )
|
|
|
334 ... | yes y = ⊥-elim ( ¬x<0 ( _==_.eq→ fd10 fd21 ) ) where
|
|
|
335 L∋pn : L ∋ * (find-p L C an (& p0))
|
|
|
336 L∋pn = subst (λ k → odef L k) (sym &iso) (fd09 an )
|
|
|
337 L∋df : L ∋ ( dense-f D L∋pn )
|
|
|
338 L∋df = (d⊆P D) ( dense-d D L∋pn )
|
|
|
339 pn∋df : (* (ctl→ C an)) ∋ ( dense-f D L∋pn )
|
|
|
340 pn∋df = subst (λ k → odef k (& ( dense-f D L∋pn ) )) d=an ( dense-d D L∋pn )
|
|
|
341 pn⊆df : (y : Ordinal) → odef (* (find-p L C an (& p0))) y → odef (* (& (dense-f D L∋pn))) y
|
|
|
342 pn⊆df y py = subst (λ k → odef k y ) (sym *iso) (dense-p D L∋pn py)
|
|
|
343 fd21 : odef (PGHOD an L C (find-p L C an (& p0)) ) (& (dense-f D L∋pn))
|
|
|
344 fd21 = ⟪ L∋df , ⟪ pn∋df , pn⊆df ⟫ ⟫
|
|
|
345 fd10 : PGHOD an L C (find-p L C an (& p0)) =h= od∅
|
|
|
346 fd10 = ≡o∅→=od∅ y
|
|
|
347 ... | no not = fd27 where
|
|
|
348 fd29 = ODC.minimal O ( PGHOD an L C (find-p L C an (& p0))) (λ eq → not (=od∅→≡o∅ eq))
|
|
|
349 fd28 : PGHOD an L C (find-p L C an (& p0)) ∋ fd29
|
|
|
350 fd28 = ODC.x∋minimal O (PGHOD an L C (find-p L C an (& p0))) (λ eq → not (=od∅→≡o∅ eq))
|
|
|
351 fd27 : odef (dense D) (& fd29)
|
|
|
352 fd27 = subst (λ k → odef k (& fd29)) (sym d=an) (proj1 (proj2 fd28))
|
|
|
353 fd03 : odef (PDHOD L p0 C) pn+1
|
|
|
354 fd03 = record { gr = suc an ; pn<gr = λ y lt → lt ; x∈PP = fd09 (suc an)}
|
|
|
355 fd01 : (dense D ∩ PDHOD L p0 C) ∋ (* pn+1)
|
|
|
356 fd01 = ⟪ subst (λ k → odef (dense D) k ) (sym &iso) fd07 , subst (λ k → odef (PDHOD L p0 C) k) (sym &iso) fd03 ⟫
|
|
1250
|
357 gpx→⊆P : {p : Ordinal } → odef GP p → (* p) ⊆ P
|
|
|
358 gpx→⊆P {p} record { z = z ; az = az ; x=ψz = x=ψz } {x} px with subst (λ k → odef k x )
|
|
|
359 (trans (cong (*) x=ψz) *iso) px
|
|
|
360 ... | ⟪ Px , npz ⟫ = Px
|
|
1252
|
361 L∋gpr : {p : HOD } → GPR ∋ p → (L ∋ p) ∧ ( L ∋ (P ＼ p))
|
|
1251
|
362 L∋gpr {p} record { z = zp ; az = record { z = z ; az = az ; x=ψz = x=ψzp } ; x=ψz = x=ψz }
|
|
1252
|
363 = ⟪ subst (λ k → odef L k) fd40 (PDN.x∈PP az) , NEG (subst (λ k → odef L k) fd40 (PDN.x∈PP az)) ⟫ where
|
|
1251
|
364 fd41 : * z ⊆ P
|
|
|
365 fd41 {x} lt = L⊆PP ( PDN.x∈PP az ) _ lt
|
|
|
366 fd40 : z ≡ & p
|
|
|
367 fd40 = begin
|
|
|
368 z ≡⟨ sym &iso ⟩
|
|
|
369 & (* z) ≡⟨ cong (&) (sym (L＼Lx=x fd41 )) ⟩
|
|
|
370 & (P ＼ ( P ＼ * z ) ) ≡⟨ cong (λ k → & (P ＼ k)) (sym *iso) ⟩
|
|
|
371 & (P ＼ * (& ( P ＼ * z ))) ≡⟨ cong (λ k → & (P ＼ * k )) (sym x=ψzp) ⟩
|
|
|
372 & (P ＼ * zp) ≡⟨ sym x=ψz ⟩
|
|
|
373 & p ∎ where open ≡-Reasoning
|
|
1250
|
374 gpr→gp : {p : HOD} → GPR ∋ p → GP ∋ (P ＼ p )
|
|
|
375 gpr→gp {p} record { z = zp ; az = azp ; x=ψz = x=ψzp } = gfp where
|
|
|
376 open ≡-Reasoning
|
|
|
377 gfp : GP ∋ (P ＼ p )
|
|
|
378 gfp = subst (λ k → odef GP k) (begin
|
|
|
379 zp ≡⟨ sym &iso ⟩
|
|
|
380 & (* zp) ≡⟨ cong (&) (sym (L＼Lx=x (gpx→⊆P azp) )) ⟩
|
|
|
381 & (P ＼ (P ＼ (* zp) )) ≡⟨ cong (λ k → & ( P ＼ k)) (subst₂ (λ j k → j ≡ k ) *iso *iso (cong (*) (sym x=ψzp))) ⟩
|
|
|
382 & (P ＼ p) ∎ ) azp
|
|
1252
|
383 gfilter1 : {p q : HOD} → GPR ∋ p → q ⊆ p → L ∋ ( P ＼ q) → GPR ∋ q
|
|
|
384 gfilter1 {p} {q} record { z = np ; az = record { z = z ; az = pdz ; x=ψz = x=ψznp } ; x=ψz = x=ψz } q⊆p Lpq
|
|
|
385 = record { z = _ ; az = gf30 ; x=ψz = cong (&) fd42 } where
|
|
1250
|
386 gp = record { z = np ; az = record { z = z ; az = pdz ; x=ψz = x=ψznp } ; x=ψz = x=ψz }
|
|
1251
|
387 open ≡-Reasoning
|
|
|
388 fd41 : * z ⊆ P
|
|
|
389 fd41 {x} lt = L⊆PP ( PDN.x∈PP pdz ) _ lt
|
|
|
390 p=*z : p ≡ * z
|
|
|
391 p=*z = trans (sym *iso) ( cong (*) (sym ( begin
|
|
|
392 z ≡⟨ sym &iso ⟩
|
|
|
393 & (* z) ≡⟨ cong (&) (sym (L＼Lx=x fd41 )) ⟩
|
|
|
394 & (P ＼ ( P ＼ * z ) ) ≡⟨ cong (λ k → & (P ＼ k)) (sym *iso) ⟩
|
|
|
395 & (P ＼ * (& ( P ＼ * z ))) ≡⟨ cong (λ k → & (P ＼ * k )) (sym x=ψznp) ⟩
|
|
|
396 & (P ＼ * np) ≡⟨ sym x=ψz ⟩
|
|
|
397 & p ∎ )))
|
|
1250
|
398 q⊆P : q ⊆ P
|
|
1251
|
399 q⊆P {x} lt = L⊆PP ( PDN.x∈PP pdz ) _ (subst (λ k → odef k x) p=*z (q⊆p lt))
|
|
1252
|
400 fd42 : q ≡ P ＼ * (& (P ＼ q))
|
|
|
401 fd42 = trans (sym (L＼Lx=x q⊆P )) (cong (λ k → P ＼ k) (sym *iso) )
|
|
1250
|
402 gf32 : (P ＼ p) ⊆ (P ＼ q)
|
|
|
403 gf32 = proj1 (＼-⊆ {P} {q} {p} q⊆P ) q⊆p
|
|
1248
|
404 gf30 : GP ∋ (P ＼ q )
|
|
1252
|
405 gf30 = f1 Lpq (gpr→gp gp) gf32
|
|
1248
|
406 gfilter2 : {p q : HOD} → (GPR ∋ p) ∧ (GPR ∋ q) → Replace GP (_＼_ P) ∋ (p ∪ q)
|
|
1250
|
407 gfilter2 {p} {q} ⟪ gp , gq ⟫
|
|
1252
|
408 = record { z = _ ; az = gf31 ; x=ψz = cong (&) gf32 } where
|
|
1250
|
409 open ≡-Reasoning
|
|
1248
|
410 gf31 : GP ∋ ( (P ＼ p ) ∩ (P ＼ q ) )
|
|
1252
|
411 gf31 = f2 (gpr→gp gp) (gpr→gp gq) (CAP (proj2 (L∋gpr gp)) (proj2 (L∋gpr gq)) )
|
|
|
412 gf33 : (p ∪ q) ⊆ P
|
|
|
413 gf33 {x} (case1 px) = L⊆PP (proj1 (L∋gpr gp)) _ (subst (λ k → odef k x) (sym *iso) px )
|
|
|
414 gf33 {x} (case2 qx) = L⊆PP (proj1 (L∋gpr gq)) _ (subst (λ k → odef k x) (sym *iso) qx )
|
|
|
415 gf32 : (p ∪ q) ≡ (P ＼ * (& ((P ＼ p) ∩ (P ＼ q))))
|
|
|
416 gf32 = begin
|
|
|
417 p ∪ q ≡⟨ sym ( L＼Lx=x gf33 ) ⟩
|
|
|
418 P ＼ (P ＼ (p ∪ q)) ≡⟨ cong (λ k → P ＼ k) (sym (gf02 {P} {p}{q} ) ) ⟩
|
|
|
419 P ＼ ((P ＼ p) ∩ (P ＼ q)) ≡⟨ cong (λ k → P ＼ k) (sym *iso) ⟩
|
|
|
420 P ＼ * (& ((P ＼ p) ∩ (P ＼ q))) ∎
|
|
448
|
421
|
|
431
|
422 open GenericFilter
|
|
|
423 open Filter
|
|
|
424
|
|
1245
|
425 record NotCompatible (L p : HOD ) (L∋a : L ∋ p ) : Set (Level.suc (Level.suc n)) where
|
|
431
|
426 field
|
|
1245
|
427 q r : HOD
|
|
|
428 Lq : L ∋ q
|
|
|
429 Lr : L ∋ r
|
|
|
430 p⊆q : p ⊆ q
|
|
|
431 p⊆r : p ⊆ r
|
|
|
432 ¬compat : (s : HOD) → ¬ ( (q ⊆ s) ∧ (r ⊆ s) )
|
|
431
|
433
|
|
1246
|
434 lemma232 : (P L p0 : HOD ) → (LPP : L ⊆ Power P) → (Lp0 : L ∋ p0 )
|
|
1245
|
435 → (CAP : {p q : HOD} → L ∋ p → L ∋ q → L ∋ (p ∩ q )) -- L is a Boolean Algebra
|
|
|
436 → (UNI : {p q : HOD} → L ∋ p → L ∋ q → L ∋ (p ∪ q ))
|
|
|
437 → (NEG : ({p : HOD} → L ∋ p → L ∋ ( P ＼ p)))
|
|
|
438 → (C : CountableModel )
|
|
1249
|
439 → ctl-M C ∋ L
|
|
1245
|
440 → ( {p : HOD} → (Lp : L ∋ p ) → NotCompatible L p Lp )
|
|
1246
|
441 → ¬ ( ctl-M C ∋ rgen ( P-GenericFilter P L p0 LPP Lp0 CAP UNI NEG C ))
|
|
1249
|
442 lemma232 P L p0 LPP Lp0 CAP UNI NEG C ML NC MF = ¬rgf∩D=0 record { eq→ = λ {x} rgf∩D → ⊥-elim( proj2 (proj2 rgf∩D) (proj1 rgf∩D))
|
|
1245
|
443 ; eq← = λ lt → ⊥-elim (¬x<0 lt) } where
|
|
1249
|
444 PG = P-GenericFilter P L p0 LPP Lp0 CAP UNI NEG C
|
|
|
445 GF = genf PG
|
|
|
446 rgf = rgen PG
|
|
1245
|
447 M = ctl-M C
|
|
|
448 D : HOD
|
|
1248
|
449 D = L ＼ rgf
|
|
|
450 M∋DM : M ∋ (D ∩ M )
|
|
1249
|
451 M∋DM = is-model C D ?
|
|
1246
|
452 D⊆PP : D ⊆ Power P
|
|
|
453 D⊆PP {x} ⟪ Lx , ngx ⟫ = LPP Lx
|
|
|
454 DD : Dense {L} {P} LPP
|
|
|
455 Dense.dense DD = D
|
|
|
456 Dense.d⊆P DD ⟪ Lx , _ ⟫ = Lx
|
|
1253
|
457 Dense.dense-f DD Lp = ll00 where
|
|
1246
|
458 ll00 : HOD
|
|
|
459 ll00 with NotCompatible.¬compat (NC Lp)
|
|
1248
|
460 ... | nc = ?
|
|
1246
|
461 Dense.dense-d DD = ?
|
|
|
462 Dense.dense-p DD = ?
|
|
1248
|
463 ¬rgf∩D=0 : ¬ ( (rgf ∩ D) =h= od∅ )
|
|
|
464 ¬rgf∩D=0 = ?
|
|
431
|
465
|
|
|
466 --
|
|
1174
|
467 -- P-Generic Filter defines a countable model D ⊂ C from P
|
|
|
468 --
|
|
|
469
|
|
|
470 --
|
|
|
471 -- in D, we have V ≠ L
|
|
|
472 --
|
|
|
473
|
|
|
474 --
|
|
431
|
475 -- val x G = { val y G | ∃ p → G ∋ p → x ∋ < y , p > }
|
|
|
476 --
|
|
436
|
477
|
|
1242
|
478 record valR (x : HOD) {P L : HOD} {LP : L ⊆ Power P} (C : CountableModel ) (G : GenericFilter {L} {P} LP (ctl-M C) ) : Set (Level.suc n) where
|
|
437
|
479 field
|
|
|
480 valx : HOD
|
|
436
|
481
|
|
437
|
482 record valS (ox oy oG : Ordinal) : Set n where
|
|
436
|
483 field
|
|
437
|
484 op : Ordinal
|
|
1244
|
485 p∈G : odef (* oG) op
|
|
437
|
486 is-val : odef (* ox) ( & < * oy , * op > )
|
|
436
|
487
|
|
459
|
488 val : (x : HOD) {P L : HOD } {LP : L ⊆ Power P}
|
|
1096
|
489 → (G : GenericFilter {L} {P} LP {!!} )
|
|
436
|
490 → HOD
|
|
437
|
491 val x G = TransFinite {λ x → HOD } ind (& x) where
|
|
|
492 ind : (x : Ordinal) → ((y : Ordinal) → y o< x → HOD) → HOD
|
|
439
|
493 ind x valy = record { od = record { def = λ y → valS x y (& (filter (genf G))) } ; odmax = {!!} ; <odmax = {!!} }
|
|
437
|
494
|
