Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate cardinal.agda @ 248:9fd85b954477
prod-eq done
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 27 Aug 2019 14:13:27 +0900 |
parents | d09437fcfc7c |
children | 2ecda48298e3 |
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 | |
248 | 64 open _==_ |
65 | |
66 exg-pair : { x y : OD } → (x , y ) == ( y , x ) | |
67 exg-pair {x} {y} = record { eq→ = left ; eq← = right } where | |
68 left : {z : Ordinal} → def (x , y) z → def (y , x) z | |
69 left (case1 t) = case2 t | |
70 left (case2 t) = case1 t | |
71 right : {z : Ordinal} → def (y , x) z → def (x , y) z | |
72 right (case1 t) = case2 t | |
73 right (case2 t) = case1 t | |
74 | |
75 ==-trans : { x y z : OD } → x == y → y == z → x == z | |
76 ==-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) } | |
77 | |
78 ==-sym : { x y : OD } → x == y → y == x | |
79 ==-sym x=y = record { eq→ = λ {m} t → eq← x=y t ; eq← = λ {m} t → eq→ x=y t } | |
80 | |
81 ord≡→≡ : { x y : OD } → od→ord x ≡ od→ord y → x ≡ y | |
82 ord≡→≡ eq = subst₂ (λ j k → j ≡ k ) oiso oiso ( cong ( λ k → ord→od k ) eq ) | |
83 | |
84 prod-eq : { x x' y y' : OD } → < x , y > == < x' , y' > → (x ≡ x' ) ∧ ( y ≡ y' ) | |
85 prod-eq {x} {x'} {y} {y'} eq = record { proj1 = lemmax ; proj2 = lemmay } where | |
86 lemma0 : {x y z : OD } → ( x , x ) == ( z , y ) → x ≡ y | |
87 lemma0 {x} {y} eq with trio< (od→ord x) (od→ord y) | |
88 lemma0 {x} {y} eq | tri< a ¬b ¬c with eq← eq {od→ord y} (case2 refl) | |
89 lemma0 {x} {y} eq | tri< a ¬b ¬c | case1 s = ⊥-elim ( o<¬≡ (sym s) a ) | |
90 lemma0 {x} {y} eq | tri< a ¬b ¬c | case2 s = ⊥-elim ( o<¬≡ (sym s) a ) | |
91 lemma0 {x} {y} eq | tri≈ ¬a b ¬c = ord≡→≡ b | |
92 lemma0 {x} {y} eq | tri> ¬a ¬b c with eq← eq {od→ord y} (case2 refl) | |
93 lemma0 {x} {y} eq | tri> ¬a ¬b c | case1 s = ⊥-elim ( o<¬≡ s c ) | |
94 lemma0 {x} {y} eq | tri> ¬a ¬b c | case2 s = ⊥-elim ( o<¬≡ s c ) | |
95 lemma2 : {x y z : OD } → ( x , x ) == ( z , y ) → z ≡ y | |
96 lemma2 {x} {y} {z} eq = trans (sym (lemma0 lemma3 )) ( lemma0 eq ) where | |
97 lemma3 : ( x , x ) == ( y , z ) | |
98 lemma3 = ==-trans eq exg-pair | |
99 lemma1 : {x y : OD } → ( x , x ) == ( y , y ) → x ≡ y | |
100 lemma1 {x} {y} eq with eq← eq {od→ord y} (case2 refl) | |
101 lemma1 {x} {y} eq | case1 s = ord≡→≡ (sym s) | |
102 lemma1 {x} {y} eq | case2 s = ord≡→≡ (sym s) | |
103 lemma4 : {x y z : OD } → ( x , y ) == ( x , z ) → y ≡ z | |
104 lemma4 {x} {y} {z} eq with eq← eq {od→ord z} (case2 refl) | |
105 lemma4 {x} {y} {z} eq | case1 s with ord≡→≡ s -- x ≡ z | |
106 ... | refl with lemma2 (==-sym eq ) | |
107 ... | refl = refl | |
108 lemma4 {x} {y} {z} eq | case2 s = ord≡→≡ (sym s) -- y ≡ z | |
109 lemmax : x ≡ x' | |
110 lemmax with eq→ eq {od→ord (x , x)} (case1 refl) | |
111 lemmax | case1 s = lemma1 (ord→== s ) -- (x,x)≡(x',x') | |
112 lemmax | case2 s with lemma2 (ord→== s ) -- (x,x)≡(x',y') with x'≡y' | |
113 ... | refl = lemma1 (ord→== s ) | |
114 lemmay : y ≡ y' | |
115 lemmay with lemmax | |
116 ... | refl with lemma4 eq -- with (x,y)≡(x,y') | |
117 ... | eq1 = lemma4 (ord→== (cong (λ k → od→ord k ) eq1 )) | |
247 | 118 |
245 | 119 postulate |
120 def-eq : { P Q p q : OD } → P ≡ Q → p ≡ q → (pt : P ∋ p ) → (qt : Q ∋ q ) → pt ≅ qt | |
244 | 121 |
247 | 122 ∈-to-ord : {p : Ordinal } → ( ZFProduct ∋ ord→od p ) → ord-pair p |
123 ∈-to-ord {p} lt = def-subst {ZFProduct} {(od→ord (ord→od p))} {_} {_} lt refl diso | |
124 | |
125 ord-to-∈ : {p : Ordinal } → ord-pair p → ZFProduct ∋ ord→od p | |
126 ord-to-∈ {p} lt = def-subst {_} {_} {ZFProduct} {(od→ord (ord→od p))} lt refl (sym diso) | |
127 | |
128 lemma333 : { A a : OD } → { x : A ∋ a } → def-subst {A} {od→ord a} (def-subst {A} {od→ord a} x refl refl ) refl refl ≡ x | |
129 lemma333 = refl | |
130 | |
131 lemma334 : { A B : OD } → {a b : Ordinal} → { x : A ∋ ord→od a } → { y : B ∋ ord→od b } → (f1 : A ≡ B) → (f2 : a ≡ b) | |
132 → def-subst {B} {od→ord (ord→od b)} (def-subst {A} { od→ord (ord→od a)} x f1 (cong (λ k → od→ord (ord→od k)) f2 )) refl refl ≅ x | |
133 lemma334 {A} {A} {a} {a} {x} {y} refl refl with def-eq {A} {A} {ord→od a} {ord→od a} refl refl x y | |
134 ... | HE.refl = HE.refl | |
135 | |
136 lemma335 : { A B C : OD } → {a b c : Ordinal} → { x : A ∋ ord→od a } → { y : C ∋ ord→od c } → (f1 : A ≡ B) → (f2 : a ≡ b) → (g1 : B ≡ C) → (g2 : b ≡ c) | |
137 → def-subst {B} {od→ord (ord→od b)} (def-subst {A} { od→ord (ord→od a)} x f1 (cong (λ k → od→ord (ord→od k)) f2 )) g1 (cong (λ k → od→ord (ord→od k)) g2 ) | |
138 ≅ def-subst {A} { od→ord (ord→od a)} {C } { od→ord (ord→od c)} x (trans f1 g1) | |
139 (trans (cong (λ k → od→ord (ord→od k)) f2 ) (cong (λ k → od→ord (ord→od k)) g2 )) | |
140 lemma335 {A} {A} {A} {a} {a} {a} {x} {y} refl refl refl refl with def-eq {A} {A} {ord→od a} {ord→od a} refl refl x y | |
141 ... | HE.refl = HE.refl | |
142 | |
143 ∈-to-ord-oiso : { p : Ordinal } → { x : ord-pair p } → ∈-to-ord (ord-to-∈ x) ≡ x | |
144 ∈-to-ord-oiso {p} {x} = {!!} where | |
145 lemma : def-subst {_} {_} {ZFProduct} {{!!}} (def-subst {_} {_} {ZFProduct} {{!!}} x refl (sym diso)) refl diso ≡ x | |
146 lemma = {!!} | |
147 | |
244 | 148 lemma34 : { p q : Ordinal } → (x : ord-pair p ) → (y : ord-pair q ) → p ≡ q → x ≅ y |
247 | 149 lemma34 {p} {q} x y refl = subst₂ (λ j k → j ≅ k) ∈-to-ord-oiso ∈-to-ord-oiso (HE.cong (λ k → ∈-to-ord k) lemma1 ) where |
245 | 150 lemma : (pt : ZFProduct ∋ ord→od p ) → (qt : ZFProduct ∋ ord→od q ) → p ≡ q → pt ≅ qt |
247 | 151 lemma pt qt eq = def-eq {ZFProduct} {ZFProduct} refl (cong (λ k → ord→od k) eq) pt qt |
152 lemma1 : (ord-to-∈ x) ≅ (ord-to-∈ y ) | |
153 lemma1 = lemma (ord-to-∈ x) (ord-to-∈ y ) refl | |
244 | 154 |
243 | 155 π1-cong : { p q : OD } → p ≡ q → (pt : ZFProduct ∋ p ) → (qt : ZFProduct ∋ q ) → π1 pt ≅ π1 qt |
245 | 156 π1-cong {p} {q} refl s t = HE.cong (λ k → pi1 k ) (def-eq {ZFProduct} {ZFProduct} refl refl s t ) |
242 | 157 |
246 | 158 π1--iso : { x y : OD } → (p : ZFProduct ∋ < x , y > ) → π1 p ≅ od→ord x |
159 π1--iso {x} {y} p = lemma (od→ord x) (od→ord y) {!!} {!!} refl where | |
244 | 160 lemma1 : ( ox oy op : Ordinal ) → (p : ord-pair op) → op ≡ od→ord ( < ord→od ox , ord→od oy >) → p ≅ pair ox oy |
245 | 161 lemma1 ox oy op (pair x' y') eq = lemma34 {!!} {!!} {!!} |
246 | 162 lemma : ( ox oy op : Ordinal ) → (p : ord-pair op ) → op ≡ od→ord ( < ord→od ox , ord→od oy > ) → pi1 p ≅ ox |
163 lemma ox oy op p eq = {!!} -- HE.cong (λ k → pi1 k ) (lemma1 ox oy op p eq ) | |
244 | 164 |
242 | 165 p-iso : { x : OD } → {p : ZFProduct ∋ x } → < ord→od (π1 p) , ord→od (π2 p) > ≡ x |
243 | 166 p-iso {x} {p} with p-cons (ord→od (π1 p)) (ord→od (π2 p)) |
167 ... | t = {!!} | |
242 | 168 |
238 | 169 |
234
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
233
diff
changeset
|
170 ∋-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
|
171 ∋-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
|
172 ∋-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
|
173 ∋-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
|
174 |
233 | 175 _⊗_ : (A B : OD) → OD |
239 | 176 A ⊗ B = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkAB p ) } where |
177 checkAB : { p : Ordinal } → def ZFProduct p → Set n | |
178 checkAB (pair x y) = def A x ∧ def B y | |
233 | 179 |
242 | 180 func→od0 : (f : Ordinal → Ordinal ) → OD |
181 func→od0 f = record { def = λ x → def ZFProduct x ∧ ( { x : Ordinal } → (p : def ZFProduct x ) → checkfunc p ) } where | |
182 checkfunc : { p : Ordinal } → def ZFProduct p → Set n | |
183 checkfunc (pair x y) = f x ≡ y | |
184 | |
233 | 185 -- Power (Power ( A ∪ B )) ∋ ( A ⊗ B ) |
225 | 186 |
233 | 187 Func : ( A B : OD ) → OD |
188 Func A B = record { def = λ x → def (Power (A ⊗ B)) x } | |
189 | |
190 -- 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
|
191 |
236 | 192 |
233 | 193 func→od : (f : Ordinal → Ordinal ) → ( dom : OD ) → OD |
194 func→od f dom = Replace dom ( λ x → < x , ord→od (f (od→ord x)) > ) | |
195 | |
242 | 196 record Func←cd { dom cod : OD } {f : Ordinal } : Set n where |
236 | 197 field |
198 func-1 : Ordinal → Ordinal | |
242 | 199 func→od∈Func-1 : Func dom cod ∋ func→od func-1 dom |
236 | 200 |
242 | 201 od→func : { dom cod : OD } → {f : Ordinal } → def (Func dom cod ) f → Func←cd {dom} {cod} {f} |
240 | 202 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 | 203 lemma : Ordinal → Ordinal → Ordinal |
204 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) | |
205 lemma x y | p | no n = o∅ | |
240 | 206 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) |
207 lemma2 : {p : Ordinal} → ord-pair p → Ordinal | |
208 lemma2 (pair x1 y1) with decp ( x1 ≡ x) | |
209 lemma2 (pair x1 y1) | yes p = y1 | |
210 lemma2 (pair x1 y1) | no ¬p = o∅ | |
242 | 211 fod : OD |
212 fod = Replace dom ( λ x → < x , ord→od (sup-o ( λ y → lemma (od→ord x) y )) > ) | |
240 | 213 |
214 | |
215 open Func←cd | |
236 | 216 |
227 | 217 -- contra position of sup-o< |
218 -- | |
219 | |
235 | 220 -- postulate |
221 -- -- contra-position of mimimulity of supermum required in Cardinal | |
222 -- sup-x : ( Ordinal → Ordinal ) → Ordinal | |
223 -- sup-lb : { ψ : Ordinal → Ordinal } → {z : Ordinal } → z o< sup-o ψ → z o< osuc (ψ (sup-x ψ)) | |
227 | 224 |
219 | 225 ------------ |
226 -- | |
227 -- Onto map | |
228 -- def X x -> xmap | |
229 -- X ---------------------------> Y | |
230 -- ymap <- def Y y | |
231 -- | |
224 | 232 record Onto (X Y : OD ) : Set n where |
219 | 233 field |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
234 xmap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
235 ymap : Ordinal |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
236 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
|
237 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
|
238 onto-iso : {y : Ordinal } → (lty : def Y y ) → |
240 | 239 func-1 ( od→func {X} {Y} {xmap} xfunc ) ( func-1 (od→func yfunc) y ) ≡ y |
230 | 240 |
241 open Onto | |
242 | |
243 onto-restrict : {X Y Z : OD} → Onto X Y → ({x : OD} → _⊆_ Z Y {x}) → Onto X Z | |
244 onto-restrict {X} {Y} {Z} onto Z⊆Y = record { | |
245 xmap = xmap1 | |
246 ; ymap = zmap | |
247 ; xfunc = xfunc1 | |
248 ; yfunc = zfunc | |
249 ; onto-iso = onto-iso1 | |
250 } where | |
251 xmap1 : Ordinal | |
252 xmap1 = od→ord (Select (ord→od (xmap onto)) {!!} ) | |
253 zmap : Ordinal | |
254 zmap = {!!} | |
255 xfunc1 : def (Func X Z) xmap1 | |
256 xfunc1 = {!!} | |
257 zfunc : def (Func Z X) zmap | |
258 zfunc = {!!} | |
240 | 259 onto-iso1 : {z : Ordinal } → (ltz : def Z z ) → func-1 (od→func xfunc1 ) (func-1 (od→func zfunc ) z ) ≡ z |
230 | 260 onto-iso1 = {!!} |
261 | |
51 | 262 |
224 | 263 record Cardinal (X : OD ) : Set n where |
219 | 264 field |
224 | 265 cardinal : Ordinal |
230 | 266 conto : Onto X (Ord cardinal) |
267 cmax : ( y : Ordinal ) → cardinal o< y → ¬ Onto X (Ord y) | |
151 | 268 |
224 | 269 cardinal : (X : OD ) → Cardinal X |
270 cardinal X = record { | |
219 | 271 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
|
272 ; conto = onto |
219 | 273 ; cmax = cmax |
274 } where | |
230 | 275 cardinal-p : (x : Ordinal ) → ( Ordinal ∧ Dec (Onto X (Ord x) ) ) |
276 cardinal-p x with p∨¬p ( Onto X (Ord x) ) | |
277 cardinal-p x | case1 True = record { proj1 = x ; proj2 = yes True } | |
219 | 278 cardinal-p x | case2 False = record { proj1 = o∅ ; proj2 = no False } |
229 | 279 S = sup-o (λ x → proj1 (cardinal-p x)) |
230 | 280 lemma1 : (x : Ordinal) → ((y : Ordinal) → y o< x → Lift (suc n) (y o< (osuc S) → Onto X (Ord y))) → |
281 Lift (suc n) (x o< (osuc S) → Onto X (Ord x) ) | |
229 | 282 lemma1 x prev with trio< x (osuc S) |
283 lemma1 x prev | tri< a ¬b ¬c with osuc-≡< a | |
230 | 284 lemma1 x prev | tri< a ¬b ¬c | case1 x=S = lift ( λ lt → {!!} ) |
285 lemma1 x prev | tri< a ¬b ¬c | case2 x<S = lift ( λ lt → lemma2 ) where | |
286 lemma2 : Onto X (Ord x) | |
287 lemma2 with prev {!!} {!!} | |
288 ... | lift t = t {!!} | |
229 | 289 lemma1 x prev | tri≈ ¬a b ¬c = lift ( λ lt → ⊥-elim ( o<¬≡ b lt )) |
290 lemma1 x prev | tri> ¬a ¬b c = lift ( λ lt → ⊥-elim ( o<> c lt )) | |
230 | 291 onto : Onto X (Ord S) |
292 onto with TransFinite {λ x → Lift (suc n) ( x o< osuc S → Onto X (Ord x) ) } lemma1 S | |
293 ... | lift t = t <-osuc | |
294 cmax : (y : Ordinal) → S o< y → ¬ Onto X (Ord y) | |
229 | 295 cmax y lt ontoy = o<> lt (o<-subst {_} {_} {y} {S} |
224 | 296 (sup-o< {λ x → proj1 ( cardinal-p x)}{y} ) lemma refl ) where |
219 | 297 lemma : proj1 (cardinal-p y) ≡ y |
230 | 298 lemma with p∨¬p ( Onto X (Ord y) ) |
219 | 299 lemma | case1 x = refl |
300 lemma | case2 not = ⊥-elim ( not ontoy ) | |
217 | 301 |
226
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
302 |
176ff97547b4
set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
303 ----- |
219 | 304 -- All cardinal is ℵ0, since we are working on Countable Ordinal, |
305 -- Power ω is larger than ℵ0, so it has no cardinal. | |
218 | 306 |
307 | |
308 |