Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate cardinal.agda @ 250:08428a661677
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Wed, 28 Aug 2019 23:52:54 +0900 |
parents | 2ecda48298e3 |
children | 9e0125b06e76 |
rev | line source |
---|---|
16 | 1 open import Level |
224 | 2 open import Ordinals |
3 module cardinal {n : Level } (O : Ordinals {n}) where | |
3 | 4 |
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
5 open import zf |
219 | 6 open import logic |
224 | 7 import OD |
23 | 8 open import Data.Nat renaming ( zero to Zero ; suc to Suc ; ℕ to Nat ; _⊔_ to _n⊔_ ) |
224 | 9 open import Relation.Binary.PropositionalEquality |
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
10 open import Data.Nat.Properties |
6 | 11 open import Data.Empty |
12 open import Relation.Nullary | |
13 open import Relation.Binary | |
14 open import Relation.Binary.Core | |
15 | |
224 | 16 open inOrdinal O |
17 open OD O | |
219 | 18 open OD.OD |
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
19 |
120 | 20 open _∧_ |
213
22d435172d1a
separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
210
diff
changeset
|
21 open _∨_ |
22d435172d1a
separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
210
diff
changeset
|
22 open Bool |
44
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
23 |
230 | 24 -- we have to work on Ordinal to keep OD Level n |
25 -- since we use p∨¬p which works only on Level n | |
225 | 26 |
233 | 27 <_,_> : (x y : OD) → OD |
28 < x , y > = (x , x ) , (x , y ) | |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
29 |
243 | 30 open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ ) |
31 | |
32 | |
248 | 33 open _==_ |
34 | |
35 exg-pair : { x y : OD } → (x , y ) == ( y , x ) | |
36 exg-pair {x} {y} = record { eq→ = left ; eq← = right } where | |
37 left : {z : Ordinal} → def (x , y) z → def (y , x) z | |
38 left (case1 t) = case2 t | |
39 left (case2 t) = case1 t | |
40 right : {z : Ordinal} → def (y , x) z → def (x , y) z | |
41 right (case1 t) = case2 t | |
42 right (case2 t) = case1 t | |
43 | |
44 ==-trans : { x y z : OD } → x == y → y == z → x == z | |
45 ==-trans x=y y=z = record { eq→ = λ {m} t → eq→ y=z (eq→ x=y t) ; eq← = λ {m} t → eq← x=y (eq← y=z t) } | |
46 | |
47 ==-sym : { x y : OD } → x == y → y == x | |
48 ==-sym x=y = record { eq→ = λ {m} t → eq← x=y t ; eq← = λ {m} t → eq→ x=y t } | |
49 | |
50 ord≡→≡ : { x y : OD } → od→ord x ≡ od→ord y → x ≡ y | |
51 ord≡→≡ eq = subst₂ (λ j k → j ≡ k ) oiso oiso ( cong ( λ k → ord→od k ) eq ) | |
52 | |
249 | 53 eq-prod : { x x' y y' : OD } → x ≡ x' → y ≡ y' → < x , y > ≡ < x' , y' > |
54 eq-prod refl refl = refl | |
55 | |
248 | 56 prod-eq : { x x' y y' : OD } → < x , y > == < x' , y' > → (x ≡ x' ) ∧ ( y ≡ y' ) |
57 prod-eq {x} {x'} {y} {y'} eq = record { proj1 = lemmax ; proj2 = lemmay } where | |
58 lemma0 : {x y z : OD } → ( x , x ) == ( z , y ) → x ≡ y | |
59 lemma0 {x} {y} eq with trio< (od→ord x) (od→ord y) | |
60 lemma0 {x} {y} eq | tri< a ¬b ¬c with eq← eq {od→ord y} (case2 refl) | |
61 lemma0 {x} {y} eq | tri< a ¬b ¬c | case1 s = ⊥-elim ( o<¬≡ (sym s) a ) | |
62 lemma0 {x} {y} eq | tri< a ¬b ¬c | case2 s = ⊥-elim ( o<¬≡ (sym s) a ) | |
63 lemma0 {x} {y} eq | tri≈ ¬a b ¬c = ord≡→≡ b | |
64 lemma0 {x} {y} eq | tri> ¬a ¬b c with eq← eq {od→ord y} (case2 refl) | |
65 lemma0 {x} {y} eq | tri> ¬a ¬b c | case1 s = ⊥-elim ( o<¬≡ s c ) | |
66 lemma0 {x} {y} eq | tri> ¬a ¬b c | case2 s = ⊥-elim ( o<¬≡ s c ) | |
67 lemma2 : {x y z : OD } → ( x , x ) == ( z , y ) → z ≡ y | |
68 lemma2 {x} {y} {z} eq = trans (sym (lemma0 lemma3 )) ( lemma0 eq ) where | |
69 lemma3 : ( x , x ) == ( y , z ) | |
70 lemma3 = ==-trans eq exg-pair | |
71 lemma1 : {x y : OD } → ( x , x ) == ( y , y ) → x ≡ y | |
72 lemma1 {x} {y} eq with eq← eq {od→ord y} (case2 refl) | |
73 lemma1 {x} {y} eq | case1 s = ord≡→≡ (sym s) | |
74 lemma1 {x} {y} eq | case2 s = ord≡→≡ (sym s) | |
75 lemma4 : {x y z : OD } → ( x , y ) == ( x , z ) → y ≡ z | |
76 lemma4 {x} {y} {z} eq with eq← eq {od→ord z} (case2 refl) | |
77 lemma4 {x} {y} {z} eq | case1 s with ord≡→≡ s -- x ≡ z | |
78 ... | refl with lemma2 (==-sym eq ) | |
79 ... | refl = refl | |
80 lemma4 {x} {y} {z} eq | case2 s = ord≡→≡ (sym s) -- y ≡ z | |
81 lemmax : x ≡ x' | |
82 lemmax with eq→ eq {od→ord (x , x)} (case1 refl) | |
83 lemmax | case1 s = lemma1 (ord→== s ) -- (x,x)≡(x',x') | |
84 lemmax | case2 s with lemma2 (ord→== s ) -- (x,x)≡(x',y') with x'≡y' | |
85 ... | refl = lemma1 (ord→== s ) | |
86 lemmay : y ≡ y' | |
87 lemmay with lemmax | |
88 ... | refl with lemma4 eq -- with (x,y)≡(x,y') | |
89 ... | eq1 = lemma4 (ord→== (cong (λ k → od→ord k ) eq1 )) | |
247 | 90 |
250 | 91 |
249 | 92 data ord-pair : (p : Ordinal) → Set n where |
93 pair : (x y : Ordinal ) → ord-pair ( od→ord ( < ord→od x , ord→od y > ) ) | |
247 | 94 |
249 | 95 ZFProduct : OD |
96 ZFProduct = record { def = λ x → ord-pair x } | |
247 | 97 |
249 | 98 eq-pair : { x x' y y' : Ordinal } → x ≡ x' → y ≡ y' → pair x y ≅ pair x' y' |
99 eq-pair refl refl = HE.refl | |
247 | 100 |
249 | 101 pi1 : { p : Ordinal } → ord-pair p → Ordinal |
102 pi1 ( pair x y) = x | |
103 | |
104 π1 : { p : OD } → ZFProduct ∋ p → Ordinal | |
105 π1 lt = pi1 lt | |
247 | 106 |
249 | 107 pi2 : { p : Ordinal } → ord-pair p → Ordinal |
108 pi2 ( pair x y ) = y | |
109 | |
110 π2 : { p : OD } → ZFProduct ∋ p → Ordinal | |
111 π2 lt = pi2 lt | |
247 | 112 |
249 | 113 p-cons : ( x y : OD ) → ZFProduct ∋ < x , y > |
114 p-cons x y = def-subst {_} {_} {ZFProduct} {od→ord (< x , y >)} (pair (od→ord x) ( od→ord y )) refl ( | |
115 let open ≡-Reasoning in begin | |
116 od→ord < ord→od (od→ord x) , ord→od (od→ord y) > | |
117 ≡⟨ cong₂ (λ j k → od→ord < j , k >) oiso oiso ⟩ | |
118 od→ord < x , y > | |
119 ∎ ) | |
247 | 120 |
244 | 121 |
250 | 122 lemma44 : {ox oy : Ordinal } → ord-pair (od→ord < ord→od ox , ord→od oy >) |
123 lemma44 {ox} {oy} = pair ox oy | |
124 | |
125 lemma55 : {ox oy : Ordinal } → ZFProduct ∋ < ord→od ox , ord→od oy > | |
126 lemma55 {ox} {oy} = pair ox oy | |
127 | |
128 lemma66 : {ox oy : Ordinal } → pair ( pi1 ( pair ox oy )) ( pi2 ( pair ox oy )) ≡ pair ox oy | |
129 lemma66 = refl | |
130 | |
131 lemma77 : {ox oy : Ordinal } → ZFProduct ∋ < ord→od (pi1 ( pair ox oy )) , ord→od (pi2 ( pair ox oy )) > ≡ ZFProduct ∋ < ord→od ox , ord→od oy > | |
132 lemma77 = refl | |
133 | |
134 p-iso3 : { ox oy : Ordinal } → (p : ZFProduct ∋ < ord→od ox , ord→od oy > ) → p ≡ pair ox oy | |
135 p-iso3 p = {!!} where | |
136 lemma0 : {ox oy : Ordinal } → ord-pair (od→ord < ord→od ox , ord→od oy >) ≡ ZFProduct ∋ < ord→od ox , ord→od oy > | |
137 lemma0 = refl | |
138 lemma1 : {op ox oy : Ordinal } → op ≡ od→ord < ord→od ox , ord→od oy > → ord-pair op ≡ ZFProduct ∋ < ord→od ox , ord→od oy > | |
139 lemma1 refl = refl | |
140 lemma : {op ox oy : Ordinal } → (p : ord-pair op ) → od→ord < ord→od ox , ord→od oy > ≡ op → p ≅ pair ox oy | |
141 lemma {op} {ox} {oy} (pair ox' oy') eq = {!!} | |
142 | |
143 | |
144 p-iso2 : { ox oy : Ordinal } → p-cons (ord→od ox) (ord→od oy) ≡ pair ox oy | |
145 p-iso2 = subst₂ ( λ j k → j ≡ k ) {!!} {!!} refl | |
146 | |
147 p-iso1 : { x y : OD } → (p : ZFProduct ∋ < x , y > ) → < ord→od (π1 p) , ord→od (π2 p) > ≡ < x , y > | |
148 p-iso1 {x} {y} p with p-cons (ord→od (π1 p)) (ord→od (π2 p)) | |
149 ... | t = {!!} | |
150 | |
242 | 151 |
249 | 152 p-iso : { x : OD } → (p : ZFProduct ∋ x ) → < ord→od (π1 p) , ord→od (π2 p) > ≡ x |
153 p-iso {x} p = {!!} | |
238 | 154 |
234
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
155 ∋-p : (A x : OD ) → Dec ( A ∋ x ) |
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
156 ∋-p A x with p∨¬p ( A ∋ x ) |
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
157 ∋-p A x | case1 t = yes t |
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
158 ∋-p A x | case2 t = no t |
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
159 |
233 | 160 _⊗_ : (A B : OD) → OD |
239 | 161 A ⊗ B = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkAB p ) } where |
162 checkAB : { p : Ordinal } → def ZFProduct p → Set n | |
163 checkAB (pair x y) = def A x ∧ def B y | |
233 | 164 |
242 | 165 func→od0 : (f : Ordinal → Ordinal ) → OD |
166 func→od0 f = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkfunc p ) } where | |
167 checkfunc : { p : Ordinal } → def ZFProduct p → Set n | |
168 checkfunc (pair x y) = f x ≡ y | |
169 | |
233 | 170 -- Power (Power ( A ∪ B )) ∋ ( A ⊗ B ) |
225 | 171 |
233 | 172 Func : ( A B : OD ) → OD |
173 Func A B = record { def = λ x → def (Power (A ⊗ B)) x } | |
174 | |
175 -- power→ : ( A t : OD) → Power A ∋ t → {x : OD} → t ∋ x → ¬ ¬ (A ∋ x) | |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
176 |
236 | 177 |
233 | 178 func→od : (f : Ordinal → Ordinal ) → ( dom : OD ) → OD |
179 func→od f dom = Replace dom ( λ x → < x , ord→od (f (od→ord x)) > ) | |
180 | |
242 | 181 record Func←cd { dom cod : OD } {f : Ordinal } : Set n where |
236 | 182 field |
183 func-1 : Ordinal → Ordinal | |
242 | 184 func→od∈Func-1 : Func dom cod ∋ func→od func-1 dom |
236 | 185 |
242 | 186 od→func : { dom cod : OD } → {f : Ordinal } → def (Func dom cod ) f → Func←cd {dom} {cod} {f} |
240 | 187 od→func {dom} {cod} {f} lt = record { func-1 = λ x → sup-o ( λ y → lemma x y ) ; func→od∈Func-1 = record { proj1 = {!!} ; proj2 = {!!} } } where |
236 | 188 lemma : Ordinal → Ordinal → Ordinal |
189 lemma x y with IsZF.power→ isZF (dom ⊗ cod) (ord→od f) (subst (λ k → def (Power (dom ⊗ cod)) k ) (sym diso) lt ) | ∋-p (ord→od f) (ord→od y) | |
190 lemma x y | p | no n = o∅ | |
240 | 191 lemma x y | p | yes f∋y = lemma2 (proj1 (double-neg-eilm ( p {ord→od y} f∋y ))) where -- p : {y : OD} → f ∋ y → ¬ ¬ (dom ⊗ cod ∋ y) |
192 lemma2 : {p : Ordinal} → ord-pair p → Ordinal | |
193 lemma2 (pair x1 y1) with decp ( x1 ≡ x) | |
194 lemma2 (pair x1 y1) | yes p = y1 | |
195 lemma2 (pair x1 y1) | no ¬p = o∅ | |
242 | 196 fod : OD |
197 fod = Replace dom ( λ x → < x , ord→od (sup-o ( λ y → lemma (od→ord x) y )) > ) | |
240 | 198 |
199 | |
200 open Func←cd | |
236 | 201 |
227 | 202 -- contra position of sup-o< |
203 -- | |
204 | |
235 | 205 -- postulate |
206 -- -- contra-position of mimimulity of supermum required in Cardinal | |
207 -- sup-x : ( Ordinal → Ordinal ) → Ordinal | |
208 -- sup-lb : { ψ : Ordinal → Ordinal } → {z : Ordinal } → z o< sup-o ψ → z o< osuc (ψ (sup-x ψ)) | |
227 | 209 |
219 | 210 ------------ |
211 -- | |
212 -- Onto map | |
213 -- def X x -> xmap | |
214 -- X ---------------------------> Y | |
215 -- ymap <- def Y y | |
216 -- | |
224 | 217 record Onto (X Y : OD ) : Set n where |
219 | 218 field |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
219 xmap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
220 ymap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
221 xfunc : def (Func X Y) xmap |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
222 yfunc : def (Func Y X) ymap |
234
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
223 onto-iso : {y : Ordinal } → (lty : def Y y ) → |
240 | 224 func-1 ( od→func {X} {Y} {xmap} xfunc ) ( func-1 (od→func yfunc) y ) ≡ y |
230 | 225 |
226 open Onto | |
227 | |
228 onto-restrict : {X Y Z : OD} → Onto X Y → ({x : OD} → _⊆_ Z Y {x}) → Onto X Z | |
229 onto-restrict {X} {Y} {Z} onto Z⊆Y = record { | |
230 xmap = xmap1 | |
231 ; ymap = zmap | |
232 ; xfunc = xfunc1 | |
233 ; yfunc = zfunc | |
234 ; onto-iso = onto-iso1 | |
235 } where | |
236 xmap1 : Ordinal | |
237 xmap1 = od→ord (Select (ord→od (xmap onto)) {!!} ) | |
238 zmap : Ordinal | |
239 zmap = {!!} | |
240 xfunc1 : def (Func X Z) xmap1 | |
241 xfunc1 = {!!} | |
242 zfunc : def (Func Z X) zmap | |
243 zfunc = {!!} | |
240 | 244 onto-iso1 : {z : Ordinal } → (ltz : def Z z ) → func-1 (od→func xfunc1 ) (func-1 (od→func zfunc ) z ) ≡ z |
230 | 245 onto-iso1 = {!!} |
246 | |
51 | 247 |
224 | 248 record Cardinal (X : OD ) : Set n where |
219 | 249 field |
224 | 250 cardinal : Ordinal |
230 | 251 conto : Onto X (Ord cardinal) |
252 cmax : ( y : Ordinal ) → cardinal o< y → ¬ Onto X (Ord y) | |
151 | 253 |
224 | 254 cardinal : (X : OD ) → Cardinal X |
255 cardinal X = record { | |
219 | 256 cardinal = sup-o ( λ x → proj1 ( cardinal-p x) ) |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
257 ; conto = onto |
219 | 258 ; cmax = cmax |
259 } where | |
230 | 260 cardinal-p : (x : Ordinal ) → ( Ordinal ∧ Dec (Onto X (Ord x) ) ) |
261 cardinal-p x with p∨¬p ( Onto X (Ord x) ) | |
262 cardinal-p x | case1 True = record { proj1 = x ; proj2 = yes True } | |
219 | 263 cardinal-p x | case2 False = record { proj1 = o∅ ; proj2 = no False } |
229 | 264 S = sup-o (λ x → proj1 (cardinal-p x)) |
230 | 265 lemma1 : (x : Ordinal) → ((y : Ordinal) → y o< x → Lift (suc n) (y o< (osuc S) → Onto X (Ord y))) → |
266 Lift (suc n) (x o< (osuc S) → Onto X (Ord x) ) | |
229 | 267 lemma1 x prev with trio< x (osuc S) |
268 lemma1 x prev | tri< a ¬b ¬c with osuc-≡< a | |
230 | 269 lemma1 x prev | tri< a ¬b ¬c | case1 x=S = lift ( λ lt → {!!} ) |
270 lemma1 x prev | tri< a ¬b ¬c | case2 x<S = lift ( λ lt → lemma2 ) where | |
271 lemma2 : Onto X (Ord x) | |
272 lemma2 with prev {!!} {!!} | |
273 ... | lift t = t {!!} | |
229 | 274 lemma1 x prev | tri≈ ¬a b ¬c = lift ( λ lt → ⊥-elim ( o<¬≡ b lt )) |
275 lemma1 x prev | tri> ¬a ¬b c = lift ( λ lt → ⊥-elim ( o<> c lt )) | |
230 | 276 onto : Onto X (Ord S) |
277 onto with TransFinite {λ x → Lift (suc n) ( x o< osuc S → Onto X (Ord x) ) } lemma1 S | |
278 ... | lift t = t <-osuc | |
279 cmax : (y : Ordinal) → S o< y → ¬ Onto X (Ord y) | |
229 | 280 cmax y lt ontoy = o<> lt (o<-subst {_} {_} {y} {S} |
224 | 281 (sup-o< {λ x → proj1 ( cardinal-p x)}{y} ) lemma refl ) where |
219 | 282 lemma : proj1 (cardinal-p y) ≡ y |
230 | 283 lemma with p∨¬p ( Onto X (Ord y) ) |
219 | 284 lemma | case1 x = refl |
285 lemma | case2 not = ⊥-elim ( not ontoy ) | |
217 | 286 |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
287 |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
288 ----- |
219 | 289 -- All cardinal is ℵ0, since we are working on Countable Ordinal, |
290 -- Power ω is larger than ℵ0, so it has no cardinal. | |
218 | 291 |
292 | |
293 |