Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate cardinal.agda @ 243:f97a2e4df451
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 25 Aug 2019 23:13:31 +0900 |
parents | c10048d69614 |
children | 0bd498de2ef4 |
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 |
238 | 30 data ord-pair : (p : Ordinal) → Set n where |
31 pair : (x y : Ordinal ) → ord-pair ( od→ord ( < ord→od x , ord→od y > ) ) | |
32 | |
33 ZFProduct : OD | |
34 ZFProduct = record { def = λ x → ord-pair x } | |
35 | |
242 | 36 pi1 : { p : Ordinal } → ord-pair p → Ordinal |
37 pi1 ( pair x y ) = x | |
38 | |
239 | 39 π1 : { p : OD } → ZFProduct ∋ p → Ordinal |
242 | 40 π1 lt = pi1 lt |
41 | |
42 pi2 : { p : Ordinal } → ord-pair p → Ordinal | |
43 pi2 ( pair x y ) = y | |
237 | 44 |
239 | 45 π2 : { p : OD } → ZFProduct ∋ p → Ordinal |
242 | 46 π2 lt = pi2 lt |
237 | 47 |
242 | 48 p-cons : ( x y : OD ) → ZFProduct ∋ < x , y > |
49 p-cons x y = def-subst {_} {_} {ZFProduct} {od→ord (< x , y >)} (pair (od→ord x) ( od→ord y )) refl ( | |
238 | 50 let open ≡-Reasoning in begin |
51 od→ord < ord→od (od→ord x) , ord→od (od→ord y) > | |
52 ≡⟨ cong₂ (λ j k → od→ord < j , k >) oiso oiso ⟩ | |
53 od→ord < x , y > | |
54 ∎ ) | |
242 | 55 |
243 | 56 open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ ) |
57 | |
58 eq-pair : { x x' y y' : Ordinal } → x ≡ x' → y ≡ y' → pair x y ≅ pair x' y' | |
59 eq-pair refl refl = HE.refl | |
60 | |
61 eq-prod : { x x' y y' : OD } → x ≡ x' → y ≡ y' → < x , y > ≡ < x' , y' > | |
62 eq-prod refl refl = refl | |
63 | |
64 π1-cong : { p q : OD } → p ≡ q → (pt : ZFProduct ∋ p ) → (qt : ZFProduct ∋ q ) → π1 pt ≅ π1 qt | |
65 π1-cong {p} {q} refl s t = HE.cong (λ k → pi1 k ) (lemma s t refl ) where | |
66 lemma : { op oq : Ordinal } → (P : ord-pair op ) → (Q : ord-pair oq ) → op ≡ oq → P ≅ Q | |
67 lemma (pair x y ) (pair x' y') eq = eq-pair {!!} {!!} | |
68 | |
69 Tlemma : { x y x' y' : Ordinal } → (prod : ord-pair (od→ord < ord→od x , ord→od y >)) | |
70 → (prod' : ord-pair (od→ord < ord→od x' , ord→od y' >)) → x ≡ x' → y ≡ y' → prod ≅ prod' | |
71 Tlemma prod prod' refl refl = lemma prod prod' refl where | |
72 lemma : { p q : Ordinal } → (prod : ord-pair p) → (prod1 : ord-pair q) → p ≡ q → prod ≅ prod1 | |
73 lemma (pair x y) (pair x' y') eq = {!!} | |
242 | 74 |
75 p-iso : { x : OD } → {p : ZFProduct ∋ x } → < ord→od (π1 p) , ord→od (π2 p) > ≡ x | |
243 | 76 p-iso {x} {p} with p-cons (ord→od (π1 p)) (ord→od (π2 p)) |
77 ... | t = {!!} | |
242 | 78 |
238 | 79 |
234
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
80 ∋-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
|
81 ∋-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
|
82 ∋-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
|
83 ∋-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
|
84 |
233 | 85 _⊗_ : (A B : OD) → OD |
239 | 86 A ⊗ B = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkAB p ) } where |
87 checkAB : { p : Ordinal } → def ZFProduct p → Set n | |
88 checkAB (pair x y) = def A x ∧ def B y | |
233 | 89 |
242 | 90 func→od0 : (f : Ordinal → Ordinal ) → OD |
91 func→od0 f = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkfunc p ) } where | |
92 checkfunc : { p : Ordinal } → def ZFProduct p → Set n | |
93 checkfunc (pair x y) = f x ≡ y | |
94 | |
233 | 95 -- Power (Power ( A ∪ B )) ∋ ( A ⊗ B ) |
225 | 96 |
233 | 97 Func : ( A B : OD ) → OD |
98 Func A B = record { def = λ x → def (Power (A ⊗ B)) x } | |
99 | |
100 -- 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
|
101 |
236 | 102 |
233 | 103 func→od : (f : Ordinal → Ordinal ) → ( dom : OD ) → OD |
104 func→od f dom = Replace dom ( λ x → < x , ord→od (f (od→ord x)) > ) | |
105 | |
242 | 106 record Func←cd { dom cod : OD } {f : Ordinal } : Set n where |
236 | 107 field |
108 func-1 : Ordinal → Ordinal | |
242 | 109 func→od∈Func-1 : Func dom cod ∋ func→od func-1 dom |
236 | 110 |
242 | 111 od→func : { dom cod : OD } → {f : Ordinal } → def (Func dom cod ) f → Func←cd {dom} {cod} {f} |
240 | 112 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 | 113 lemma : Ordinal → Ordinal → Ordinal |
114 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) | |
115 lemma x y | p | no n = o∅ | |
240 | 116 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) |
117 lemma2 : {p : Ordinal} → ord-pair p → Ordinal | |
118 lemma2 (pair x1 y1) with decp ( x1 ≡ x) | |
119 lemma2 (pair x1 y1) | yes p = y1 | |
120 lemma2 (pair x1 y1) | no ¬p = o∅ | |
242 | 121 fod : OD |
122 fod = Replace dom ( λ x → < x , ord→od (sup-o ( λ y → lemma (od→ord x) y )) > ) | |
240 | 123 |
124 | |
125 open Func←cd | |
236 | 126 |
227 | 127 -- contra position of sup-o< |
128 -- | |
129 | |
235 | 130 -- postulate |
131 -- -- contra-position of mimimulity of supermum required in Cardinal | |
132 -- sup-x : ( Ordinal → Ordinal ) → Ordinal | |
133 -- sup-lb : { ψ : Ordinal → Ordinal } → {z : Ordinal } → z o< sup-o ψ → z o< osuc (ψ (sup-x ψ)) | |
227 | 134 |
219 | 135 ------------ |
136 -- | |
137 -- Onto map | |
138 -- def X x -> xmap | |
139 -- X ---------------------------> Y | |
140 -- ymap <- def Y y | |
141 -- | |
224 | 142 record Onto (X Y : OD ) : Set n where |
219 | 143 field |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
144 xmap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
145 ymap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
146 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
|
147 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
|
148 onto-iso : {y : Ordinal } → (lty : def Y y ) → |
240 | 149 func-1 ( od→func {X} {Y} {xmap} xfunc ) ( func-1 (od→func yfunc) y ) ≡ y |
230 | 150 |
151 open Onto | |
152 | |
153 onto-restrict : {X Y Z : OD} → Onto X Y → ({x : OD} → _⊆_ Z Y {x}) → Onto X Z | |
154 onto-restrict {X} {Y} {Z} onto Z⊆Y = record { | |
155 xmap = xmap1 | |
156 ; ymap = zmap | |
157 ; xfunc = xfunc1 | |
158 ; yfunc = zfunc | |
159 ; onto-iso = onto-iso1 | |
160 } where | |
161 xmap1 : Ordinal | |
162 xmap1 = od→ord (Select (ord→od (xmap onto)) {!!} ) | |
163 zmap : Ordinal | |
164 zmap = {!!} | |
165 xfunc1 : def (Func X Z) xmap1 | |
166 xfunc1 = {!!} | |
167 zfunc : def (Func Z X) zmap | |
168 zfunc = {!!} | |
240 | 169 onto-iso1 : {z : Ordinal } → (ltz : def Z z ) → func-1 (od→func xfunc1 ) (func-1 (od→func zfunc ) z ) ≡ z |
230 | 170 onto-iso1 = {!!} |
171 | |
51 | 172 |
224 | 173 record Cardinal (X : OD ) : Set n where |
219 | 174 field |
224 | 175 cardinal : Ordinal |
230 | 176 conto : Onto X (Ord cardinal) |
177 cmax : ( y : Ordinal ) → cardinal o< y → ¬ Onto X (Ord y) | |
151 | 178 |
224 | 179 cardinal : (X : OD ) → Cardinal X |
180 cardinal X = record { | |
219 | 181 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
|
182 ; conto = onto |
219 | 183 ; cmax = cmax |
184 } where | |
230 | 185 cardinal-p : (x : Ordinal ) → ( Ordinal ∧ Dec (Onto X (Ord x) ) ) |
186 cardinal-p x with p∨¬p ( Onto X (Ord x) ) | |
187 cardinal-p x | case1 True = record { proj1 = x ; proj2 = yes True } | |
219 | 188 cardinal-p x | case2 False = record { proj1 = o∅ ; proj2 = no False } |
229 | 189 S = sup-o (λ x → proj1 (cardinal-p x)) |
230 | 190 lemma1 : (x : Ordinal) → ((y : Ordinal) → y o< x → Lift (suc n) (y o< (osuc S) → Onto X (Ord y))) → |
191 Lift (suc n) (x o< (osuc S) → Onto X (Ord x) ) | |
229 | 192 lemma1 x prev with trio< x (osuc S) |
193 lemma1 x prev | tri< a ¬b ¬c with osuc-≡< a | |
230 | 194 lemma1 x prev | tri< a ¬b ¬c | case1 x=S = lift ( λ lt → {!!} ) |
195 lemma1 x prev | tri< a ¬b ¬c | case2 x<S = lift ( λ lt → lemma2 ) where | |
196 lemma2 : Onto X (Ord x) | |
197 lemma2 with prev {!!} {!!} | |
198 ... | lift t = t {!!} | |
229 | 199 lemma1 x prev | tri≈ ¬a b ¬c = lift ( λ lt → ⊥-elim ( o<¬≡ b lt )) |
200 lemma1 x prev | tri> ¬a ¬b c = lift ( λ lt → ⊥-elim ( o<> c lt )) | |
230 | 201 onto : Onto X (Ord S) |
202 onto with TransFinite {λ x → Lift (suc n) ( x o< osuc S → Onto X (Ord x) ) } lemma1 S | |
203 ... | lift t = t <-osuc | |
204 cmax : (y : Ordinal) → S o< y → ¬ Onto X (Ord y) | |
229 | 205 cmax y lt ontoy = o<> lt (o<-subst {_} {_} {y} {S} |
224 | 206 (sup-o< {λ x → proj1 ( cardinal-p x)}{y} ) lemma refl ) where |
219 | 207 lemma : proj1 (cardinal-p y) ≡ y |
230 | 208 lemma with p∨¬p ( Onto X (Ord y) ) |
219 | 209 lemma | case1 x = refl |
210 lemma | case2 not = ⊥-elim ( not ontoy ) | |
217 | 211 |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
212 |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
213 ----- |
219 | 214 -- All cardinal is ℵ0, since we are working on Countable Ordinal, |
215 -- Power ω is larger than ℵ0, so it has no cardinal. | |
218 | 216 |
217 | |
218 |