Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate src/zorn.agda @ 954:e43a5cc72287
IsSUP is now min sup
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Wed, 02 Nov 2022 13:53:10 +0900 |
parents | dfb4f7e9c454 |
children | bc27df170a1e |
rev | line source |
---|---|
478 | 1 {-# OPTIONS --allow-unsolved-metas #-} |
508 | 2 open import Level hiding ( suc ; zero ) |
431 | 3 open import Ordinals |
552 | 4 open import Relation.Binary |
5 open import Relation.Binary.Core | |
6 open import Relation.Binary.PropositionalEquality | |
497 | 7 import OD |
552 | 8 module zorn {n : Level } (O : Ordinals {n}) (_<_ : (x y : OD.HOD O ) → Set n ) (PO : IsStrictPartialOrder _≡_ _<_ ) where |
431 | 9 |
560 | 10 -- |
11 -- Zorn-lemma : { A : HOD } | |
12 -- → o∅ o< & A | |
13 -- → ( ( B : HOD) → (B⊆A : B ⊆ A) → IsTotalOrderSet B → SUP A B ) -- SUP condition | |
14 -- → Maximal A | |
15 -- | |
16 | |
431 | 17 open import zf |
477 | 18 open import logic |
19 -- open import partfunc {n} O | |
20 | |
21 open import Relation.Nullary | |
22 open import Data.Empty | |
23 import BAlgbra | |
431 | 24 |
555 | 25 open import Data.Nat hiding ( _<_ ; _≤_ ) |
26 open import Data.Nat.Properties | |
27 open import nat | |
28 | |
431 | 29 |
30 open inOrdinal O | |
31 open OD O | |
32 open OD.OD | |
33 open ODAxiom odAxiom | |
477 | 34 import OrdUtil |
35 import ODUtil | |
431 | 36 open Ordinals.Ordinals O |
37 open Ordinals.IsOrdinals isOrdinal | |
38 open Ordinals.IsNext isNext | |
39 open OrdUtil O | |
477 | 40 open ODUtil O |
41 | |
42 | |
43 import ODC | |
44 | |
45 open _∧_ | |
46 open _∨_ | |
47 open Bool | |
431 | 48 |
49 open HOD | |
50 | |
560 | 51 -- |
52 -- Partial Order on HOD ( possibly limited in A ) | |
53 -- | |
54 | |
872 | 55 _<<_ : (x y : Ordinal ) → Set n |
570 | 56 x << y = * x < * y |
57 | |
872 | 58 _<=_ : (x y : Ordinal ) → Set n -- we can't use * x ≡ * y, it is Set (Level.suc n). Level (suc n) troubles Chain |
765 | 59 x <= y = (x ≡ y ) ∨ ( * x < * y ) |
60 | |
570 | 61 POO : IsStrictPartialOrder _≡_ _<<_ |
62 POO = record { isEquivalence = record { refl = refl ; sym = sym ; trans = trans } | |
63 ; trans = IsStrictPartialOrder.trans PO | |
64 ; irrefl = λ x=y x<y → IsStrictPartialOrder.irrefl PO (cong (*) x=y) x<y | |
65 ; <-resp-≈ = record { fst = λ {x} {y} {y1} y=y1 xy1 → subst (λ k → x << k ) y=y1 xy1 ; snd = λ {x} {x1} {y} x=x1 x1y → subst (λ k → k << x ) x=x1 x1y } } | |
66 | |
528
8facdd7cc65a
TransitiveClosure with x <= f x is possible
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
527
diff
changeset
|
67 _≤_ : (x y : HOD) → Set (Level.suc n) |
8facdd7cc65a
TransitiveClosure with x <= f x is possible
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
527
diff
changeset
|
68 x ≤ y = ( x ≡ y ) ∨ ( x < y ) |
8facdd7cc65a
TransitiveClosure with x <= f x is possible
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
527
diff
changeset
|
69 |
554 | 70 ≤-ftrans : {x y z : HOD} → x ≤ y → y ≤ z → x ≤ z |
71 ≤-ftrans {x} {y} {z} (case1 refl ) (case1 refl ) = case1 refl | |
72 ≤-ftrans {x} {y} {z} (case1 refl ) (case2 y<z) = case2 y<z | |
73 ≤-ftrans {x} {_} {z} (case2 x<y ) (case1 refl ) = case2 x<y | |
74 ≤-ftrans {x} {y} {z} (case2 x<y) (case2 y<z) = case2 ( IsStrictPartialOrder.trans PO x<y y<z ) | |
75 | |
779 | 76 <-ftrans : {x y z : Ordinal } → x <= y → y <= z → x <= z |
77 <-ftrans {x} {y} {z} (case1 refl ) (case1 refl ) = case1 refl | |
78 <-ftrans {x} {y} {z} (case1 refl ) (case2 y<z) = case2 y<z | |
79 <-ftrans {x} {_} {z} (case2 x<y ) (case1 refl ) = case2 x<y | |
80 <-ftrans {x} {y} {z} (case2 x<y) (case2 y<z) = case2 ( IsStrictPartialOrder.trans PO x<y y<z ) | |
81 | |
951 | 82 ftrans<=-< : {x y z : Ordinal } → x <= y → y << z → x << z |
953 | 83 ftrans<=-< {x} {y} {z} (case1 eq) y<z = subst (λ k → k < * z) (sym (cong (*) eq)) y<z |
951 | 84 ftrans<=-< {x} {y} {z} (case2 lt) y<z = IsStrictPartialOrder.trans PO lt y<z |
85 | |
770 | 86 <=to≤ : {x y : Ordinal } → x <= y → * x ≤ * y |
87 <=to≤ (case1 eq) = case1 (cong (*) eq) | |
88 <=to≤ (case2 lt) = case2 lt | |
89 | |
779 | 90 ≤to<= : {x y : Ordinal } → * x ≤ * y → x <= y |
91 ≤to<= (case1 eq) = case1 ( subst₂ (λ j k → j ≡ k ) &iso &iso (cong (&) eq) ) | |
92 ≤to<= (case2 lt) = case2 lt | |
93 | |
556 | 94 <-irr : {a b : HOD} → (a ≡ b ) ∨ (a < b ) → b < a → ⊥ |
95 <-irr {a} {b} (case1 a=b) b<a = IsStrictPartialOrder.irrefl PO (sym a=b) b<a | |
96 <-irr {a} {b} (case2 a<b) b<a = IsStrictPartialOrder.irrefl PO refl | |
97 (IsStrictPartialOrder.trans PO b<a a<b) | |
490 | 98 |
561 | 99 ptrans = IsStrictPartialOrder.trans PO |
100 | |
492 | 101 open _==_ |
102 open _⊆_ | |
103 | |
879 | 104 -- <-TransFinite : {A x : HOD} → {P : HOD → Set n} → x ∈ A |
105 -- → ({x : HOD} → A ∋ x → ({y : HOD} → A ∋ y → y < x → P y ) → P x) → P x | |
106 -- <-TransFinite = ? | |
107 | |
530 | 108 -- |
560 | 109 -- Closure of ≤-monotonic function f has total order |
530 | 110 -- |
111 | |
112 ≤-monotonic-f : (A : HOD) → ( Ordinal → Ordinal ) → Set (Level.suc n) | |
113 ≤-monotonic-f A f = (x : Ordinal ) → odef A x → ( * x ≤ * (f x) ) ∧ odef A (f x ) | |
114 | |
551 | 115 data FClosure (A : HOD) (f : Ordinal → Ordinal ) (s : Ordinal) : Ordinal → Set n where |
783 | 116 init : {s1 : Ordinal } → odef A s → s ≡ s1 → FClosure A f s s1 |
555 | 117 fsuc : (x : Ordinal) ( p : FClosure A f s x ) → FClosure A f s (f x) |
554 | 118 |
556 | 119 A∋fc : {A : HOD} (s : Ordinal) {y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) → (fcy : FClosure A f s y ) → odef A y |
783 | 120 A∋fc {A} s f mf (init as refl ) = as |
556 | 121 A∋fc {A} s f mf (fsuc y fcy) = proj2 (mf y ( A∋fc {A} s f mf fcy ) ) |
555 | 122 |
714 | 123 A∋fcs : {A : HOD} (s : Ordinal) {y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) → (fcy : FClosure A f s y ) → odef A s |
783 | 124 A∋fcs {A} s f mf (init as refl) = as |
714 | 125 A∋fcs {A} s f mf (fsuc y fcy) = A∋fcs {A} s f mf fcy |
126 | |
556 | 127 s≤fc : {A : HOD} (s : Ordinal ) {y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) → (fcy : FClosure A f s y ) → * s ≤ * y |
783 | 128 s≤fc {A} s {.s} f mf (init x refl ) = case1 refl |
556 | 129 s≤fc {A} s {.(f x)} f mf (fsuc x fcy) with proj1 (mf x (A∋fc s f mf fcy ) ) |
130 ... | case1 x=fx = subst (λ k → * s ≤ * k ) (*≡*→≡ x=fx) ( s≤fc {A} s f mf fcy ) | |
131 ... | case2 x<fx with s≤fc {A} s f mf fcy | |
132 ... | case1 s≡x = case2 ( subst₂ (λ j k → j < k ) (sym s≡x) refl x<fx ) | |
133 ... | case2 s<x = case2 ( IsStrictPartialOrder.trans PO s<x x<fx ) | |
555 | 134 |
800 | 135 fcn : {A : HOD} (s : Ordinal) { x : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) → FClosure A f s x → ℕ |
136 fcn s mf (init as refl) = zero | |
137 fcn {A} s {x} {f} mf (fsuc y p) with proj1 (mf y (A∋fc s f mf p)) | |
138 ... | case1 eq = fcn s mf p | |
139 ... | case2 y<fy = suc (fcn s mf p ) | |
140 | |
141 fcn-inject : {A : HOD} (s : Ordinal) { x y : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) | |
142 → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → fcn s mf cx ≡ fcn s mf cy → * x ≡ * y | |
143 fcn-inject {A} s {x} {y} {f} mf cx cy eq = fc00 (fcn s mf cx) (fcn s mf cy) eq cx cy refl refl where | |
144 fc06 : {y : Ordinal } { as : odef A s } (eq : s ≡ y ) { j : ℕ } → ¬ suc j ≡ fcn {A} s {y} {f} mf (init as eq ) | |
145 fc06 {x} {y} refl {j} not = fc08 not where | |
146 fc08 : {j : ℕ} → ¬ suc j ≡ 0 | |
147 fc08 () | |
148 fc07 : {x : Ordinal } (cx : FClosure A f s x ) → 0 ≡ fcn s mf cx → * s ≡ * x | |
149 fc07 {x} (init as refl) eq = refl | |
150 fc07 {.(f x)} (fsuc x cx) eq with proj1 (mf x (A∋fc s f mf cx ) ) | |
151 ... | case1 x=fx = subst (λ k → * s ≡ k ) x=fx ( fc07 cx eq ) | |
152 -- ... | case2 x<fx = ? | |
153 fc00 : (i j : ℕ ) → i ≡ j → {x y : Ordinal } → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → i ≡ fcn s mf cx → j ≡ fcn s mf cy → * x ≡ * y | |
154 fc00 (suc i) (suc j) x cx (init x₃ x₄) x₁ x₂ = ⊥-elim ( fc06 x₄ x₂ ) | |
155 fc00 (suc i) (suc j) x (init x₃ x₄) (fsuc x₅ cy) x₁ x₂ = ⊥-elim ( fc06 x₄ x₁ ) | |
156 fc00 zero zero refl (init _ refl) (init x₁ refl) i=x i=y = refl | |
157 fc00 zero zero refl (init as refl) (fsuc y cy) i=x i=y with proj1 (mf y (A∋fc s f mf cy ) ) | |
158 ... | case1 y=fy = subst (λ k → * s ≡ k ) y=fy (fc07 cy i=y) -- ( fc00 zero zero refl (init as refl) cy i=x i=y ) | |
159 fc00 zero zero refl (fsuc x cx) (init as refl) i=x i=y with proj1 (mf x (A∋fc s f mf cx ) ) | |
160 ... | case1 x=fx = subst (λ k → k ≡ * s ) x=fx (sym (fc07 cx i=x)) -- ( fc00 zero zero refl cx (init as refl) i=x i=y ) | |
161 fc00 zero zero refl (fsuc x cx) (fsuc y cy) i=x i=y with proj1 (mf x (A∋fc s f mf cx ) ) | proj1 (mf y (A∋fc s f mf cy ) ) | |
162 ... | case1 x=fx | case1 y=fy = subst₂ (λ j k → j ≡ k ) x=fx y=fy ( fc00 zero zero refl cx cy i=x i=y ) | |
163 fc00 (suc i) (suc j) i=j {.(f x)} {.(f y)} (fsuc x cx) (fsuc y cy) i=x j=y with proj1 (mf x (A∋fc s f mf cx ) ) | proj1 (mf y (A∋fc s f mf cy ) ) | |
164 ... | case1 x=fx | case1 y=fy = subst₂ (λ j k → j ≡ k ) x=fx y=fy ( fc00 (suc i) (suc j) i=j cx cy i=x j=y ) | |
165 ... | case1 x=fx | case2 y<fy = subst (λ k → k ≡ * (f y)) x=fx (fc02 x cx i=x) where | |
166 fc02 : (x1 : Ordinal) → (cx1 : FClosure A f s x1 ) → suc i ≡ fcn s mf cx1 → * x1 ≡ * (f y) | |
167 fc02 x1 (init x₁ x₂) x = ⊥-elim (fc06 x₂ x) | |
168 fc02 .(f x1) (fsuc x1 cx1) i=x1 with proj1 (mf x1 (A∋fc s f mf cx1 ) ) | |
169 ... | case1 eq = trans (sym eq) ( fc02 x1 cx1 i=x1 ) -- derefence while f x ≡ x | |
170 ... | case2 lt = subst₂ (λ j k → * (f j) ≡ * (f k )) &iso &iso ( cong (λ k → * ( f (& k ))) fc04) where | |
171 fc04 : * x1 ≡ * y | |
172 fc04 = fc00 i j (cong pred i=j) cx1 cy (cong pred i=x1) (cong pred j=y) | |
173 ... | case2 x<fx | case1 y=fy = subst (λ k → * (f x) ≡ k ) y=fy (fc03 y cy j=y) where | |
174 fc03 : (y1 : Ordinal) → (cy1 : FClosure A f s y1 ) → suc j ≡ fcn s mf cy1 → * (f x) ≡ * y1 | |
175 fc03 y1 (init x₁ x₂) x = ⊥-elim (fc06 x₂ x) | |
176 fc03 .(f y1) (fsuc y1 cy1) j=y1 with proj1 (mf y1 (A∋fc s f mf cy1 ) ) | |
177 ... | case1 eq = trans ( fc03 y1 cy1 j=y1 ) eq | |
178 ... | case2 lt = subst₂ (λ j k → * (f j) ≡ * (f k )) &iso &iso ( cong (λ k → * ( f (& k ))) fc05) where | |
179 fc05 : * x ≡ * y1 | |
180 fc05 = fc00 i j (cong pred i=j) cx cy1 (cong pred i=x) (cong pred j=y1) | |
181 ... | case2 x₁ | case2 x₂ = subst₂ (λ j k → * (f j) ≡ * (f k) ) &iso &iso (cong (λ k → * (f (& k))) (fc00 i j (cong pred i=j) cx cy (cong pred i=x) (cong pred j=y))) | |
182 | |
183 | |
184 fcn-< : {A : HOD} (s : Ordinal ) { x y : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) | |
185 → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → fcn s mf cx Data.Nat.< fcn s mf cy → * x < * y | |
186 fcn-< {A} s {x} {y} {f} mf cx cy x<y = fc01 (fcn s mf cy) cx cy refl x<y where | |
187 fc06 : {y : Ordinal } { as : odef A s } (eq : s ≡ y ) { j : ℕ } → ¬ suc j ≡ fcn {A} s {y} {f} mf (init as eq ) | |
188 fc06 {x} {y} refl {j} not = fc08 not where | |
189 fc08 : {j : ℕ} → ¬ suc j ≡ 0 | |
190 fc08 () | |
191 fc01 : (i : ℕ ) → {y : Ordinal } → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → (i ≡ fcn s mf cy ) → fcn s mf cx Data.Nat.< i → * x < * y | |
192 fc01 (suc i) cx (init x₁ x₂) x (s≤s x₃) = ⊥-elim (fc06 x₂ x) | |
193 fc01 (suc i) {y} cx (fsuc y1 cy) i=y (s≤s x<i) with proj1 (mf y1 (A∋fc s f mf cy ) ) | |
194 ... | case1 y=fy = subst (λ k → * x < k ) y=fy ( fc01 (suc i) {y1} cx cy i=y (s≤s x<i) ) | |
195 ... | case2 y<fy with <-cmp (fcn s mf cx ) i | |
196 ... | tri> ¬a ¬b c = ⊥-elim ( nat-≤> x<i c ) | |
197 ... | tri≈ ¬a b ¬c = subst (λ k → k < * (f y1) ) (fcn-inject s mf cy cx (sym (trans b (cong pred i=y) ))) y<fy | |
198 ... | tri< a ¬b ¬c = IsStrictPartialOrder.trans PO fc02 y<fy where | |
199 fc03 : suc i ≡ suc (fcn s mf cy) → i ≡ fcn s mf cy | |
200 fc03 eq = cong pred eq | |
201 fc02 : * x < * y1 | |
202 fc02 = fc01 i cx cy (fc03 i=y ) a | |
203 | |
557 | 204 |
559 | 205 fcn-cmp : {A : HOD} (s : Ordinal) { x y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) |
554 | 206 → (cx : FClosure A f s x) → (cy : FClosure A f s y ) → Tri (* x < * y) (* x ≡ * y) (* y < * x ) |
800 | 207 fcn-cmp {A} s {x} {y} f mf cx cy with <-cmp ( fcn s mf cx ) (fcn s mf cy ) |
208 ... | tri< a ¬b ¬c = tri< fc11 (λ eq → <-irr (case1 (sym eq)) fc11) (λ lt → <-irr (case2 fc11) lt) where | |
209 fc11 : * x < * y | |
210 fc11 = fcn-< {A} s {x} {y} {f} mf cx cy a | |
211 ... | tri≈ ¬a b ¬c = tri≈ (λ lt → <-irr (case1 (sym fc10)) lt) fc10 (λ lt → <-irr (case1 fc10) lt) where | |
212 fc10 : * x ≡ * y | |
213 fc10 = fcn-inject {A} s {x} {y} {f} mf cx cy b | |
214 ... | tri> ¬a ¬b c = tri> (λ lt → <-irr (case2 fc12) lt) (λ eq → <-irr (case1 eq) fc12) fc12 where | |
215 fc12 : * y < * x | |
216 fc12 = fcn-< {A} s {y} {x} {f} mf cy cx c | |
600 | 217 |
563 | 218 |
729 | 219 |
560 | 220 -- open import Relation.Binary.Properties.Poset as Poset |
221 | |
222 IsTotalOrderSet : ( A : HOD ) → Set (Level.suc n) | |
223 IsTotalOrderSet A = {a b : HOD} → odef A (& a) → odef A (& b) → Tri (a < b) (a ≡ b) (b < a ) | |
224 | |
567 | 225 ⊆-IsTotalOrderSet : { A B : HOD } → B ⊆ A → IsTotalOrderSet A → IsTotalOrderSet B |
568 | 226 ⊆-IsTotalOrderSet {A} {B} B⊆A T ax ay = T (incl B⊆A ax) (incl B⊆A ay) |
567 | 227 |
568 | 228 _⊆'_ : ( A B : HOD ) → Set n |
229 _⊆'_ A B = {x : Ordinal } → odef A x → odef B x | |
560 | 230 |
231 -- | |
232 -- inductive maxmum tree from x | |
233 -- tree structure | |
234 -- | |
554 | 235 |
836 | 236 record HasPrev (A B : HOD) (x : Ordinal ) ( f : Ordinal → Ordinal ) : Set n where |
533 | 237 field |
836 | 238 ax : odef A x |
534 | 239 y : Ordinal |
541 | 240 ay : odef B y |
534 | 241 x=fy : x ≡ f y |
529 | 242 |
570 | 243 record IsSup (A B : HOD) {x : Ordinal } (xa : odef A x) : Set n where |
654 | 244 field |
950 | 245 x≤sup : {y : Ordinal} → odef B y → (y ≡ x ) ∨ (y << x ) |
954 | 246 minsup : { sup1 : Ordinal } → odef A sup1 |
247 → ( {z : Ordinal } → odef B z → (z ≡ sup1 ) ∨ (z << sup1 )) → x o≤ sup1 | |
568 | 248 |
656 | 249 record SUP ( A B : HOD ) : Set (Level.suc n) where |
250 field | |
251 sup : HOD | |
804 | 252 as : A ∋ sup |
950 | 253 x≤sup : {x : HOD} → B ∋ x → (x ≡ sup ) ∨ (x < sup ) -- B is Total, use positive |
656 | 254 |
690 | 255 -- |
256 -- sup and its fclosure is in a chain HOD | |
257 -- chain HOD is sorted by sup as Ordinal and <-ordered | |
258 -- whole chain is a union of separated Chain | |
803 | 259 -- minimum index is sup of y not ϕ |
690 | 260 -- |
261 | |
787 | 262 record ChainP (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal) (u : Ordinal) : Set n where |
690 | 263 field |
765 | 264 fcy<sup : {z : Ordinal } → FClosure A f y z → (z ≡ supf u) ∨ ( z << supf u ) |
828 | 265 order : {s z1 : Ordinal} → (lt : supf s o< supf u ) → FClosure A f (supf s ) z1 → (z1 ≡ supf u ) ∨ ( z1 << supf u ) |
266 supu=u : supf u ≡ u | |
694 | 267 |
748 | 268 data UChain ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } (ay : odef A y ) |
269 (supf : Ordinal → Ordinal) (x : Ordinal) : (z : Ordinal) → Set n where | |
270 ch-init : {z : Ordinal } (fc : FClosure A f y z) → UChain A f mf ay supf x z | |
919 | 271 ch-is-sup : (u : Ordinal) {z : Ordinal } (u<x : supf u o< supf x) ( is-sup : ChainP A f mf ay supf u ) |
748 | 272 ( fc : FClosure A f (supf u) z ) → UChain A f mf ay supf x z |
694 | 273 |
878 | 274 -- |
275 -- f (f ( ... (sup y))) f (f ( ... (sup z1))) | |
276 -- / | / | | |
277 -- / | / | | |
278 -- sup y < sup z1 < sup z2 | |
279 -- o< o< | |
861 | 280 -- data UChain is total |
281 | |
282 chain-total : (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal ) | |
283 {s s1 a b : Ordinal } ( ca : UChain A f mf ay supf s a ) ( cb : UChain A f mf ay supf s1 b ) → Tri (* a < * b) (* a ≡ * b) (* b < * a ) | |
284 chain-total A f mf {y} ay supf {xa} {xb} {a} {b} ca cb = ct-ind xa xb ca cb where | |
285 ct-ind : (xa xb : Ordinal) → {a b : Ordinal} → UChain A f mf ay supf xa a → UChain A f mf ay supf xb b → Tri (* a < * b) (* a ≡ * b) (* b < * a) | |
286 ct-ind xa xb {a} {b} (ch-init fca) (ch-init fcb) = fcn-cmp y f mf fca fcb | |
938 | 287 ct-ind xa xb {a} {b} (ch-init fca) (ch-is-sup ub u<x supb fcb) with ChainP.fcy<sup supb fca |
861 | 288 ... | case1 eq with s≤fc (supf ub) f mf fcb |
289 ... | case1 eq1 = tri≈ (λ lt → ⊥-elim (<-irr (case1 (sym ct00)) lt)) ct00 (λ lt → ⊥-elim (<-irr (case1 ct00) lt)) where | |
290 ct00 : * a ≡ * b | |
291 ct00 = trans (cong (*) eq) eq1 | |
292 ... | case2 lt = tri< ct01 (λ eq → <-irr (case1 (sym eq)) ct01) (λ lt → <-irr (case2 ct01) lt) where | |
293 ct01 : * a < * b | |
294 ct01 = subst (λ k → * k < * b ) (sym eq) lt | |
938 | 295 ct-ind xa xb {a} {b} (ch-init fca) (ch-is-sup ub u<x supb fcb) | case2 lt = tri< ct01 (λ eq → <-irr (case1 (sym eq)) ct01) (λ lt → <-irr (case2 ct01) lt) where |
861 | 296 ct00 : * a < * (supf ub) |
297 ct00 = lt | |
298 ct01 : * a < * b | |
299 ct01 with s≤fc (supf ub) f mf fcb | |
300 ... | case1 eq = subst (λ k → * a < k ) eq ct00 | |
301 ... | case2 lt = IsStrictPartialOrder.trans POO ct00 lt | |
938 | 302 ct-ind xa xb {a} {b} (ch-is-sup ua u<x supa fca) (ch-init fcb) with ChainP.fcy<sup supa fcb |
861 | 303 ... | case1 eq with s≤fc (supf ua) f mf fca |
304 ... | case1 eq1 = tri≈ (λ lt → ⊥-elim (<-irr (case1 (sym ct00)) lt)) ct00 (λ lt → ⊥-elim (<-irr (case1 ct00) lt)) where | |
305 ct00 : * a ≡ * b | |
306 ct00 = sym (trans (cong (*) eq) eq1 ) | |
307 ... | case2 lt = tri> (λ lt → <-irr (case2 ct01) lt) (λ eq → <-irr (case1 eq) ct01) ct01 where | |
308 ct01 : * b < * a | |
309 ct01 = subst (λ k → * k < * a ) (sym eq) lt | |
938 | 310 ct-ind xa xb {a} {b} (ch-is-sup ua u<x supa fca) (ch-init fcb) | case2 lt = tri> (λ lt → <-irr (case2 ct01) lt) (λ eq → <-irr (case1 eq) ct01) ct01 where |
861 | 311 ct00 : * b < * (supf ua) |
312 ct00 = lt | |
313 ct01 : * b < * a | |
314 ct01 with s≤fc (supf ua) f mf fca | |
315 ... | case1 eq = subst (λ k → * b < k ) eq ct00 | |
316 ... | case2 lt = IsStrictPartialOrder.trans POO ct00 lt | |
317 ct-ind xa xb {a} {b} (ch-is-sup ua ua<x supa fca) (ch-is-sup ub ub<x supb fcb) with trio< ua ub | |
318 ... | tri< a₁ ¬b ¬c with ChainP.order supb (subst₂ (λ j k → j o< k ) (sym (ChainP.supu=u supa )) (sym (ChainP.supu=u supb )) a₁) fca | |
319 ... | case1 eq with s≤fc (supf ub) f mf fcb | |
320 ... | case1 eq1 = tri≈ (λ lt → ⊥-elim (<-irr (case1 (sym ct00)) lt)) ct00 (λ lt → ⊥-elim (<-irr (case1 ct00) lt)) where | |
321 ct00 : * a ≡ * b | |
322 ct00 = trans (cong (*) eq) eq1 | |
323 ... | case2 lt = tri< ct02 (λ eq → <-irr (case1 (sym eq)) ct02) (λ lt → <-irr (case2 ct02) lt) where | |
324 ct02 : * a < * b | |
325 ct02 = subst (λ k → * k < * b ) (sym eq) lt | |
326 ct-ind xa xb {a} {b} (ch-is-sup ua ua<x supa fca) (ch-is-sup ub ub<x supb fcb) | tri< a₁ ¬b ¬c | case2 lt = tri< ct02 (λ eq → <-irr (case1 (sym eq)) ct02) (λ lt → <-irr (case2 ct02) lt) where | |
327 ct03 : * a < * (supf ub) | |
328 ct03 = lt | |
329 ct02 : * a < * b | |
330 ct02 with s≤fc (supf ub) f mf fcb | |
331 ... | case1 eq = subst (λ k → * a < k ) eq ct03 | |
332 ... | case2 lt = IsStrictPartialOrder.trans POO ct03 lt | |
333 ct-ind xa xb {a} {b} (ch-is-sup ua ua<x supa fca) (ch-is-sup ub ub<x supb fcb) | tri≈ ¬a eq ¬c | |
334 = fcn-cmp (supf ua) f mf fca (subst (λ k → FClosure A f k b ) (cong supf (sym eq)) fcb ) | |
335 ct-ind xa xb {a} {b} (ch-is-sup ua ua<x supa fca) (ch-is-sup ub ub<x supb fcb) | tri> ¬a ¬b c with ChainP.order supa (subst₂ (λ j k → j o< k ) (sym (ChainP.supu=u supb )) (sym (ChainP.supu=u supa )) c) fcb | |
336 ... | case1 eq with s≤fc (supf ua) f mf fca | |
337 ... | case1 eq1 = tri≈ (λ lt → ⊥-elim (<-irr (case1 (sym ct00)) lt)) ct00 (λ lt → ⊥-elim (<-irr (case1 ct00) lt)) where | |
338 ct00 : * a ≡ * b | |
339 ct00 = sym (trans (cong (*) eq) eq1) | |
340 ... | case2 lt = tri> (λ lt → <-irr (case2 ct02) lt) (λ eq → <-irr (case1 eq) ct02) ct02 where | |
341 ct02 : * b < * a | |
342 ct02 = subst (λ k → * k < * a ) (sym eq) lt | |
343 ct-ind xa xb {a} {b} (ch-is-sup ua ua<x supa fca) (ch-is-sup ub ub<x supb fcb) | tri> ¬a ¬b c | case2 lt = tri> (λ lt → <-irr (case2 ct04) lt) (λ eq → <-irr (case1 (eq)) ct04) ct04 where | |
344 ct05 : * b < * (supf ua) | |
345 ct05 = lt | |
346 ct04 : * b < * a | |
347 ct04 with s≤fc (supf ua) f mf fca | |
348 ... | case1 eq = subst (λ k → * b < k ) eq ct05 | |
349 ... | case2 lt = IsStrictPartialOrder.trans POO ct05 lt | |
350 | |
694 | 351 ∈∧P→o< : {A : HOD } {y : Ordinal} → {P : Set n} → odef A y ∧ P → y o< & A |
352 ∈∧P→o< {A } {y} p = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) (proj1 p ))) | |
353 | |
803 | 354 -- Union of supf z which o< x |
355 -- | |
694 | 356 UnionCF : ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } (ay : odef A y ) |
357 ( supf : Ordinal → Ordinal ) ( x : Ordinal ) → HOD | |
358 UnionCF A f mf ay supf x | |
894 | 359 = record { od = record { def = λ z → odef A z ∧ UChain A f mf ay supf x z } ; odmax = & A ; <odmax = λ {y} sy → ∈∧P→o< sy } |
662 | 360 |
842 | 361 supf-inject0 : {x y : Ordinal } {supf : Ordinal → Ordinal } → (supf-mono : {x y : Ordinal } → x o≤ y → supf x o≤ supf y ) |
362 → supf x o< supf y → x o< y | |
363 supf-inject0 {x} {y} {supf} supf-mono sx<sy with trio< x y | |
364 ... | tri< a ¬b ¬c = a | |
365 ... | tri≈ ¬a refl ¬c = ⊥-elim ( o<¬≡ (cong supf refl) sx<sy ) | |
366 ... | tri> ¬a ¬b y<x with osuc-≡< (supf-mono (o<→≤ y<x) ) | |
367 ... | case1 eq = ⊥-elim ( o<¬≡ (sym eq) sx<sy ) | |
368 ... | case2 lt = ⊥-elim ( o<> sx<sy lt ) | |
369 | |
879 | 370 record MinSUP ( A B : HOD ) : Set n where |
371 field | |
372 sup : Ordinal | |
373 asm : odef A sup | |
950 | 374 x≤sup : {x : Ordinal } → odef B x → (x ≡ sup ) ∨ (x << sup ) |
879 | 375 minsup : { sup1 : Ordinal } → odef A sup1 |
376 → ( {x : Ordinal } → odef B x → (x ≡ sup1 ) ∨ (x << sup1 )) → sup o≤ sup1 | |
377 | |
378 z09 : {b : Ordinal } { A : HOD } → odef A b → b o< & A | |
379 z09 {b} {A} ab = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) ab)) | |
380 | |
880 | 381 M→S : { A : HOD } { f : Ordinal → Ordinal } {mf : ≤-monotonic-f A f} {y : Ordinal} {ay : odef A y} { x : Ordinal } |
382 → (supf : Ordinal → Ordinal ) | |
383 → MinSUP A (UnionCF A f mf ay supf x) | |
384 → SUP A (UnionCF A f mf ay supf x) | |
385 M→S {A} {f} {mf} {y} {ay} {x} supf ms = record { sup = * (MinSUP.sup ms) | |
950 | 386 ; as = subst (λ k → odef A k) (sym &iso) (MinSUP.asm ms) ; x≤sup = ms00 } where |
880 | 387 msup = MinSUP.sup ms |
388 ms00 : {z : HOD} → UnionCF A f mf ay supf x ∋ z → (z ≡ * msup) ∨ (z < * msup) | |
950 | 389 ms00 {z} uz with MinSUP.x≤sup ms uz |
880 | 390 ... | case1 eq = case1 (subst (λ k → k ≡ _) *iso ( cong (*) eq)) |
391 ... | case2 lt = case2 (subst₂ (λ j k → j < k ) *iso refl lt ) | |
392 | |
867 | 393 |
908
d917831fb607
supf (supf x) ≡ supf x is bad
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
907
diff
changeset
|
394 chain-mono : {A : HOD} ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal ) |
919 | 395 (supf-mono : {x y : Ordinal } → x o≤ y → supf x o≤ supf y ) {a b c : Ordinal} → a o≤ b |
908
d917831fb607
supf (supf x) ≡ supf x is bad
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
907
diff
changeset
|
396 → odef (UnionCF A f mf ay supf a) c → odef (UnionCF A f mf ay supf b) c |
919 | 397 chain-mono f mf ay supf supf-mono {a} {b} {c} a≤b ⟪ ua , ch-init fc ⟫ = |
908
d917831fb607
supf (supf x) ≡ supf x is bad
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
907
diff
changeset
|
398 ⟪ ua , ch-init fc ⟫ |
919 | 399 chain-mono f mf ay supf supf-mono {a} {b} {c} a≤b ⟪ uaa , ch-is-sup ua ua<x is-sup fc ⟫ = |
400 ⟪ uaa , ch-is-sup ua (ordtrans<-≤ ua<x (supf-mono a≤b ) ) is-sup fc ⟫ | |
908
d917831fb607
supf (supf x) ≡ supf x is bad
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
907
diff
changeset
|
401 |
703 | 402 record ZChain ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) |
783 | 403 {y : Ordinal} (ay : odef A y) ( z : Ordinal ) : Set (Level.suc n) where |
655 | 404 field |
694 | 405 supf : Ordinal → Ordinal |
880 | 406 sup=u : {b : Ordinal} → (ab : odef A b) → b o≤ z |
407 → IsSup A (UnionCF A f mf ay supf b) ab ∧ (¬ HasPrev A (UnionCF A f mf ay supf b) b f) → supf b ≡ b | |
408 | |
868 | 409 asupf : {x : Ordinal } → odef A (supf x) |
880 | 410 supf-mono : {x y : Ordinal } → x o≤ y → supf x o≤ supf y |
411 supf-< : {x y : Ordinal } → supf x o< supf y → supf x << supf y | |
891 | 412 supfmax : {x : Ordinal } → z o< x → supf x ≡ supf z |
880 | 413 |
414 minsup : {x : Ordinal } → x o≤ z → MinSUP A (UnionCF A f mf ay supf x) | |
891 | 415 supf-is-minsup : {x : Ordinal } → (x≤z : x o≤ z) → supf x ≡ MinSUP.sup ( minsup x≤z ) |
880 | 416 csupf : {b : Ordinal } → supf b o< z → odef (UnionCF A f mf ay supf z) (supf b) -- supf z is not an element of this chain |
417 | |
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
418 chain : HOD |
703 | 419 chain = UnionCF A f mf ay supf z |
861 | 420 chain⊆A : chain ⊆' A |
421 chain⊆A = λ lt → proj1 lt | |
934 | 422 |
879 | 423 sup : {x : Ordinal } → x o≤ z → SUP A (UnionCF A f mf ay supf x) |
880 | 424 sup {x} x≤z = M→S supf (minsup x≤z) |
934 | 425 |
426 s=ms : {x : Ordinal } → (x≤z : x o≤ z ) → & (SUP.sup (sup x≤z)) ≡ MinSUP.sup (minsup x≤z) | |
427 s=ms {x} x≤z = &iso | |
878 | 428 |
861 | 429 chain∋init : odef chain y |
430 chain∋init = ⟪ ay , ch-init (init ay refl) ⟫ | |
908
d917831fb607
supf (supf x) ≡ supf x is bad
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
907
diff
changeset
|
431 f-next : {a z : Ordinal} → odef (UnionCF A f mf ay supf z) a → odef (UnionCF A f mf ay supf z) (f a) |
861 | 432 f-next {a} ⟪ aa , ch-init fc ⟫ = ⟪ proj2 (mf a aa) , ch-init (fsuc _ fc) ⟫ |
938 | 433 f-next {a} ⟪ aa , ch-is-sup u u<x is-sup fc ⟫ = ⟪ proj2 (mf a aa) , ch-is-sup u u<x is-sup (fsuc _ fc ) ⟫ |
861 | 434 initial : {z : Ordinal } → odef chain z → * y ≤ * z |
435 initial {a} ⟪ aa , ua ⟫ with ua | |
436 ... | ch-init fc = s≤fc y f mf fc | |
938 | 437 ... | ch-is-sup u u<x is-sup fc = ≤-ftrans (<=to≤ zc7) (s≤fc _ f mf fc) where |
861 | 438 zc7 : y <= supf u |
439 zc7 = ChainP.fcy<sup is-sup (init ay refl) | |
440 f-total : IsTotalOrderSet chain | |
441 f-total {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where | |
442 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
443 uz01 = chain-total A f mf ay supf ( (proj2 ca)) ( (proj2 cb)) | |
444 | |
871 | 445 supf-<= : {x y : Ordinal } → supf x <= supf y → supf x o≤ supf y |
446 supf-<= {x} {y} (case1 sx=sy) = o≤-refl0 sx=sy | |
447 supf-<= {x} {y} (case2 sx<sy) with trio< (supf x) (supf y) | |
448 ... | tri< a ¬b ¬c = o<→≤ a | |
449 ... | tri≈ ¬a b ¬c = o≤-refl0 b | |
450 ... | tri> ¬a ¬b c = ⊥-elim (<-irr (case2 sx<sy ) (supf-< c) ) | |
451 | |
825 | 452 supf-inject : {x y : Ordinal } → supf x o< supf y → x o< y |
453 supf-inject {x} {y} sx<sy with trio< x y | |
454 ... | tri< a ¬b ¬c = a | |
455 ... | tri≈ ¬a refl ¬c = ⊥-elim ( o<¬≡ (cong supf refl) sx<sy ) | |
456 ... | tri> ¬a ¬b y<x with osuc-≡< (supf-mono (o<→≤ y<x) ) | |
457 ... | case1 eq = ⊥-elim ( o<¬≡ (sym eq) sx<sy ) | |
458 ... | case2 lt = ⊥-elim ( o<> sx<sy lt ) | |
798 | 459 |
872 | 460 fcy<sup : {u w : Ordinal } → u o≤ z → FClosure A f y w → (w ≡ supf u ) ∨ ( w << supf u ) -- different from order because y o< supf |
950 | 461 fcy<sup {u} {w} u≤z fc with MinSUP.x≤sup (minsup u≤z) ⟪ subst (λ k → odef A k ) (sym &iso) (A∋fc {A} y f mf fc) |
798 | 462 , ch-init (subst (λ k → FClosure A f y k) (sym &iso) fc ) ⟫ |
892 | 463 ... | case1 eq = case1 (subst (λ k → k ≡ supf u ) &iso (trans eq (sym (supf-is-minsup u≤z ) ) )) |
464 ... | case2 lt = case2 (subst₂ (λ j k → j << k ) &iso (sym (supf-is-minsup u≤z )) lt ) | |
825 | 465 |
871 | 466 -- ordering is not proved here but in ZChain1 |
756 | 467 |
728 | 468 record ZChain1 ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) |
783 | 469 {y : Ordinal} (ay : odef A y) (zc : ZChain A f mf ay (& A)) ( z : Ordinal ) : Set (Level.suc n) where |
869 | 470 supf = ZChain.supf zc |
728 | 471 field |
919 | 472 is-max : {a b : Ordinal } → (ca : odef (UnionCF A f mf ay supf z) a ) → supf b o< supf z → (ab : odef A b) |
869 | 473 → HasPrev A (UnionCF A f mf ay supf z) b f ∨ IsSup A (UnionCF A f mf ay supf z) ab |
474 → * a < * b → odef ((UnionCF A f mf ay supf z)) b | |
949 | 475 order : {b s z1 : Ordinal} → b o< & A → supf s o< supf b → FClosure A f (supf s) z1 → (z1 ≡ supf b) ∨ (z1 << supf b) |
476 | |
728 | 477 |
568 | 478 record Maximal ( A : HOD ) : Set (Level.suc n) where |
479 field | |
480 maximal : HOD | |
804 | 481 as : A ∋ maximal |
568 | 482 ¬maximal<x : {x : HOD} → A ∋ x → ¬ maximal < x -- A is Partial, use negative |
567 | 483 |
743 | 484 init-uchain : (A : HOD) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } → (ay : odef A y ) |
485 { supf : Ordinal → Ordinal } { x : Ordinal } → odef (UnionCF A f mf ay supf x) y | |
783 | 486 init-uchain A f mf ay = ⟪ ay , ch-init (init ay refl) ⟫ |
743 | 487 |
497 | 488 Zorn-lemma : { A : HOD } |
464 | 489 → o∅ o< & A |
568 | 490 → ( ( B : HOD) → (B⊆A : B ⊆' A) → IsTotalOrderSet B → SUP A B ) -- SUP condition |
497 | 491 → Maximal A |
552 | 492 Zorn-lemma {A} 0<A supP = zorn00 where |
571 | 493 <-irr0 : {a b : HOD} → A ∋ a → A ∋ b → (a ≡ b ) ∨ (a < b ) → b < a → ⊥ |
494 <-irr0 {a} {b} A∋a A∋b = <-irr | |
788 | 495 z07 : {y : Ordinal} {A : HOD } → {P : Set n} → odef A y ∧ P → y o< & A |
496 z07 {y} {A} p = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) (proj1 p ))) | |
530 | 497 s : HOD |
498 s = ODC.minimal O A (λ eq → ¬x<0 ( subst (λ k → o∅ o< k ) (=od∅→≡o∅ eq) 0<A )) | |
568 | 499 as : A ∋ * ( & s ) |
500 as = subst (λ k → odef A (& k) ) (sym *iso) ( ODC.x∋minimal O A (λ eq → ¬x<0 ( subst (λ k → o∅ o< k ) (=od∅→≡o∅ eq) 0<A )) ) | |
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
501 as0 : odef A (& s ) |
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
502 as0 = subst (λ k → odef A k ) &iso as |
547 | 503 s<A : & s o< & A |
568 | 504 s<A = c<→o< (subst (λ k → odef A (& k) ) *iso as ) |
530 | 505 HasMaximal : HOD |
537 | 506 HasMaximal = record { od = record { def = λ x → odef A x ∧ ( (m : Ordinal) → odef A m → ¬ (* x < * m)) } ; odmax = & A ; <odmax = z07 } |
507 no-maximum : HasMaximal =h= od∅ → (x : Ordinal) → odef A x ∧ ((m : Ordinal) → odef A m → odef A x ∧ (¬ (* x < * m) )) → ⊥ | |
508 no-maximum nomx x P = ¬x<0 (eq→ nomx {x} ⟪ proj1 P , (λ m ma p → proj2 ( proj2 P m ma ) p ) ⟫ ) | |
532 | 509 Gtx : { x : HOD} → A ∋ x → HOD |
537 | 510 Gtx {x} ax = record { od = record { def = λ y → odef A y ∧ (x < (* y)) } ; odmax = & A ; <odmax = z07 } |
511 z08 : ¬ Maximal A → HasMaximal =h= od∅ | |
804 | 512 z08 nmx = record { eq→ = λ {x} lt → ⊥-elim ( nmx record {maximal = * x ; as = subst (λ k → odef A k) (sym &iso) (proj1 lt) |
537 | 513 ; ¬maximal<x = λ {y} ay → subst (λ k → ¬ (* x < k)) *iso (proj2 lt (& y) ay) } ) ; eq← = λ {y} lt → ⊥-elim ( ¬x<0 lt )} |
514 x-is-maximal : ¬ Maximal A → {x : Ordinal} → (ax : odef A x) → & (Gtx (subst (λ k → odef A k ) (sym &iso) ax)) ≡ o∅ → (m : Ordinal) → odef A m → odef A x ∧ (¬ (* x < * m)) | |
515 x-is-maximal nmx {x} ax nogt m am = ⟪ subst (λ k → odef A k) &iso (subst (λ k → odef A k ) (sym &iso) ax) , ¬x<m ⟫ where | |
516 ¬x<m : ¬ (* x < * m) | |
517 ¬x<m x<m = ∅< {Gtx (subst (λ k → odef A k ) (sym &iso) ax)} {* m} ⟪ subst (λ k → odef A k) (sym &iso) am , subst (λ k → * x < k ) (cong (*) (sym &iso)) x<m ⟫ (≡o∅→=od∅ nogt) | |
543 | 518 |
879 | 519 minsupP : ( B : HOD) → (B⊆A : B ⊆' A) → IsTotalOrderSet B → MinSUP A B |
520 minsupP B B⊆A total = m02 where | |
521 xsup : (sup : Ordinal ) → Set n | |
522 xsup sup = {w : Ordinal } → odef B w → (w ≡ sup ) ∨ (w << sup ) | |
523 ∀-imply-or : {A : Ordinal → Set n } {B : Set n } | |
524 → ((x : Ordinal ) → A x ∨ B) → ((x : Ordinal ) → A x) ∨ B | |
525 ∀-imply-or {A} {B} ∀AB with ODC.p∨¬p O ((x : Ordinal ) → A x) -- LEM | |
526 ∀-imply-or {A} {B} ∀AB | case1 t = case1 t | |
527 ∀-imply-or {A} {B} ∀AB | case2 x = case2 (lemma (λ not → x not )) where | |
528 lemma : ¬ ((x : Ordinal ) → A x) → B | |
529 lemma not with ODC.p∨¬p O B | |
530 lemma not | case1 b = b | |
531 lemma not | case2 ¬b = ⊥-elim (not (λ x → dont-orb (∀AB x) ¬b )) | |
532 m00 : (x : Ordinal ) → ( ( z : Ordinal) → z o< x → ¬ (odef A z ∧ xsup z) ) ∨ MinSUP A B | |
533 m00 x = TransFinite0 ind x where | |
534 ind : (x : Ordinal) → ((z : Ordinal) → z o< x → ( ( w : Ordinal) → w o< z → ¬ (odef A w ∧ xsup w )) ∨ MinSUP A B) | |
535 → ( ( w : Ordinal) → w o< x → ¬ (odef A w ∧ xsup w) ) ∨ MinSUP A B | |
536 ind x prev = ∀-imply-or m01 where | |
537 m01 : (z : Ordinal) → (z o< x → ¬ (odef A z ∧ xsup z)) ∨ MinSUP A B | |
538 m01 z with trio< z x | |
539 ... | tri≈ ¬a b ¬c = case1 ( λ lt → ⊥-elim ( ¬a lt ) ) | |
540 ... | tri> ¬a ¬b c = case1 ( λ lt → ⊥-elim ( ¬a lt ) ) | |
541 ... | tri< a ¬b ¬c with prev z a | |
542 ... | case2 mins = case2 mins | |
543 ... | case1 not with ODC.p∨¬p O (odef A z ∧ xsup z) | |
950 | 544 ... | case1 mins = case2 record { sup = z ; asm = proj1 mins ; x≤sup = proj2 mins ; minsup = m04 } where |
879 | 545 m04 : {sup1 : Ordinal} → odef A sup1 → ({w : Ordinal} → odef B w → (w ≡ sup1) ∨ (w << sup1)) → z o≤ sup1 |
546 m04 {s} as lt with trio< z s | |
547 ... | tri< a ¬b ¬c = o<→≤ a | |
548 ... | tri≈ ¬a b ¬c = o≤-refl0 b | |
549 ... | tri> ¬a ¬b s<z = ⊥-elim ( not s s<z ⟪ as , lt ⟫ ) | |
550 ... | case2 notz = case1 (λ _ → notz ) | |
551 m03 : ¬ ((z : Ordinal) → z o< & A → ¬ odef A z ∧ xsup z) | |
552 m03 not = ⊥-elim ( not s1 (z09 (SUP.as S)) ⟪ SUP.as S , m05 ⟫ ) where | |
553 S : SUP A B | |
554 S = supP B B⊆A total | |
555 s1 = & (SUP.sup S) | |
556 m05 : {w : Ordinal } → odef B w → (w ≡ s1 ) ∨ (w << s1 ) | |
950 | 557 m05 {w} bw with SUP.x≤sup S {* w} (subst (λ k → odef B k) (sym &iso) bw ) |
879 | 558 ... | case1 eq = case1 ( subst₂ (λ j k → j ≡ k ) &iso refl (cong (&) eq) ) |
559 ... | case2 lt = case2 ( subst (λ k → _ < k ) (sym *iso) lt ) | |
560 m02 : MinSUP A B | |
561 m02 = dont-or (m00 (& A)) m03 | |
562 | |
560 | 563 -- Uncountable ascending chain by axiom of choice |
530 | 564 cf : ¬ Maximal A → Ordinal → Ordinal |
532 | 565 cf nmx x with ODC.∋-p O A (* x) |
566 ... | no _ = o∅ | |
567 ... | yes ax with is-o∅ (& ( Gtx ax )) | |
538 | 568 ... | yes nogt = -- no larger element, so it is maximal |
569 ⊥-elim (no-maximum (z08 nmx) x ⟪ subst (λ k → odef A k) &iso ax , x-is-maximal nmx (subst (λ k → odef A k ) &iso ax) nogt ⟫ ) | |
532 | 570 ... | no not = & (ODC.minimal O (Gtx ax) (λ eq → not (=od∅→≡o∅ eq))) |
537 | 571 is-cf : (nmx : ¬ Maximal A ) → {x : Ordinal} → odef A x → odef A (cf nmx x) ∧ ( * x < * (cf nmx x) ) |
572 is-cf nmx {x} ax with ODC.∋-p O A (* x) | |
573 ... | no not = ⊥-elim ( not (subst (λ k → odef A k ) (sym &iso) ax )) | |
574 ... | yes ax with is-o∅ (& ( Gtx ax )) | |
575 ... | yes nogt = ⊥-elim (no-maximum (z08 nmx) x ⟪ subst (λ k → odef A k) &iso ax , x-is-maximal nmx (subst (λ k → odef A k ) &iso ax) nogt ⟫ ) | |
576 ... | no not = ODC.x∋minimal O (Gtx ax) (λ eq → not (=od∅→≡o∅ eq)) | |
606 | 577 |
578 --- | |
579 --- infintie ascention sequence of f | |
580 --- | |
530 | 581 cf-is-<-monotonic : (nmx : ¬ Maximal A ) → (x : Ordinal) → odef A x → ( * x < * (cf nmx x) ) ∧ odef A (cf nmx x ) |
537 | 582 cf-is-<-monotonic nmx x ax = ⟪ proj2 (is-cf nmx ax ) , proj1 (is-cf nmx ax ) ⟫ |
530 | 583 cf-is-≤-monotonic : (nmx : ¬ Maximal A ) → ≤-monotonic-f A ( cf nmx ) |
532 | 584 cf-is-≤-monotonic nmx x ax = ⟪ case2 (proj1 ( cf-is-<-monotonic nmx x ax )) , proj2 ( cf-is-<-monotonic nmx x ax ) ⟫ |
543 | 585 |
803 | 586 -- |
953 | 587 -- maximality of chain |
588 -- | |
589 -- supf is fixed for z ≡ & A , we can prove order and is-max | |
803 | 590 -- |
591 | |
793 | 592 SZ1 : ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) |
728 | 593 {init : Ordinal} (ay : odef A init) (zc : ZChain A f mf ay (& A)) (x : Ordinal) → ZChain1 A f mf ay zc x |
953 | 594 SZ1 f mf {y} ay zc x = zc1 x where |
900 | 595 chain-mono1 : {a b c : Ordinal} → a o≤ b |
788 | 596 → odef (UnionCF A f mf ay (ZChain.supf zc) a) c → odef (UnionCF A f mf ay (ZChain.supf zc) b) c |
919 | 597 chain-mono1 {a} {b} {c} a≤b = chain-mono f mf ay (ZChain.supf zc) (ZChain.supf-mono zc) a≤b |
920 | 598 is-max-hp : (x : Ordinal) {a : Ordinal} {b : Ordinal} → odef (UnionCF A f mf ay (ZChain.supf zc) x) a → (ab : odef A b) |
599 → HasPrev A (UnionCF A f mf ay (ZChain.supf zc) x) b f | |
600 → * a < * b → odef (UnionCF A f mf ay (ZChain.supf zc) x) b | |
601 is-max-hp x {a} {b} ua ab has-prev a<b with HasPrev.ay has-prev | |
749 | 602 ... | ⟪ ab0 , ch-init fc ⟫ = ⟪ ab , ch-init ( subst (λ k → FClosure A f y k) (sym (HasPrev.x=fy has-prev)) (fsuc _ fc )) ⟫ |
938 | 603 ... | ⟪ ab0 , ch-is-sup u u<x is-sup fc ⟫ = ⟪ ab , subst (λ k → UChain A f mf ay (ZChain.supf zc) x k ) |
604 (sym (HasPrev.x=fy has-prev)) ( ch-is-sup u u<x is-sup (fsuc _ fc)) ⟫ | |
868 | 605 |
869 | 606 supf = ZChain.supf zc |
607 | |
920 | 608 csupf-fc : {b s z1 : Ordinal} → b o< & A → supf s o< supf b → FClosure A f (supf s) z1 → UnionCF A f mf ay supf b ∋ * z1 |
609 csupf-fc {b} {s} {z1} b<z ss<sb (init x refl ) = subst (λ k → odef (UnionCF A f mf ay supf b) k ) (sym &iso) zc05 where | |
869 | 610 s<b : s o< b |
611 s<b = ZChain.supf-inject zc ss<sb | |
920 | 612 s<z : s o< & A |
613 s<z = ordtrans s<b b<z | |
870 | 614 zc04 : odef (UnionCF A f mf ay supf (& A)) (supf s) |
874 | 615 zc04 = ZChain.csupf zc (z09 (ZChain.asupf zc)) |
869 | 616 zc05 : odef (UnionCF A f mf ay supf b) (supf s) |
617 zc05 with zc04 | |
618 ... | ⟪ as , ch-init fc ⟫ = ⟪ as , ch-init fc ⟫ | |
938 | 619 ... | ⟪ as , ch-is-sup u u<x is-sup fc ⟫ = ⟪ as , ch-is-sup u zc08 is-sup fc ⟫ where |
870 | 620 zc07 : FClosure A f (supf u) (supf s) -- supf u ≤ supf s → supf u o≤ supf s |
621 zc07 = fc | |
869 | 622 zc06 : supf u ≡ u |
623 zc06 = ChainP.supu=u is-sup | |
894 | 624 zc08 : supf u o< supf b |
625 zc08 = ordtrans≤-< (ZChain.supf-<= zc (≤to<= ( s≤fc _ f mf fc ))) ss<sb | |
869 | 626 csupf-fc {b} {s} {z1} b<z ss≤sb (fsuc x fc) = subst (λ k → odef (UnionCF A f mf ay supf b) k ) (sym &iso) zc04 where |
627 zc04 : odef (UnionCF A f mf ay supf b) (f x) | |
628 zc04 with subst (λ k → odef (UnionCF A f mf ay supf b) k ) &iso (csupf-fc b<z ss≤sb fc ) | |
629 ... | ⟪ as , ch-init fc ⟫ = ⟪ proj2 (mf _ as) , ch-init (fsuc _ fc) ⟫ | |
938 | 630 ... | ⟪ as , ch-is-sup u u<x is-sup fc ⟫ = ⟪ proj2 (mf _ as) , ch-is-sup u u<x is-sup (fsuc _ fc) ⟫ |
869 | 631 order : {b s z1 : Ordinal} → b o< & A → supf s o< supf b → FClosure A f (supf s) z1 → (z1 ≡ supf b) ∨ (z1 << supf b) |
632 order {b} {s} {z1} b<z ss<sb fc = zc04 where | |
891 | 633 zc00 : ( z1 ≡ MinSUP.sup (ZChain.minsup zc (o<→≤ b<z) )) ∨ ( z1 << MinSUP.sup ( ZChain.minsup zc (o<→≤ b<z) ) ) |
950 | 634 zc00 = MinSUP.x≤sup (ZChain.minsup zc (o<→≤ b<z) ) (subst (λ k → odef (UnionCF A f mf ay (ZChain.supf zc) b) k ) &iso (csupf-fc b<z ss<sb fc )) |
870 | 635 -- supf (supf b) ≡ supf b |
869 | 636 zc04 : (z1 ≡ supf b) ∨ (z1 << supf b) |
637 zc04 with zc00 | |
892 | 638 ... | case1 eq = case1 (subst₂ (λ j k → j ≡ k ) refl (sym (ZChain.supf-is-minsup zc (o<→≤ b<z)) ) eq ) |
639 ... | case2 lt = case2 (subst₂ (λ j k → j < * k ) refl (sym (ZChain.supf-is-minsup zc (o<→≤ b<z) )) lt ) | |
868 | 640 |
953 | 641 zc1 : (x : Ordinal) → ZChain1 A f mf ay zc x |
642 zc1 x with Oprev-p x -- prev is not used now.... | |
949 | 643 ... | yes op = record { is-max = is-max ; order = order } where |
732
ddeb107b6f71
bchain can be reached from upwords by f. so it is worng.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
729
diff
changeset
|
644 px = Oprev.oprev op |
919 | 645 zc-b<x : {b : Ordinal } → ZChain.supf zc b o< ZChain.supf zc x → b o< osuc px |
646 zc-b<x {b} lt = subst (λ k → b o< k ) (sym (Oprev.oprev=x op)) (ZChain.supf-inject zc lt ) | |
894 | 647 is-max : {a : Ordinal} {b : Ordinal} → odef (UnionCF A f mf ay supf x) a → |
919 | 648 ZChain.supf zc b o< ZChain.supf zc x → (ab : odef A b) → |
869 | 649 HasPrev A (UnionCF A f mf ay supf x) b f ∨ IsSup A (UnionCF A f mf ay supf x) ab → |
650 * a < * b → odef (UnionCF A f mf ay supf x) b | |
860
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
651 is-max {a} {b} ua b<x ab P a<b with ODC.or-exclude O P |
920 | 652 is-max {a} {b} ua b<x ab P a<b | case1 has-prev = is-max-hp x {a} {b} ua ab has-prev a<b |
919 | 653 is-max {a} {b} ua sb<sx ab P a<b | case2 is-sup |
654 = ⟪ ab , ch-is-sup b sb<sx m06 (subst (λ k → FClosure A f k b) (sym m05) (init ab refl)) ⟫ where | |
790
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
655 b<A : b o< & A |
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
656 b<A = z09 ab |
919 | 657 b<x : b o< x |
658 b<x = ZChain.supf-inject zc sb<sx | |
869 | 659 m04 : ¬ HasPrev A (UnionCF A f mf ay supf b) b f |
894 | 660 m04 nhp = proj1 is-sup ( record { ax = HasPrev.ax nhp ; y = HasPrev.y nhp ; ay = |
900 | 661 chain-mono1 (o<→≤ b<x) (HasPrev.ay nhp) ; x=fy = HasPrev.x=fy nhp } ) |
859 | 662 m05 : ZChain.supf zc b ≡ b |
663 m05 = ZChain.sup=u zc ab (o<→≤ (z09 ab) ) | |
954 | 664 ⟪ record { x≤sup = λ {z} uz → IsSup.x≤sup (proj2 is-sup) (chain-mono1 (o<→≤ b<x) uz) |
665 ; minsup = m07 } , m04 ⟫ where | |
666 m10 : {s : Ordinal } → (odef A s ) | |
667 → ( {z : Ordinal} → odef (UnionCF A f mf ay (ZChain.supf zc) b) z → (z ≡ s) ∨ (z << s) ) | |
668 → {z : Ordinal} → odef (UnionCF A f mf ay (ZChain.supf zc) x) z → (z ≡ s) ∨ (z << s) | |
669 m10 = ? | |
670 m07 : {sup1 : Ordinal} → odef A sup1 → ({z : Ordinal} → | |
671 odef (UnionCF A f mf ay (ZChain.supf zc) b) z → (z ≡ sup1) ∨ (z << sup1)) → b o≤ sup1 | |
672 m07 {s} as min = IsSup.minsup (proj2 is-sup) as (m10 as min) | |
790
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
673 m08 : {z : Ordinal} → (fcz : FClosure A f y z ) → z <= ZChain.supf zc b |
872 | 674 m08 {z} fcz = ZChain.fcy<sup zc (o<→≤ b<A) fcz |
828 | 675 m09 : {s z1 : Ordinal} → ZChain.supf zc s o< ZChain.supf zc b |
825 | 676 → FClosure A f (ZChain.supf zc s) z1 → z1 <= ZChain.supf zc b |
869 | 677 m09 {s} {z} s<b fcz = order b<A s<b fcz |
678 m06 : ChainP A f mf ay supf b | |
859 | 679 m06 = record { fcy<sup = m08 ; order = m09 ; supu=u = m05 } |
949 | 680 ... | no lim = record { is-max = is-max ; order = order } where |
869 | 681 is-max : {a : Ordinal} {b : Ordinal} → odef (UnionCF A f mf ay supf x) a → |
919 | 682 ZChain.supf zc b o< ZChain.supf zc x → (ab : odef A b) → |
869 | 683 HasPrev A (UnionCF A f mf ay supf x) b f ∨ IsSup A (UnionCF A f mf ay supf x) ab → |
684 * a < * b → odef (UnionCF A f mf ay supf x) b | |
919 | 685 is-max {a} {b} ua sb<sx ab P a<b with ODC.or-exclude O P |
920 | 686 is-max {a} {b} ua sb<sx ab P a<b | case1 has-prev = is-max-hp x {a} {b} ua ab has-prev a<b |
950 | 687 is-max {a} {b} ua sb<sx ab P a<b | case2 is-sup with IsSup.x≤sup (proj2 is-sup) (init-uchain A f mf ay ) |
789 | 688 ... | case1 b=y = ⟪ subst (λ k → odef A k ) b=y ay , ch-init (subst (λ k → FClosure A f y k ) b=y (init ay refl )) ⟫ |
919 | 689 ... | case2 y<b = ⟪ ab , ch-is-sup b sb<sx m06 (subst (λ k → FClosure A f k b) (sym m05) (init ab refl)) ⟫ where |
790
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
690 m09 : b o< & A |
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
691 m09 = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) ab)) |
919 | 692 b<x : b o< x |
693 b<x = ZChain.supf-inject zc sb<sx | |
790
201b66da4e69
remove unnesesary part in SZ1 the second TransFinite induction for is-max
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
789
diff
changeset
|
694 m07 : {z : Ordinal} → FClosure A f y z → z <= ZChain.supf zc b |
872 | 695 m07 {z} fc = ZChain.fcy<sup zc (o<→≤ m09) fc |
828 | 696 m08 : {s z1 : Ordinal} → ZChain.supf zc s o< ZChain.supf zc b |
825 | 697 → FClosure A f (ZChain.supf zc s) z1 → z1 <= ZChain.supf zc b |
869 | 698 m08 {s} {z1} s<b fc = order m09 s<b fc |
699 m04 : ¬ HasPrev A (UnionCF A f mf ay supf b) b f | |
894 | 700 m04 nhp = proj1 is-sup ( record { ax = HasPrev.ax nhp ; y = HasPrev.y nhp ; ay = |
900 | 701 chain-mono1 (o<→≤ b<x) (HasPrev.ay nhp) |
860
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
702 ; x=fy = HasPrev.x=fy nhp } ) |
859 | 703 m05 : ZChain.supf zc b ≡ b |
704 m05 = ZChain.sup=u zc ab (o<→≤ m09) | |
954 | 705 ⟪ record { x≤sup = λ lt → IsSup.x≤sup (proj2 is-sup) (chain-mono1 (o<→≤ b<x) lt ) |
706 ; minsup = ? } , m04 ⟫ -- ZChain on x | |
869 | 707 m06 : ChainP A f mf ay supf b |
859 | 708 m06 = record { fcy<sup = m07 ; order = m08 ; supu=u = m05 } |
727 | 709 |
757 | 710 uchain : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) → HOD |
711 uchain f mf {y} ay = record { od = record { def = λ x → FClosure A f y x } ; odmax = & A ; <odmax = | |
712 λ {z} cz → subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) (A∋fc y f mf cz ))) } | |
713 | |
714 utotal : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) | |
715 → IsTotalOrderSet (uchain f mf ay) | |
716 utotal f mf {y} ay {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where | |
717 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
718 uz01 = fcn-cmp y f mf ca cb | |
719 | |
720 ysup : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) | |
928 | 721 → MinSUP A (uchain f mf ay) |
722 ysup f mf {y} ay = minsupP (uchain f mf ay) (λ lt → A∋fc y f mf lt) (utotal f mf ay) | |
757 | 723 |
793 | 724 SUP⊆ : { B C : HOD } → B ⊆' C → SUP A C → SUP A B |
950 | 725 SUP⊆ {B} {C} B⊆C sup = record { sup = SUP.sup sup ; as = SUP.as sup ; x≤sup = λ lt → SUP.x≤sup sup (B⊆C lt) } |
711 | 726 |
833 | 727 record xSUP (B : HOD) (x : Ordinal) : Set n where |
728 field | |
729 ax : odef A x | |
730 is-sup : IsSup A B ax | |
731 | |
560 | 732 -- |
547 | 733 -- create all ZChains under o< x |
560 | 734 -- |
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
735 |
674 | 736 ind : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) → (x : Ordinal) |
703 | 737 → ((z : Ordinal) → z o< x → ZChain A f mf ay z) → ZChain A f mf ay x |
707 | 738 ind f mf {y} ay x prev with Oprev-p x |
954 | 739 ... | yes op = zc41 where |
682 | 740 -- |
741 -- we have previous ordinal to use induction | |
742 -- | |
743 px = Oprev.oprev op | |
703 | 744 zc : ZChain A f mf ay (Oprev.oprev op) |
682 | 745 zc = prev px (subst (λ k → px o< k) (Oprev.oprev=x op) <-osuc ) |
746 px<x : px o< x | |
747 px<x = subst (λ k → px o< k) (Oprev.oprev=x op) <-osuc | |
918
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
748 opx=x : osuc px ≡ x |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
749 opx=x = Oprev.oprev=x op |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
750 |
709 | 751 zc-b<x : (b : Ordinal ) → b o< x → b o< osuc px |
752 zc-b<x b lt = subst (λ k → b o< k ) (sym (Oprev.oprev=x op)) lt | |
697 | 753 |
754 | 754 supf0 = ZChain.supf zc |
869 | 755 pchain : HOD |
756 pchain = UnionCF A f mf ay supf0 px | |
835 | 757 |
857 | 758 supf-mono : {a b : Ordinal } → a o≤ b → supf0 a o≤ supf0 b |
759 supf-mono = ZChain.supf-mono zc | |
844 | 760 |
861 | 761 zc04 : {b : Ordinal} → b o≤ x → (b o≤ px ) ∨ (b ≡ x ) |
762 zc04 {b} b≤x with trio< b px | |
763 ... | tri< a ¬b ¬c = case1 (o<→≤ a) | |
764 ... | tri≈ ¬a b ¬c = case1 (o≤-refl0 b) | |
765 ... | tri> ¬a ¬b px<b with osuc-≡< b≤x | |
766 ... | case1 eq = case2 eq | |
767 ... | case2 b<x = ⊥-elim ( ¬p<x<op ⟪ px<b , subst (λ k → b o< k ) (sym (Oprev.oprev=x op)) b<x ⟫ ) | |
840 | 768 |
954 | 769 -- |
770 -- find the next value of supf | |
771 -- | |
772 | |
773 pchainpx : HOD | |
774 pchainpx = record { od = record { def = λ z → (odef A z ∧ UChain A f mf ay supf0 px z ) | |
775 ∨ FClosure A f (supf0 px) z } ; odmax = & A ; <odmax = zc00 } where | |
776 zc00 : {z : Ordinal } → (odef A z ∧ UChain A f mf ay supf0 px z ) ∨ FClosure A f (supf0 px) z → z o< & A | |
777 zc00 {z} (case1 lt) = z07 lt | |
778 zc00 {z} (case2 fc) = z09 ( A∋fc (supf0 px) f mf fc ) | |
779 | |
780 zc02 : { a b : Ordinal } → odef A a ∧ UChain A f mf ay supf0 px a → FClosure A f (supf0 px) b → a <= b | |
781 zc02 {a} {b} ca fb = zc05 fb where | |
782 zc06 : MinSUP.sup (ZChain.minsup zc o≤-refl) ≡ supf0 px | |
783 zc06 = trans (sym ( ZChain.supf-is-minsup zc o≤-refl )) refl | |
784 zc05 : {b : Ordinal } → FClosure A f (supf0 px) b → a <= b | |
785 zc05 (fsuc b1 fb ) with proj1 ( mf b1 (A∋fc (supf0 px) f mf fb )) | |
786 ... | case1 eq = subst (λ k → a <= k ) (subst₂ (λ j k → j ≡ k) &iso &iso (cong (&) eq)) (zc05 fb) | |
787 ... | case2 lt = <-ftrans (zc05 fb) (case2 lt) | |
788 zc05 (init b1 refl) with MinSUP.x≤sup (ZChain.minsup zc o≤-refl) | |
789 (subst (λ k → odef A k ∧ UChain A f mf ay supf0 px k) (sym &iso) ca ) | |
790 ... | case1 eq = case1 (subst₂ (λ j k → j ≡ k ) &iso zc06 eq ) | |
791 ... | case2 lt = case2 (subst₂ (λ j k → j < k ) *iso (cong (*) zc06) lt ) | |
792 | |
793 ptotal : IsTotalOrderSet pchainpx | |
794 ptotal (case1 a) (case1 b) = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso | |
795 (chain-total A f mf ay supf0 (proj2 a) (proj2 b)) | |
796 ptotal {a0} {b0} (case1 a) (case2 b) with zc02 a b | |
797 ... | case1 eq = tri≈ (<-irr (case1 (sym eq1))) eq1 (<-irr (case1 eq1)) where | |
798 eq1 : a0 ≡ b0 | |
799 eq1 = subst₂ (λ j k → j ≡ k ) *iso *iso (cong (*) eq ) | |
800 ... | case2 lt = tri< lt1 (λ eq → <-irr (case1 (sym eq)) lt1) (<-irr (case2 lt1)) where | |
801 lt1 : a0 < b0 | |
802 lt1 = subst₂ (λ j k → j < k ) *iso *iso lt | |
803 ptotal {b0} {a0} (case2 b) (case1 a) with zc02 a b | |
804 ... | case1 eq = tri≈ (<-irr (case1 eq1)) (sym eq1) (<-irr (case1 (sym eq1))) where | |
805 eq1 : a0 ≡ b0 | |
806 eq1 = subst₂ (λ j k → j ≡ k ) *iso *iso (cong (*) eq ) | |
807 ... | case2 lt = tri> (<-irr (case2 lt1)) (λ eq → <-irr (case1 eq) lt1) lt1 where | |
808 lt1 : a0 < b0 | |
809 lt1 = subst₂ (λ j k → j < k ) *iso *iso lt | |
810 ptotal (case2 a) (case2 b) = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso (fcn-cmp (supf0 px) f mf a b) | |
811 | |
812 pcha : pchainpx ⊆' A | |
813 pcha (case1 lt) = proj1 lt | |
814 pcha (case2 fc) = A∋fc _ f mf fc | |
815 | |
816 sup1 : MinSUP A pchainpx | |
817 sup1 = minsupP pchainpx pcha ptotal | |
818 sp1 = MinSUP.sup sup1 | |
819 | |
820 -- | |
821 -- supf0 px o≤ sp1 | |
822 -- | |
823 | |
824 zc41 : ZChain A f mf ay x | |
825 zc41 with MinSUP.x≤sup sup1 (case2 (init (ZChain.asupf zc {px}) refl )) | |
826 zc41 | (case2 sfpx<sp1) = record { supf = supf1 ; sup=u = ? ; asupf = ? ; supf-mono = supf1-mono ; supf-< = ? | |
901 | 827 ; supfmax = ? ; minsup = ? ; supf-is-minsup = ? ; csupf = csupf1 } where |
954 | 828 -- supf0 px is included by the chain of sp1 |
901 | 829 -- ( UnionCF A f mf ay supf0 px ∪ FClosure (supf0 px) ) ≡ UnionCF supf1 x |
830 -- supf1 x ≡ sp1, which is not included now | |
883 | 831 |
871 | 832 supf1 : Ordinal → Ordinal |
833 supf1 z with trio< z px | |
834 ... | tri< a ¬b ¬c = supf0 z | |
901 | 835 ... | tri≈ ¬a b ¬c = supf0 z |
836 ... | tri> ¬a ¬b c = sp1 | |
871 | 837 |
886 | 838 sf1=sf0 : {z : Ordinal } → z o≤ px → supf1 z ≡ supf0 z |
901 | 839 sf1=sf0 {z} z≤px with trio< z px |
874 | 840 ... | tri< a ¬b ¬c = refl |
901 | 841 ... | tri≈ ¬a b ¬c = refl |
842 ... | tri> ¬a ¬b c = ⊥-elim ( o≤> z≤px c ) | |
883 | 843 |
901 | 844 sf1=sp1 : {z : Ordinal } → px o< z → supf1 z ≡ sp1 |
845 sf1=sp1 {z} px<z with trio< z px | |
846 ... | tri< a ¬b ¬c = ⊥-elim ( o<> px<z a ) | |
847 ... | tri≈ ¬a b ¬c = ⊥-elim ( o<¬≡ (sym b) px<z ) | |
848 ... | tri> ¬a ¬b c = refl | |
873 | 849 |
903 | 850 asupf1 : {z : Ordinal } → odef A (supf1 z) |
851 asupf1 {z} with trio< z px | |
852 ... | tri< a ¬b ¬c = ZChain.asupf zc | |
853 ... | tri≈ ¬a b ¬c = ZChain.asupf zc | |
854 ... | tri> ¬a ¬b c = MinSUP.asm sup1 | |
855 | |
901 | 856 supf1-mono : {a b : Ordinal } → a o≤ b → supf1 a o≤ supf1 b |
857 supf1-mono {a} {b} a≤b with trio< b px | |
858 ... | tri< a ¬b ¬c = subst₂ (λ j k → j o≤ k ) (sym (sf1=sf0 (o<→≤ (ordtrans≤-< a≤b a)))) refl ( supf-mono a≤b ) | |
859 ... | tri≈ ¬a b ¬c = subst₂ (λ j k → j o≤ k ) (sym (sf1=sf0 (subst (λ k → a o≤ k) b a≤b))) refl ( supf-mono a≤b ) | |
860 supf1-mono {a} {b} a≤b | tri> ¬a ¬b c with trio< a px | |
861 ... | tri< a<px ¬b ¬c = zc19 where | |
862 zc21 : MinSUP A (UnionCF A f mf ay supf0 a) | |
863 zc21 = ZChain.minsup zc (o<→≤ a<px) | |
864 zc24 : {x₁ : Ordinal} → odef (UnionCF A f mf ay supf0 a) x₁ → (x₁ ≡ sp1) ∨ (x₁ << sp1) | |
950 | 865 zc24 {x₁} ux = MinSUP.x≤sup sup1 (case1 (chain-mono f mf ay supf0 (ZChain.supf-mono zc) (o<→≤ a<px) ux ) ) |
901 | 866 zc19 : supf0 a o≤ sp1 |
867 zc19 = subst (λ k → k o≤ sp1) (sym (ZChain.supf-is-minsup zc (o<→≤ a<px))) ( MinSUP.minsup zc21 (MinSUP.asm sup1) zc24 ) | |
868 ... | tri≈ ¬a b ¬c = zc18 where | |
869 zc21 : MinSUP A (UnionCF A f mf ay supf0 a) | |
870 zc21 = ZChain.minsup zc (o≤-refl0 b) | |
871 zc20 : MinSUP.sup zc21 ≡ supf0 a | |
872 zc20 = sym (ZChain.supf-is-minsup zc (o≤-refl0 b)) | |
873 zc24 : {x₁ : Ordinal} → odef (UnionCF A f mf ay supf0 a) x₁ → (x₁ ≡ sp1) ∨ (x₁ << sp1) | |
950 | 874 zc24 {x₁} ux = MinSUP.x≤sup sup1 (case1 (chain-mono f mf ay supf0 (ZChain.supf-mono zc) (o≤-refl0 b) ux ) ) |
901 | 875 zc18 : supf0 a o≤ sp1 |
876 zc18 = subst (λ k → k o≤ sp1) zc20( MinSUP.minsup zc21 (MinSUP.asm sup1) zc24 ) | |
877 ... | tri> ¬a ¬b c = o≤-refl | |
885 | 878 |
903 | 879 |
880 fcup : {u z : Ordinal } → FClosure A f (supf1 u) z → u o≤ px → FClosure A f (supf0 u) z | |
881 fcup {u} {z} fc u≤px = subst (λ k → FClosure A f k z ) (sf1=sf0 u≤px) fc | |
882 fcpu : {u z : Ordinal } → FClosure A f (supf0 u) z → u o≤ px → FClosure A f (supf1 u) z | |
883 fcpu {u} {z} fc u≤px = subst (λ k → FClosure A f k z ) (sym (sf1=sf0 u≤px)) fc | |
884 zc11 : {z : Ordinal} → odef (UnionCF A f mf ay supf1 x) z → odef pchainpx z | |
885 zc11 {z} ⟪ az , ch-init fc ⟫ = case1 ⟪ az , ch-init fc ⟫ | |
919 | 886 zc11 {z} ⟪ az , ch-is-sup u su<sx is-sup fc ⟫ = zc21 fc where |
887 u<x : u o< x | |
953 | 888 u<x = supf-inject0 supf1-mono su<sx |
889 u≤px : u o≤ px | |
890 u≤px = zc-b<x _ u<x | |
903 | 891 zc21 : {z1 : Ordinal } → FClosure A f (supf1 u) z1 → odef pchainpx z1 |
892 zc21 {z1} (fsuc z2 fc ) with zc21 fc | |
893 ... | case1 ⟪ ua1 , ch-init fc₁ ⟫ = case1 ⟪ proj2 ( mf _ ua1) , ch-init (fsuc _ fc₁) ⟫ | |
894 ... | case1 ⟪ ua1 , ch-is-sup u u<x u1-is-sup fc₁ ⟫ = case1 ⟪ proj2 ( mf _ ua1) , ch-is-sup u u<x u1-is-sup (fsuc _ fc₁) ⟫ | |
895 ... | case2 fc = case2 (fsuc _ fc) | |
953 | 896 zc21 (init asp refl ) with trio< (supf0 u) (supf0 px) | inspect supf1 u |
897 ... | tri< a ¬b ¬c | _ = case1 ⟪ asp , ch-is-sup u a record {fcy<sup = zc13 ; order = zc17 | |
898 ; supu=u = trans (sym (sf1=sf0 (o<→≤ u<px))) (ChainP.supu=u is-sup) } (init asp0 (sym (sf1=sf0 (o<→≤ u<px))) ) ⟫ where | |
899 u<px : u o< px | |
900 u<px = ZChain.supf-inject zc a | |
901 asp0 : odef A (supf0 u) | |
902 asp0 = ZChain.asupf zc | |
903 | 903 zc17 : {s : Ordinal} {z1 : Ordinal} → supf0 s o< supf0 u → |
904 FClosure A f (supf0 s) z1 → (z1 ≡ supf0 u) ∨ (z1 << supf0 u) | |
953 | 905 zc17 {s} {z1} ss<spx fc = subst (λ k → (z1 ≡ k) ∨ (z1 << k)) ((sf1=sf0 u≤px)) ( ChainP.order is-sup |
906 (subst₂ (λ j k → j o< k ) (sym (sf1=sf0 zc18)) (sym (sf1=sf0 u≤px)) ss<spx) (fcpu fc zc18) ) where | |
903 | 907 zc18 : s o≤ px |
953 | 908 zc18 = ordtrans (ZChain.supf-inject zc ss<spx) u≤px |
903 | 909 zc13 : {z : Ordinal } → FClosure A f y z → (z ≡ supf0 u) ∨ ( z << supf0 u ) |
953 | 910 zc13 {z} fc = subst (λ k → (z ≡ k) ∨ ( z << k )) (sf1=sf0 (o<→≤ u<px)) ( ChainP.fcy<sup is-sup fc ) |
911 ... | tri≈ ¬a b ¬c | _ = case2 (init (subst (λ k → odef A k) b (ZChain.asupf zc) ) (sym (trans (sf1=sf0 u≤px) b ))) | |
912 ... | tri> ¬a ¬b c | _ = ⊥-elim ( ¬p<x<op ⟪ ZChain.supf-inject zc c , subst (λ k → u o< k ) (sym (Oprev.oprev=x op)) u<x ⟫ ) | |
903 | 913 zc12 : {z : Ordinal} → odef pchainpx z → odef (UnionCF A f mf ay supf1 x) z |
914 zc12 {z} (case1 ⟪ az , ch-init fc ⟫ ) = ⟪ az , ch-init fc ⟫ | |
919 | 915 zc12 {z} (case1 ⟪ az , ch-is-sup u su<sx is-sup fc ⟫ ) = zc21 fc where |
953 | 916 u<px : u o< px |
917 u<px = ZChain.supf-inject zc su<sx | |
918 u<x : u o< x | |
919 u<x = ordtrans u<px px<x | |
920 u≤px : u o≤ px | |
921 u≤px = o<→≤ u<px | |
922 s1u<s1x : supf1 u o< supf1 x | |
923 s1u<s1x = ordtrans<-≤ (subst₂ (λ j k → j o< k ) (sym (sf1=sf0 u≤px )) (sym (sf1=sf0 o≤-refl)) su<sx) (supf1-mono (o<→≤ px<x) ) | |
903 | 924 zc21 : {z1 : Ordinal } → FClosure A f (supf0 u) z1 → odef (UnionCF A f mf ay supf1 x) z1 |
925 zc21 {z1} (fsuc z2 fc ) with zc21 fc | |
926 ... | ⟪ ua1 , ch-init fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-init (fsuc _ fc₁) ⟫ | |
938 | 927 ... | ⟪ ua1 , ch-is-sup u u<x u1-is-sup fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-is-sup u u<x u1-is-sup (fsuc _ fc₁) ⟫ |
903 | 928 zc21 (init asp refl ) with trio< u px | inspect supf1 u |
929 ... | tri< a ¬b ¬c | _ = ⟪ asp , ch-is-sup u | |
953 | 930 s1u<s1x |
931 record {fcy<sup = zc13 ; order = zc17 ; supu=u = trans (sf1=sf0 u≤px ) (ChainP.supu=u is-sup) } zc14 ⟫ where | |
903 | 932 zc17 : {s : Ordinal} {z1 : Ordinal} → supf1 s o< supf1 u → |
933 FClosure A f (supf1 s) z1 → (z1 ≡ supf1 u) ∨ (z1 << supf1 u) | |
953 | 934 zc17 {s} {z1} ss<su fc = subst (λ k → (z1 ≡ k) ∨ (z1 << k)) (sym (sf1=sf0 (o<→≤ u<px))) ( ChainP.order is-sup |
935 (subst₂ (λ j k → j o< k ) (sf1=sf0 s≤px) (sf1=sf0 (o<→≤ u<px)) ss<su) (fcup fc s≤px) ) where | |
936 s≤px : s o≤ px -- ss<su : supf1 s o< supf1 u | |
937 s≤px = ordtrans ( supf-inject0 supf1-mono ss<su ) (o<→≤ u<px) | |
903 | 938 zc14 : FClosure A f (supf1 u) (supf0 u) |
953 | 939 zc14 = init (subst (λ k → odef A k ) (sym (sf1=sf0 u≤px)) asp) (sf1=sf0 u≤px) |
903 | 940 zc13 : {z : Ordinal } → FClosure A f y z → (z ≡ supf1 u) ∨ ( z << supf1 u ) |
953 | 941 zc13 {z} fc = subst (λ k → (z ≡ k) ∨ ( z << k )) (sym (sf1=sf0 u≤px )) ( ChainP.fcy<sup is-sup fc ) |
942 ... | tri≈ ¬a b ¬c | _ = ⟪ asp , ch-is-sup px (subst (λ k → supf1 k o< supf1 x) b s1u<s1x) record { fcy<sup = zc13 | |
903 | 943 ; order = zc17 ; supu=u = zc18 } (init asupf1 (trans (sf1=sf0 o≤-refl ) (cong supf0 (sym b))) ) ⟫ where |
944 zc13 : {z : Ordinal } → FClosure A f y z → (z ≡ supf1 px) ∨ ( z << supf1 px ) | |
945 zc13 {z} fc = subst (λ k → (z ≡ k) ∨ (z << k)) (trans (cong supf0 b) (sym (sf1=sf0 o≤-refl))) (ChainP.fcy<sup is-sup fc ) | |
946 zc18 : supf1 px ≡ px | |
947 zc18 = begin | |
948 supf1 px ≡⟨ sf1=sf0 o≤-refl ⟩ | |
949 supf0 px ≡⟨ cong supf0 (sym b) ⟩ | |
950 supf0 u ≡⟨ ChainP.supu=u is-sup ⟩ | |
951 u ≡⟨ b ⟩ | |
952 px ∎ where open ≡-Reasoning | |
953 zc17 : {s : Ordinal} {z1 : Ordinal} → supf1 s o< supf1 px → | |
954 FClosure A f (supf1 s) z1 → (z1 ≡ supf1 px) ∨ (z1 << supf1 px) | |
955 zc17 {s} {z1} ss<spx fc = subst (λ k → (z1 ≡ k) ∨ (z1 << k)) (trans (cong supf0 b) (sym (sf1=sf0 o≤-refl))) | |
956 ( ChainP.order is-sup (subst₂ (λ j k → j o< k) (sf1=sf0 s≤px) zc19 ss<spx) (fcup fc s≤px) ) where | |
957 zc19 : supf1 px ≡ supf0 u | |
958 zc19 = trans (sf1=sf0 o≤-refl) (cong supf0 (sym b)) | |
959 s≤px : s o≤ px | |
960 s≤px = o<→≤ (supf-inject0 supf1-mono ss<spx) | |
953 | 961 ... | tri> ¬a ¬b c | _ = ⊥-elim ( ¬p<x<op ⟪ c , u≤px ⟫ ) |
903 | 962 zc12 {z} (case2 fc) = zc21 fc where |
954 | 963 zc20 : (supf0 px ≡ px ) ∨ ( supf0 px o< px ) |
964 zc20 = ? | |
903 | 965 zc21 : {z1 : Ordinal } → FClosure A f (supf0 px) z1 → odef (UnionCF A f mf ay supf1 x) z1 |
966 zc21 {z1} (fsuc z2 fc ) with zc21 fc | |
967 ... | ⟪ ua1 , ch-init fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-init (fsuc _ fc₁) ⟫ | |
938 | 968 ... | ⟪ ua1 , ch-is-sup u u<x u1-is-sup fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-is-sup u u<x u1-is-sup (fsuc _ fc₁) ⟫ |
954 | 969 zc21 (init asp refl ) with zc20 |
953 | 970 ... | case1 sfpx=px = ⟪ asp , ch-is-sup px zc18 |
905 | 971 record {fcy<sup = zc13 ; order = zc17 ; supu=u = zc15 } zc14 ⟫ where |
972 zc15 : supf1 px ≡ px | |
973 zc15 = trans (sf1=sf0 o≤-refl ) (sfpx=px) | |
953 | 974 zc18 : supf1 px o< supf1 x |
975 zc18 = ? | |
905 | 976 zc14 : FClosure A f (supf1 px) (supf0 px) |
977 zc14 = init (subst (λ k → odef A k) (sym (sf1=sf0 o≤-refl)) asp) (sf1=sf0 o≤-refl) | |
978 zc13 : {z : Ordinal } → FClosure A f y z → (z ≡ supf1 px ) ∨ ( z << supf1 px ) | |
979 zc13 {z} fc = subst (λ k → (z ≡ k) ∨ ( z << k )) (sym (sf1=sf0 o≤-refl)) ( ZChain.fcy<sup zc o≤-refl fc ) | |
980 zc17 : {s : Ordinal} {z1 : Ordinal} → supf1 s o< supf1 px → | |
981 FClosure A f (supf1 s) z1 → (z1 ≡ supf1 px) ∨ (z1 << supf1 px) | |
982 zc17 {s} {z1} ss<spx fc = subst (λ k → (z1 ≡ k) ∨ (z1 << k )) mins-is-spx | |
950 | 983 (MinSUP.x≤sup mins (csupf17 (fcup fc (o<→≤ s<px) )) ) where |
905 | 984 mins : MinSUP A (UnionCF A f mf ay supf0 px) |
985 mins = ZChain.minsup zc o≤-refl | |
986 mins-is-spx : MinSUP.sup mins ≡ supf1 px | |
987 mins-is-spx = trans (sym ( ZChain.supf-is-minsup zc o≤-refl ) ) (sym (sf1=sf0 o≤-refl )) | |
988 s<px : s o< px | |
989 s<px = supf-inject0 supf1-mono ss<spx | |
990 sf<px : supf0 s o< px | |
991 sf<px = subst₂ (λ j k → j o< k ) (sf1=sf0 (o<→≤ s<px)) (trans (sf1=sf0 o≤-refl) (sfpx=px)) ss<spx | |
992 csupf17 : {z1 : Ordinal } → FClosure A f (supf0 s) z1 → odef (UnionCF A f mf ay supf0 px) z1 | |
993 csupf17 (init as refl ) = ZChain.csupf zc sf<px | |
994 csupf17 (fsuc x fc) = ZChain.f-next zc (csupf17 fc) | |
995 | |
996 ... | case2 sfp<px with ZChain.csupf zc sfp<px -- odef (UnionCF A f mf ay supf0 px) (supf0 px) | |
997 ... | ⟪ ua1 , ch-init fc₁ ⟫ = ⟪ ua1 , ch-init fc₁ ⟫ | |
954 | 998 ... | ⟪ ua1 , ch-is-sup u u<x is-sup fc₁ ⟫ = ⟪ ua1 , ch-is-sup u zc18 |
919 | 999 record { fcy<sup = z10 ; order = z11 ; supu=u = z12 } (fcpu fc₁ ? ) ⟫ where |
905 | 1000 z10 : {z : Ordinal } → FClosure A f y z → (z ≡ supf1 u) ∨ ( z << supf1 u ) |
919 | 1001 z10 {z} fc = subst (λ k → (z ≡ k) ∨ ( z << k )) (sym (sf1=sf0 ? )) (ChainP.fcy<sup is-sup fc) |
905 | 1002 z11 : {s z1 : Ordinal} → (lt : supf1 s o< supf1 u ) → FClosure A f (supf1 s ) z1 |
1003 → (z1 ≡ supf1 u ) ∨ ( z1 << supf1 u ) | |
919 | 1004 z11 {s} {z} lt fc = subst (λ k → (z ≡ k) ∨ ( z << k )) (sym (sf1=sf0 ? )) |
905 | 1005 (ChainP.order is-sup lt0 (fcup fc s≤px )) where |
1006 s<u : s o< u | |
1007 s<u = supf-inject0 supf1-mono lt | |
1008 s≤px : s o≤ px | |
938 | 1009 s≤px = ordtrans s<u ? -- (o<→≤ u<x) |
905 | 1010 lt0 : supf0 s o< supf0 u |
919 | 1011 lt0 = subst₂ (λ j k → j o< k ) (sf1=sf0 s≤px) (sf1=sf0 ? ) lt |
905 | 1012 z12 : supf1 u ≡ u |
919 | 1013 z12 = trans (sf1=sf0 ? ) (ChainP.supu=u is-sup) |
954 | 1014 zc18 : supf1 u o< supf1 x |
1015 zc18 = ? | |
905 | 1016 |
903 | 1017 |
1018 | |
885 | 1019 record STMP {z : Ordinal} (z≤x : z o≤ x ) : Set (Level.suc n) where |
1020 field | |
907 | 1021 tsup : MinSUP A (UnionCF A f mf ay supf1 z) |
885 | 1022 tsup=sup : supf1 z ≡ MinSUP.sup tsup |
1023 | |
1024 sup : {z : Ordinal} → (z≤x : z o≤ x ) → STMP z≤x | |
1025 sup {z} z≤x with trio< z px | |
1026 ... | tri< a ¬b ¬c = record { tsup = record { sup = MinSUP.sup m ; asm = MinSUP.asm m | |
950 | 1027 ; x≤sup = ms00 ; minsup = ms01 } ; tsup=sup = trans (sf1=sf0 (o<→≤ a) ) (ZChain.supf-is-minsup zc (o<→≤ a)) } where |
885 | 1028 m = ZChain.minsup zc (o<→≤ a) |
907 | 1029 ms00 : {x : Ordinal} → odef (UnionCF A f mf ay supf1 z) x → (x ≡ MinSUP.sup m) ∨ (x << MinSUP.sup m) |
950 | 1030 ms00 {x} ux = MinSUP.x≤sup m ? |
907 | 1031 ms01 : {sup2 : Ordinal} → odef A sup2 → ({x : Ordinal} → |
1032 odef (UnionCF A f mf ay supf1 z) x → (x ≡ sup2) ∨ (x << sup2)) → MinSUP.sup m o≤ sup2 | |
1033 ms01 {sup2} us P = MinSUP.minsup m ? ? | |
885 | 1034 ... | tri≈ ¬a b ¬c = record { tsup = record { sup = MinSUP.sup m ; asm = MinSUP.asm m |
950 | 1035 ; x≤sup = ms00 ; minsup = ms01 } ; tsup=sup = trans (sf1=sf0 (o≤-refl0 b) ) (ZChain.supf-is-minsup zc (o≤-refl0 b)) } where |
885 | 1036 m = ZChain.minsup zc (o≤-refl0 b) |
907 | 1037 ms00 : {x : Ordinal} → odef (UnionCF A f mf ay supf1 z) x → (x ≡ MinSUP.sup m) ∨ (x << MinSUP.sup m) |
950 | 1038 ms00 {x} ux = MinSUP.x≤sup m ? |
907 | 1039 ms01 : {sup2 : Ordinal} → odef A sup2 → ({x : Ordinal} → |
1040 odef (UnionCF A f mf ay supf1 z) x → (x ≡ sup2) ∨ (x << sup2)) → MinSUP.sup m o≤ sup2 | |
1041 ms01 {sup2} us P = MinSUP.minsup m ? ? | |
901 | 1042 ... | tri> ¬a ¬b px<z = record { tsup = record { sup = sp1 ; asm = MinSUP.asm sup1 |
950 | 1043 ; x≤sup = ms00 ; minsup = ms01 } ; tsup=sup = sf1=sp1 px<z } where |
907 | 1044 m = sup1 |
1045 ms00 : {x : Ordinal} → odef (UnionCF A f mf ay supf1 z) x → (x ≡ MinSUP.sup m) ∨ (x << MinSUP.sup m) | |
950 | 1046 ms00 {x} ux = MinSUP.x≤sup m ? |
907 | 1047 ms01 : {sup2 : Ordinal} → odef A sup2 → ({x : Ordinal} → |
1048 odef (UnionCF A f mf ay supf1 z) x → (x ≡ sup2) ∨ (x << sup2)) → MinSUP.sup m o≤ sup2 | |
1049 ms01 {sup2} us P = MinSUP.minsup m ? ? | |
885 | 1050 |
887 | 1051 csupf1 : {z1 : Ordinal } → supf1 z1 o< x → odef (UnionCF A f mf ay supf1 x) (supf1 z1) |
906 | 1052 csupf1 {z1} sz1<x = csupf2 where |
1053 -- z1 o< px → supf1 z1 ≡ supf0 z1 | |
1054 -- z1 ≡ px , supf0 px o< px .. px o< z1, x o≤ z1 ... supf1 z1 ≡ sp1 | |
1055 -- z1 ≡ px , supf0 px ≡ px | |
1056 psz1≤px : supf1 z1 o≤ px | |
918
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1057 psz1≤px = subst (λ k → supf1 z1 o< k ) (sym opx=x) sz1<x |
906 | 1058 csupf2 : odef (UnionCF A f mf ay supf1 x) (supf1 z1) |
907 | 1059 csupf2 with trio< z1 px | inspect supf1 z1 |
1060 csupf2 | tri< a ¬b ¬c | record { eq = eq1 } with osuc-≡< psz1≤px | |
909 | 1061 ... | case2 lt = zc12 (case1 cs03) where |
1062 cs03 : odef (UnionCF A f mf ay supf0 px) (supf0 z1) | |
1063 cs03 = ZChain.csupf zc (subst (λ k → k o< px) (sf1=sf0 (o<→≤ a)) lt ) | |
910 | 1064 ... | case1 sfz=px with osuc-≡< ( supf1-mono (o<→≤ a) ) |
1065 ... | case1 sfz=sfpx = zc12 (case2 (init (ZChain.asupf zc) cs04 )) where | |
1066 supu=u : supf1 (supf1 z1) ≡ supf1 z1 | |
1067 supu=u = trans (cong supf1 sfz=px) (sym sfz=sfpx) | |
1068 cs04 : supf0 px ≡ supf0 z1 | |
1069 cs04 = begin | |
911 | 1070 supf0 px ≡⟨ sym (sf1=sf0 o≤-refl) ⟩ |
1071 supf1 px ≡⟨ sym sfz=sfpx ⟩ | |
1072 supf1 z1 ≡⟨ sf1=sf0 (o<→≤ a) ⟩ | |
1073 supf0 z1 ∎ where open ≡-Reasoning | |
918
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1074 ... | case2 sfz<sfpx = ⊥-elim ( ¬p<x<op ⟪ cs05 , cs06 ⟫ ) where |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1075 --- supf1 z1 ≡ px , z1 o< px , px ≡ supf0 z1 o< supf0 px o< x |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1076 cs05 : px o< supf0 px |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1077 cs05 = subst₂ ( λ j k → j o< k ) sfz=px (sf1=sf0 o≤-refl ) sfz<sfpx |
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1078 cs06 : supf0 px o< osuc px |
954 | 1079 cs06 = subst (λ k → supf0 px o< k ) (sym opx=x) ? |
909 | 1080 csupf2 | tri≈ ¬a b ¬c | record { eq = eq1 } = zc12 (case2 (init (ZChain.asupf zc) (cong supf0 (sym b)))) |
919 | 1081 csupf2 | tri> ¬a ¬b px<z1 | record { eq = eq1 } = ? |
1082 -- ⊥-elim ( ¬p<x<op ⟪ px<z1 , subst (λ k → z1 o< k) (sym opx=x) z1<x ⟫ ) | |
918
4c33f8383d7d
supf px o< px is in csupf
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
911
diff
changeset
|
1083 |
877 | 1084 |
954 | 1085 zc41 | (case1 sfp=sp1 ) = record { supf = supf0 ; sup=u = ? ; asupf = ? ; supf-mono = ? ; supf-< = ? |
901 | 1086 ; supfmax = ? ; minsup = ? ; supf-is-minsup = ? ; csupf = ? } where |
883 | 1087 |
901 | 1088 -- supf0 px not is included by the chain |
1089 -- supf1 x ≡ supf0 px because of supfmax | |
883 | 1090 |
872 | 1091 supf1 : Ordinal → Ordinal |
1092 supf1 z with trio< z px | |
871 | 1093 ... | tri< a ¬b ¬c = supf0 z |
872 | 1094 ... | tri≈ ¬a b ¬c = supf0 px |
871 | 1095 ... | tri> ¬a ¬b c = supf0 px |
1096 | |
886 | 1097 sf1=sf0 : {z : Ordinal } → z o< px → supf1 z ≡ supf0 z |
1098 sf1=sf0 {z} z<px with trio< z px | |
874 | 1099 ... | tri< a ¬b ¬c = refl |
1100 ... | tri≈ ¬a b ¬c = ⊥-elim ( ¬a z<px ) | |
1101 ... | tri> ¬a ¬b c = ⊥-elim ( ¬a z<px ) | |
1102 | |
1103 zc17 : {z : Ordinal } → supf0 z o≤ supf0 px | |
1104 zc17 = ? -- px o< z, px o< supf0 px | |
1105 | |
1106 supf-mono1 : {z w : Ordinal } → z o≤ w → supf1 z o≤ supf1 w | |
1107 supf-mono1 {z} {w} z≤w with trio< w px | |
886 | 1108 ... | tri< a ¬b ¬c = subst₂ (λ j k → j o≤ k ) (sym (sf1=sf0 (ordtrans≤-< z≤w a))) refl ( supf-mono z≤w ) |
874 | 1109 ... | tri≈ ¬a refl ¬c with trio< z px |
1110 ... | tri< a ¬b ¬c = zc17 | |
1111 ... | tri≈ ¬a refl ¬c = o≤-refl | |
1112 ... | tri> ¬a ¬b c = o≤-refl | |
1113 supf-mono1 {z} {w} z≤w | tri> ¬a ¬b c with trio< z px | |
1114 ... | tri< a ¬b ¬c = zc17 | |
1115 ... | tri≈ ¬a b ¬c = o≤-refl | |
1116 ... | tri> ¬a ¬b c = o≤-refl | |
1117 | |
872 | 1118 pchain1 : HOD |
1119 pchain1 = UnionCF A f mf ay supf1 x | |
871 | 1120 |
863 | 1121 zc10 : {z : Ordinal} → OD.def (od pchain) z → OD.def (od pchain1) z |
1122 zc10 {z} ⟪ az , ch-init fc ⟫ = ⟪ az , ch-init fc ⟫ | |
894 | 1123 zc10 {z} ⟪ az , ch-is-sup u1 u1<x u1-is-sup fc ⟫ = ⟪ az , ch-is-sup u1 ? ? ? ⟫ |
873 | 1124 |
1125 zc111 : {z : Ordinal} → z o< px → OD.def (od pchain1) z → OD.def (od pchain) z | |
1126 zc111 {z} z<px ⟪ az , ch-init fc ⟫ = ⟪ az , ch-init fc ⟫ | |
894 | 1127 zc111 {z} z<px ⟪ az , ch-is-sup u1 u1<x u1-is-sup fc ⟫ = ⟪ az , ch-is-sup u1 ? ? ? ⟫ |
873 | 1128 |
863 | 1129 zc11 : (¬ xSUP (UnionCF A f mf ay supf0 px) x ) ∨ (HasPrev A pchain x f ) |
864 | 1130 → {z : Ordinal} → OD.def (od pchain1) z → OD.def (od pchain) z ∨ ( (supf0 px ≡ px) ∧ FClosure A f px z ) |
863 | 1131 zc11 P {z} ⟪ az , ch-init fc ⟫ = case1 ⟪ az , ch-init fc ⟫ |
1132 zc11 P {z} ⟪ az , ch-is-sup u1 u1<x u1-is-sup fc ⟫ with trio< u1 px | |
890 | 1133 ... | tri< u1<px ¬b ¬c = case1 ⟪ az , ch-is-sup u1 ? ? fc ⟫ |
872 | 1134 ... | tri≈ ¬a eq ¬c = case2 ⟪ subst (λ k → supf0 k ≡ k) eq s1u=u , subst (λ k → FClosure A f k z) zc12 ? ⟫ where |
863 | 1135 s1u=u : supf0 u1 ≡ u1 |
872 | 1136 s1u=u = ? -- ChainP.supu=u u1-is-sup |
864 | 1137 zc12 : supf0 u1 ≡ px |
872 | 1138 zc12 = trans s1u=u eq |
863 | 1139 zc11 (case1 ¬sp=x) {z} ⟪ az , ch-is-sup u1 u1<x u1-is-sup fc ⟫ | tri> ¬a ¬b px<u = ⊥-elim (¬sp=x zcsup) where |
1140 eq : u1 ≡ x | |
1141 eq with trio< u1 x | |
1142 ... | tri< a ¬b ¬c = ⊥-elim ( ¬p<x<op ⟪ px<u , subst (λ k → u1 o< k ) (sym (Oprev.oprev=x op )) a ⟫ ) | |
1143 ... | tri≈ ¬a b ¬c = b | |
890 | 1144 ... | tri> ¬a ¬b c = ⊥-elim ( o<> u1<x ? ) |
863 | 1145 s1u=x : supf0 u1 ≡ x |
872 | 1146 s1u=x = trans ? eq |
863 | 1147 zc13 : osuc px o< osuc u1 |
1148 zc13 = o≤-refl0 ( trans (Oprev.oprev=x op) (sym eq ) ) | |
950 | 1149 x≤sup : {w : Ordinal} → odef (UnionCF A f mf ay supf0 px) w → (w ≡ x) ∨ (w << x) |
1150 x≤sup {w} ⟪ az , ch-init {w} fc ⟫ = subst (λ k → (w ≡ k) ∨ (w << k)) s1u=x ? | |
1151 x≤sup {w} ⟪ az , ch-is-sup u u<x is-sup fc ⟫ with osuc-≡< ( supf-mono (ordtrans (o<→≤ u<x) ? )) | |
890 | 1152 ... | case1 eq1 = ⊥-elim ( o<¬≡ zc14 ? ) where |
851 | 1153 zc14 : u ≡ osuc px |
1154 zc14 = begin | |
1155 u ≡⟨ sym ( ChainP.supu=u is-sup) ⟩ | |
894 | 1156 supf0 u ≡⟨ ? ⟩ |
857 | 1157 supf0 u1 ≡⟨ s1u=x ⟩ |
851 | 1158 x ≡⟨ sym (Oprev.oprev=x op) ⟩ |
1159 osuc px ∎ where open ≡-Reasoning | |
872 | 1160 ... | case2 lt = subst (λ k → (w ≡ k) ∨ (w << k)) s1u=x ? |
863 | 1161 zc12 : supf0 x ≡ u1 |
872 | 1162 zc12 = subst (λ k → supf0 k ≡ u1) eq ? |
863 | 1163 zcsup : xSUP (UnionCF A f mf ay supf0 px) x |
868 | 1164 zcsup = record { ax = subst (λ k → odef A k) (trans zc12 eq) (ZChain.asupf zc) |
954 | 1165 ; is-sup = record { x≤sup = x≤sup ; minsup = ? } } |
872 | 1166 zc11 (case2 hp) {z} ⟪ az , ch-is-sup u1 u1<x u1-is-sup fc ⟫ | tri> ¬a ¬b px<u = case1 ? where |
863 | 1167 eq : u1 ≡ x |
864 | 1168 eq with trio< u1 x |
1169 ... | tri< a ¬b ¬c = ⊥-elim ( ¬p<x<op ⟪ px<u , subst (λ k → u1 o< k ) (sym (Oprev.oprev=x op )) a ⟫ ) | |
1170 ... | tri≈ ¬a b ¬c = b | |
890 | 1171 ... | tri> ¬a ¬b c = ⊥-elim ( o<> u1<x ? ) |
858 | 1172 zc20 : {z : Ordinal} → FClosure A f (supf0 u1) z → OD.def (od pchain) z |
1173 zc20 {z} (init asu su=z ) = zc13 where | |
1174 zc14 : x ≡ z | |
1175 zc14 = begin | |
1176 x ≡⟨ sym eq ⟩ | |
872 | 1177 u1 ≡⟨ sym ? ⟩ |
858 | 1178 supf0 u1 ≡⟨ su=z ⟩ |
1179 z ∎ where open ≡-Reasoning | |
1180 zc13 : odef pchain z | |
1181 zc13 = subst (λ k → odef pchain k) (trans (sym (HasPrev.x=fy hp)) zc14) ( ZChain.f-next zc (HasPrev.ay hp) ) | |
1182 zc20 {.(f w)} (fsuc w fc) = ZChain.f-next zc (zc20 fc) | |
891 | 1183 |
857 | 1184 record STMP {z : Ordinal} (z≤x : z o≤ x ) : Set (Level.suc n) where |
1185 field | |
891 | 1186 tsup : MinSUP A (UnionCF A f mf ay supf1 z) |
1187 tsup=sup : supf1 z ≡ MinSUP.sup tsup | |
1188 | |
857 | 1189 sup : {z : Ordinal} → (z≤x : z o≤ x ) → STMP z≤x |
1190 sup {z} z≤x with trio< z px | |
891 | 1191 ... | tri< a ¬b ¬c = ? -- jrecord { tsup = ZChain.minsup zc (o<→≤ a) ; tsup=sup = ZChain.supf-is-minsup zc (o<→≤ a) } |
1192 ... | tri≈ ¬a b ¬c = ? -- record { tsup = ZChain.minsup zc (o≤-refl0 b) ; tsup=sup = ZChain.supf-is-minsup zc (o≤-refl0 b) } | |
865 | 1193 ... | tri> ¬a ¬b px<z = zc35 where |
840 | 1194 zc30 : z ≡ x |
1195 zc30 with osuc-≡< z≤x | |
1196 ... | case1 eq = eq | |
1197 ... | case2 z<x = ⊥-elim (¬p<x<op ⟪ px<z , subst (λ k → z o< k ) (sym (Oprev.oprev=x op)) z<x ⟫ ) | |
865 | 1198 zc32 = ZChain.sup zc o≤-refl |
1199 zc34 : ¬ (supf0 px ≡ px) → {w : HOD} → UnionCF A f mf ay supf0 z ∋ w → (w ≡ SUP.sup zc32) ∨ (w < SUP.sup zc32) | |
882 | 1200 zc34 ne {w} lt with zc11 ? ⟪ proj1 lt , ? ⟫ |
950 | 1201 ... | case1 lt = SUP.x≤sup zc32 lt |
865 | 1202 ... | case2 ⟪ spx=px , fc ⟫ = ⊥-elim ( ne spx=px ) |
857 | 1203 zc33 : supf0 z ≡ & (SUP.sup zc32) |
891 | 1204 zc33 = ? -- trans (sym (supfx (o≤-refl0 (sym zc30)))) ( ZChain.supf-is-minsup zc o≤-refl ) |
865 | 1205 zc36 : ¬ (supf0 px ≡ px) → STMP z≤x |
950 | 1206 zc36 ne = ? -- record { tsup = record { sup = SUP.sup zc32 ; as = SUP.as zc32 ; x≤sup = zc34 ne } ; tsup=sup = zc33 } |
865 | 1207 zc35 : STMP z≤x |
1208 zc35 with trio< (supf0 px) px | |
1209 ... | tri< a ¬b ¬c = zc36 ¬b | |
1210 ... | tri> ¬a ¬b c = zc36 ¬b | |
891 | 1211 ... | tri≈ ¬a b ¬c = record { tsup = ? ; tsup=sup = ? } where |
1212 zc37 : MinSUP A (UnionCF A f mf ay supf0 z) | |
950 | 1213 zc37 = record { sup = ? ; asm = ? ; x≤sup = ? } |
803 | 1214 sup=u : {b : Ordinal} (ab : odef A b) → |
860
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1215 b o≤ x → IsSup A (UnionCF A f mf ay supf0 b) ab ∧ (¬ HasPrev A (UnionCF A f mf ay supf0 b) b f ) → supf0 b ≡ b |
814 | 1216 sup=u {b} ab b≤x is-sup with trio< b px |
954 | 1217 ... | tri< a ¬b ¬c = ZChain.sup=u zc ab (o<→≤ a) ⟪ record { x≤sup = λ lt → IsSup.x≤sup (proj1 is-sup) lt ; minsup = ? } , proj2 is-sup ⟫ |
1218 ... | tri≈ ¬a b ¬c = ZChain.sup=u zc ab (o≤-refl0 b) ⟪ record { x≤sup = λ lt → IsSup.x≤sup (proj1 is-sup) lt ; minsup = ? } , proj2 is-sup ⟫ | |
882 | 1219 ... | tri> ¬a ¬b px<b = zc31 ? where |
815 | 1220 zc30 : x ≡ b |
1221 zc30 with osuc-≡< b≤x | |
1222 ... | case1 eq = sym (eq) | |
1223 ... | case2 b<x = ⊥-elim (¬p<x<op ⟪ px<b , subst (λ k → b o< k ) (sym (Oprev.oprev=x op)) b<x ⟫ ) | |
859 | 1224 zcsup : xSUP (UnionCF A f mf ay supf0 px) x |
1225 zcsup with zc30 | |
950 | 1226 ... | refl = record { ax = ab ; is-sup = record { x≤sup = λ {w} lt → |
954 | 1227 IsSup.x≤sup (proj1 is-sup) ? ; minsup = ? } } |
860
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1228 zc31 : ( (¬ xSUP (UnionCF A f mf ay supf0 px) x ) ∨ HasPrev A (UnionCF A f mf ay supf0 px) x f) → supf0 b ≡ b |
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1229 zc31 (case1 ¬sp=x) with zc30 |
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1230 ... | refl = ⊥-elim (¬sp=x zcsup ) |
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1231 zc31 (case2 hasPrev ) with zc30 |
863 | 1232 ... | refl = ⊥-elim ( proj2 is-sup record { ax = HasPrev.ax hasPrev ; y = HasPrev.y hasPrev |
872 | 1233 ; ay = ? ; x=fy = HasPrev.x=fy hasPrev } ) |
833 | 1234 |
728 | 1235 ... | no lim = zc5 where |
726
b2e2cd12e38f
psupf-mono and is-max conflict
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
725
diff
changeset
|
1236 |
703 | 1237 pzc : (z : Ordinal) → z o< x → ZChain A f mf ay z |
1238 pzc z z<x = prev z z<x | |
726
b2e2cd12e38f
psupf-mono and is-max conflict
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
725
diff
changeset
|
1239 |
928 | 1240 ysp = MinSUP.sup (ysup f mf ay) |
755 | 1241 |
835 | 1242 supf0 : Ordinal → Ordinal |
1243 supf0 z with trio< z x | |
1244 ... | tri< a ¬b ¬c = ZChain.supf (pzc (osuc z) (ob<x lim a)) z | |
836 | 1245 ... | tri≈ ¬a b ¬c = ysp |
1246 ... | tri> ¬a ¬b c = ysp | |
835 | 1247 |
838 | 1248 pchain : HOD |
1249 pchain = UnionCF A f mf ay supf0 x | |
835 | 1250 |
838 | 1251 ptotal0 : IsTotalOrderSet pchain |
835 | 1252 ptotal0 {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where |
1253 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
1254 uz01 = chain-total A f mf ay supf0 ( (proj2 ca)) ( (proj2 cb)) | |
844 | 1255 |
880 | 1256 usup : MinSUP A pchain |
1257 usup = minsupP pchain (λ lt → proj1 lt) ptotal0 | |
1258 spu = MinSUP.sup usup | |
834 | 1259 |
794 | 1260 supf1 : Ordinal → Ordinal |
835 | 1261 supf1 z with trio< z x |
1262 ... | tri< a ¬b ¬c = ZChain.supf (pzc (osuc z) (ob<x lim a)) z | |
836 | 1263 ... | tri≈ ¬a b ¬c = spu |
1264 ... | tri> ¬a ¬b c = spu | |
755 | 1265 |
838 | 1266 pchain1 : HOD |
1267 pchain1 = UnionCF A f mf ay supf1 x | |
704 | 1268 |
758
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1269 is-max-hp : (supf : Ordinal → Ordinal) (x : Ordinal) {a : Ordinal} {b : Ordinal} → odef (UnionCF A f mf ay supf x) a → |
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1270 b o< x → (ab : odef A b) → |
836 | 1271 HasPrev A (UnionCF A f mf ay supf x) b f → |
758
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1272 * a < * b → odef (UnionCF A f mf ay supf x) b |
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1273 is-max-hp supf x {a} {b} ua b<x ab has-prev a<b with HasPrev.ay has-prev |
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1274 ... | ⟪ ab0 , ch-init fc ⟫ = ⟪ ab , ch-init ( subst (λ k → FClosure A f y k) (sym (HasPrev.x=fy has-prev)) (fsuc _ fc )) ⟫ |
938 | 1275 ... | ⟪ ab0 , ch-is-sup u u<x is-sup fc ⟫ = ? -- ⟪ ab , |
890 | 1276 -- subst (λ k → UChain A f mf ay supf x k ) |
938 | 1277 -- (sym (HasPrev.x=fy has-prev)) ( ch-is-sup u u<x is-sup (fsuc _ fc)) ⟫ |
758
a2947dfff80d
is-max on first transfinite induction is not good
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
757
diff
changeset
|
1278 |
844 | 1279 zc70 : HasPrev A pchain x f → ¬ xSUP pchain x |
1280 zc70 pr xsup = ? | |
1281 | |
1282 no-extension : ¬ ( xSUP (UnionCF A f mf ay supf0 x) x ) → ZChain A f mf ay x | |
879 | 1283 no-extension ¬sp=x = ? where -- record { supf = supf1 ; sup=u = sup=u |
1284 -- ; sup = sup ; supf-is-sup = sis ; supf-mono = {!!} ; asupf = ? } where | |
795
408e7e8a3797
csupf depends on order cyclicly
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
794
diff
changeset
|
1285 supfu : {u : Ordinal } → ( a : u o< x ) → (z : Ordinal) → Ordinal |
408e7e8a3797
csupf depends on order cyclicly
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
794
diff
changeset
|
1286 supfu {u} a z = ZChain.supf (pzc (osuc u) (ob<x lim a)) z |
838 | 1287 pchain0=1 : pchain ≡ pchain1 |
1288 pchain0=1 = ==→o≡ record { eq→ = zc10 ; eq← = zc11 } where | |
1289 zc10 : {z : Ordinal} → OD.def (od pchain) z → OD.def (od pchain1) z | |
1290 zc10 {z} ⟪ az , ch-init fc ⟫ = ⟪ az , ch-init fc ⟫ | |
938 | 1291 zc10 {z} ⟪ az , ch-is-sup u u<x is-sup fc ⟫ = zc12 fc where |
838 | 1292 zc12 : {z : Ordinal} → FClosure A f (supf0 u) z → odef pchain1 z |
1293 zc12 (fsuc x fc) with zc12 fc | |
1294 ... | ⟪ ua1 , ch-init fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-init (fsuc _ fc₁) ⟫ | |
938 | 1295 ... | ⟪ ua1 , ch-is-sup u u<x is-sup fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-is-sup u u<x is-sup (fsuc _ fc₁) ⟫ |
890 | 1296 zc12 (init asu su=z ) = ⟪ subst (λ k → odef A k) su=z asu , ch-is-sup u ? ? (init ? ? ) ⟫ |
838 | 1297 zc11 : {z : Ordinal} → OD.def (od pchain1) z → OD.def (od pchain) z |
1298 zc11 {z} ⟪ az , ch-init fc ⟫ = ⟪ az , ch-init fc ⟫ | |
938 | 1299 zc11 {z} ⟪ az , ch-is-sup u u<x is-sup fc ⟫ = zc13 fc where |
838 | 1300 zc13 : {z : Ordinal} → FClosure A f (supf1 u) z → odef pchain z |
1301 zc13 (fsuc x fc) with zc13 fc | |
1302 ... | ⟪ ua1 , ch-init fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-init (fsuc _ fc₁) ⟫ | |
938 | 1303 ... | ⟪ ua1 , ch-is-sup u u<x is-sup fc₁ ⟫ = ⟪ proj2 ( mf _ ua1) , ch-is-sup u u<x is-sup (fsuc _ fc₁) ⟫ |
838 | 1304 zc13 (init asu su=z ) with trio< u x |
890 | 1305 ... | tri< a ¬b ¬c = ⟪ ? , ch-is-sup u ? ? (init ? ? ) ⟫ |
838 | 1306 ... | tri≈ ¬a b ¬c = ? |
938 | 1307 ... | tri> ¬a ¬b c = ? -- ⊥-elim ( o≤> u<x c ) |
832 | 1308 sup : {z : Ordinal} → z o≤ x → SUP A (UnionCF A f mf ay supf1 z) |
797 | 1309 sup {z} z≤x with trio< z x |
838 | 1310 ... | tri< a ¬b ¬c = SUP⊆ ? (ZChain.sup (pzc (osuc z) {!!}) {!!} ) |
815 | 1311 ... | tri≈ ¬a b ¬c = {!!} |
843 | 1312 ... | tri> ¬a ¬b x<z = ⊥-elim (o<¬≡ refl (ordtrans<-≤ x<z z≤x )) |
832 | 1313 sis : {z : Ordinal} (x≤z : z o≤ x) → supf1 z ≡ & (SUP.sup (sup {!!})) |
843 | 1314 sis {z} z≤x with trio< z x |
800 | 1315 ... | tri< a ¬b ¬c = {!!} where |
891 | 1316 zc8 = ZChain.supf-is-minsup (pzc z a) {!!} |
815 | 1317 ... | tri≈ ¬a b ¬c = {!!} |
843 | 1318 ... | tri> ¬a ¬b x<z = ⊥-elim (o<¬≡ refl (ordtrans<-≤ x<z z≤x )) |
860
105f8d6c51fb
no-extension on immidate ordinal passed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
859
diff
changeset
|
1319 sup=u : {b : Ordinal} (ab : odef A b) → b o≤ x → IsSup A (UnionCF A f mf ay supf1 b) ab ∧ (¬ HasPrev A (UnionCF A f mf ay supf1 b) b f ) → supf1 b ≡ b |
843 | 1320 sup=u {z} ab z≤x is-sup with trio< z x |
950 | 1321 ... | tri< a ¬b ¬c = ? -- ZChain.sup=u (pzc (osuc b) (ob<x lim a)) ab {!!} record { x≤sup = {!!} } |
1322 ... | tri≈ ¬a b ¬c = {!!} -- ZChain.sup=u (pzc (osuc ?) ?) ab {!!} record { x≤sup = {!!} } | |
843 | 1323 ... | tri> ¬a ¬b x<z = ⊥-elim (o<¬≡ refl (ordtrans<-≤ x<z z≤x )) |
797 | 1324 |
703 | 1325 zc5 : ZChain A f mf ay x |
697 | 1326 zc5 with ODC.∋-p O A (* x) |
796 | 1327 ... | no noax = no-extension {!!} -- ¬ A ∋ p, just skip |
836 | 1328 ... | yes ax with ODC.p∨¬p O ( HasPrev A pchain x f ) |
703 | 1329 -- we have to check adding x preserve is-max ZChain A y f mf x |
796 | 1330 ... | case1 pr = no-extension {!!} |
704 | 1331 ... | case2 ¬fy<x with ODC.p∨¬p O (IsSup A pchain ax ) |
879 | 1332 ... | case1 is-sup = ? -- record { supf = supf1 ; sup=u = {!!} |
1333 -- ; sup = {!!} ; supf-is-sup = {!!} ; supf-mono = {!!}; asupf = {!!} } -- where -- x is a sup of (zc ?) | |
796 | 1334 ... | case2 ¬x=sup = no-extension {!!} -- x is not f y' nor sup of former ZChain from y -- no extention |
553 | 1335 |
921 | 1336 --- |
1337 --- the maximum chain has fix point of any ≤-monotonic function | |
1338 --- | |
1339 | |
1340 SZ : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) → {y : Ordinal} (ay : odef A y) → (x : Ordinal) → ZChain A f mf ay x | |
1341 SZ f mf {y} ay x = TransFinite {λ z → ZChain A f mf ay z } (λ x → ind f mf ay x ) x | |
1342 | |
934 | 1343 msp0 : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {x y : Ordinal} (ay : odef A y) |
1344 → (zc : ZChain A f mf ay x ) | |
1345 → MinSUP A (UnionCF A f mf ay (ZChain.supf zc) x) | |
1346 msp0 f mf {x} ay zc = minsupP (UnionCF A f mf ay (ZChain.supf zc) x) (ZChain.chain⊆A zc) ztotal where | |
1347 ztotal : IsTotalOrderSet (ZChain.chain zc) | |
1348 ztotal {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where | |
1349 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
1350 uz01 = chain-total A f mf ay (ZChain.supf zc) ( (proj2 ca)) ( (proj2 cb)) | |
922 | 1351 |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1352 sp0 : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {x y : Ordinal} (ay : odef A y) |
923
85f6238a38db
use supf of zchain for (nmx : ¬ Maximal A ) → ⊥
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
922
diff
changeset
|
1353 → (zc : ZChain A f mf ay x ) |
85f6238a38db
use supf of zchain for (nmx : ¬ Maximal A ) → ⊥
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
922
diff
changeset
|
1354 → SUP A (UnionCF A f mf ay (ZChain.supf zc) x) |
934 | 1355 sp0 f mf ay zc = M→S (ZChain.supf zc) (msp0 f mf ay zc ) |
921 | 1356 |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1357 fixpoint : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) (zc : ZChain A f mf as0 (& A) ) |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1358 → (sp1 : SUP A (ZChain.chain zc)) -- & (SUP.sup (sp0 f mf as0 zc )) |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1359 → (ssp<as : ZChain.supf zc (& (SUP.sup sp1)) o< ZChain.supf zc (& A)) |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1360 → f (& (SUP.sup sp1)) ≡ & (SUP.sup sp1) |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1361 fixpoint f mf zc sp1 ssp<as = z14 where |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1362 chain = ZChain.chain zc |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1363 supf = ZChain.supf zc |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1364 sp : Ordinal |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1365 sp = & (SUP.sup sp1) |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1366 asp : odef A sp |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1367 asp = SUP.as sp1 |
921 | 1368 z10 : {a b : Ordinal } → (ca : odef chain a ) → supf b o< supf (& A) → (ab : odef A b ) |
1369 → HasPrev A chain b f ∨ IsSup A chain {b} ab | |
1370 → * a < * b → odef chain b | |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1371 z10 = ZChain1.is-max (SZ1 f mf as0 zc (& A) ) |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1372 z22 : sp o< & A |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1373 z22 = z09 asp |
950 | 1374 x≤sup : {x : HOD} → chain ∋ x → (x ≡ SUP.sup sp1 ) ∨ (x < SUP.sup sp1 ) |
1375 x≤sup bz = SUP.x≤sup sp1 bz | |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1376 z12 : odef chain sp |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1377 z12 with o≡? (& s) sp |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1378 ... | yes eq = subst (λ k → odef chain k) eq ( ZChain.chain∋init zc ) |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1379 ... | no ne = ZChain1.is-max (SZ1 f mf as0 zc (& A)) {& s} {sp} ( ZChain.chain∋init zc ) ssp<as asp |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1380 (case2 z19 ) z13 where |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1381 z13 : * (& s) < * sp |
950 | 1382 z13 with x≤sup ( ZChain.chain∋init zc ) |
921 | 1383 ... | case1 eq = ⊥-elim ( ne (cong (&) eq) ) |
1384 ... | case2 lt = subst₂ (λ j k → j < k ) (sym *iso) (sym *iso) lt | |
1385 z19 : IsSup A chain {& (SUP.sup sp1)} (SUP.as sp1) | |
954 | 1386 z19 = record { x≤sup = z20 ; minsup = ? } where |
921 | 1387 z20 : {y : Ordinal} → odef chain y → (y ≡ & (SUP.sup sp1)) ∨ (y << & (SUP.sup sp1)) |
950 | 1388 z20 {y} zy with x≤sup (subst (λ k → odef chain k ) (sym &iso) zy) |
921 | 1389 ... | case1 y=p = case1 (subst (λ k → k ≡ _ ) &iso ( cong (&) y=p )) |
1390 ... | case2 y<p = case2 (subst (λ k → * y < k ) (sym *iso) y<p ) | |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1391 ztotal : IsTotalOrderSet (ZChain.chain zc) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1392 ztotal {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1393 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1394 uz01 = chain-total A f mf as0 supf ( (proj2 ca)) ( (proj2 cb)) |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1395 z14 : f sp ≡ sp |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1396 z14 with ztotal (subst (λ k → odef chain k) (sym &iso) (ZChain.f-next zc z12 )) z12 |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1397 ... | tri< a ¬b ¬c = ⊥-elim z16 where |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1398 z16 : ⊥ |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1399 z16 with proj1 (mf (& ( SUP.sup sp1)) ( SUP.as sp1 )) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1400 ... | case1 eq = ⊥-elim (¬b (subst₂ (λ j k → j ≡ k ) refl *iso (sym eq) )) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1401 ... | case2 lt = ⊥-elim (¬c (subst₂ (λ j k → k < j ) refl *iso lt )) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1402 ... | tri≈ ¬a b ¬c = subst ( λ k → k ≡ & (SUP.sup sp1) ) &iso ( cong (&) b ) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1403 ... | tri> ¬a ¬b c = ⊥-elim z17 where |
936 | 1404 z15 : (* (f sp) ≡ SUP.sup sp1) ∨ (* (f sp) < SUP.sup sp1 ) |
950 | 1405 z15 = x≤sup (subst (λ k → odef chain k ) (sym &iso) (ZChain.f-next zc z12 )) |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1406 z17 : ⊥ |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1407 z17 with z15 |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1408 ... | case1 eq = ¬b eq |
936 | 1409 ... | case2 lt = ¬a lt |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1410 |
952 | 1411 tri : {n : Level} (u w : Ordinal ) { R : Set n } → ( u o< w → R ) → ( u ≡ w → R ) → ( w o< u → R ) → R |
1412 tri {_} u w p q r with trio< u w | |
1413 ... | tri< a ¬b ¬c = p a | |
1414 ... | tri≈ ¬a b ¬c = q b | |
1415 ... | tri> ¬a ¬b c = r c | |
1416 | |
1417 or : {n m r : Level } {P : Set n } {Q : Set m} {R : Set r} → P ∨ Q → ( P → R ) → (Q → R ) → R | |
1418 or (case1 p) p→r q→r = p→r p | |
1419 or (case2 q) p→r q→r = q→r q | |
1420 | |
921 | 1421 |
1422 -- ZChain contradicts ¬ Maximal | |
1423 -- | |
1424 -- ZChain forces fix point on any ≤-monotonic function (fixpoint) | |
1425 -- ¬ Maximal create cf which is a <-monotonic function by axiom of choice. This contradicts fix point of ZChain | |
1426 -- | |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1427 |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1428 z04 : (nmx : ¬ Maximal A ) → (zc : ZChain A (cf nmx) (cf-is-≤-monotonic nmx) as0 (& A)) → ⊥ |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1429 z04 nmx zc = <-irr0 {* (cf nmx c)} {* c} (subst (λ k → odef A k ) (sym &iso) (proj1 (is-cf nmx (SUP.as sp1 )))) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1430 (subst (λ k → odef A (& k)) (sym *iso) (SUP.as sp1) ) |
935
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1431 (case1 ( cong (*)( fixpoint (cf nmx) (cf-is-≤-monotonic nmx ) zc |
ed711d7be191
mem exhaust fix on fixpoint
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
934
diff
changeset
|
1432 (sp0 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc ) ss<sa ))) -- x ≡ f x ̄ |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1433 (proj1 (cf-is-<-monotonic nmx c (SUP.as sp1 ))) where -- x < f x |
937 | 1434 |
927 | 1435 supf = ZChain.supf zc |
934 | 1436 msp1 : MinSUP A (ZChain.chain zc) |
1437 msp1 = msp0 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc | |
924
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1438 sp1 : SUP A (ZChain.chain zc) |
a48dc906796c
supf usp0 instead of supf (& A) ?
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
1439 sp1 = sp0 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc |
934 | 1440 c : Ordinal |
1441 c = & ( SUP.sup sp1 ) | |
1442 mc = MinSUP.sup msp1 | |
943 | 1443 mc<A : mc o< & A |
1444 mc<A = ∈∧P→o< ⟪ MinSUP.asm msp1 , lift true ⟫ | |
934 | 1445 c=mc : c ≡ mc |
1446 c=mc = &iso | |
1447 z20 : mc << cf nmx mc | |
1448 z20 = proj1 (cf-is-<-monotonic nmx mc (MinSUP.asm msp1) ) | |
1449 asc : odef A (supf mc) | |
928 | 1450 asc = ZChain.asupf zc |
1451 spd : MinSUP A (uchain (cf nmx) (cf-is-≤-monotonic nmx) asc ) | |
1452 spd = ysup (cf nmx) (cf-is-≤-monotonic nmx) asc | |
1453 d = MinSUP.sup spd | |
1454 d<A : d o< & A | |
1455 d<A = ∈∧P→o< ⟪ MinSUP.asm spd , lift true ⟫ | |
929 | 1456 msup : MinSUP A (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 supf d) |
1457 msup = ZChain.minsup zc (o<→≤ d<A) | |
928 | 1458 sd=ms : supf d ≡ MinSUP.sup ( ZChain.minsup zc (o<→≤ d<A) ) |
1459 sd=ms = ZChain.supf-is-minsup zc (o<→≤ d<A) | |
937 | 1460 |
943 | 1461 sc<<d : {mc : Ordinal } → (asc : odef A (supf mc)) → (spd : MinSUP A (uchain (cf nmx) (cf-is-≤-monotonic nmx) asc )) |
934 | 1462 → supf mc << MinSUP.sup spd |
943 | 1463 sc<<d {mc} asc spd = z25 where |
934 | 1464 d1 : Ordinal |
938 | 1465 d1 = MinSUP.sup spd -- supf d1 ≡ d |
934 | 1466 z24 : (supf mc ≡ d1) ∨ ( supf mc << d1 ) |
950 | 1467 z24 = MinSUP.x≤sup spd (init asc refl) |
939 | 1468 -- |
1469 -- f ( f .. ( supf mc ) <= d1 | |
1470 -- f d1 <= d1 | |
1471 -- | |
934 | 1472 z25 : supf mc << d1 |
1473 z25 with z24 | |
1474 ... | case2 lt = lt | |
938 | 1475 ... | case1 eq = ⊥-elim ( <-irr z29 (proj1 (cf-is-<-monotonic nmx d1 (MinSUP.asm spd)) ) ) where |
1476 -- supf mc ≡ d1 | |
939 | 1477 z32 : ((cf nmx (supf mc)) ≡ d1) ∨ ( (cf nmx (supf mc)) << d1 ) |
950 | 1478 z32 = MinSUP.x≤sup spd (fsuc _ (init asc refl)) |
938 | 1479 z29 : (* (cf nmx d1) ≡ * d1) ∨ (* (cf nmx d1) < * d1) |
939 | 1480 z29 with z32 |
1481 ... | case1 eq1 = case1 (cong (*) (trans (cong (cf nmx) (sym eq)) eq1) ) | |
1482 ... | case2 lt = case2 (subst (λ k → * k < * d1 ) (cong (cf nmx) eq) lt) | |
1483 | |
946 | 1484 fsc<<d : {mc z : Ordinal } → (asc : odef A (supf mc)) → (spd : MinSUP A (uchain (cf nmx) (cf-is-≤-monotonic nmx) asc )) |
1485 → (fc : FClosure A (cf nmx) (supf mc) z) → z << MinSUP.sup spd | |
1486 fsc<<d {mc} {z} asc spd fc = z25 where | |
1487 d1 : Ordinal | |
1488 d1 = MinSUP.sup spd -- supf d1 ≡ d | |
1489 z24 : (z ≡ d1) ∨ ( z << d1 ) | |
950 | 1490 z24 = MinSUP.x≤sup spd fc |
946 | 1491 -- |
1492 -- f ( f .. ( supf mc ) <= d1 | |
1493 -- f d1 <= d1 | |
1494 -- | |
1495 z25 : z << d1 | |
1496 z25 with z24 | |
1497 ... | case2 lt = lt | |
1498 ... | case1 eq = ⊥-elim ( <-irr z29 (proj1 (cf-is-<-monotonic nmx d1 (MinSUP.asm spd)) ) ) where | |
1499 -- supf mc ≡ d1 | |
1500 z32 : ((cf nmx z) ≡ d1) ∨ ( (cf nmx z) << d1 ) | |
950 | 1501 z32 = MinSUP.x≤sup spd (fsuc _ fc) |
946 | 1502 z29 : (* (cf nmx d1) ≡ * d1) ∨ (* (cf nmx d1) < * d1) |
1503 z29 with z32 | |
1504 ... | case1 eq1 = case1 (cong (*) (trans (cong (cf nmx) (sym eq)) eq1) ) | |
1505 ... | case2 lt = case2 (subst (λ k → * k < * d1 ) (cong (cf nmx) eq) lt) | |
1506 | |
943 | 1507 smc<<d : supf mc << d |
1508 smc<<d = sc<<d asc spd | |
1509 | |
1510 sz<<c : {z : Ordinal } → z o< & A → supf z <= mc | |
950 | 1511 sz<<c z<A = MinSUP.x≤sup msp1 (ZChain.csupf zc (z09 (ZChain.asupf zc) )) |
943 | 1512 |
1513 sc=c : supf mc ≡ mc | |
1514 sc=c = ZChain.sup=u zc (MinSUP.asm msp1) (o<→≤ (∈∧P→o< ⟪ MinSUP.asm msp1 , lift true ⟫ )) ⟪ is-sup , not-hasprev ⟫ where | |
1515 is-sup : IsSup A (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 (ZChain.supf zc) mc) (MinSUP.asm msp1) | |
954 | 1516 is-sup = record { x≤sup = λ zy → MinSUP.x≤sup msp1 (chain-mono (cf nmx) (cf-is-≤-monotonic nmx) as0 supf (ZChain.supf-mono zc) (o<→≤ mc<A) zy ) |
1517 ; minsup = ? } | |
943 | 1518 not-hasprev : ¬ HasPrev A (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 (ZChain.supf zc) mc) mc (cf nmx) |
952 | 1519 not-hasprev record { ax = ax ; y = y ; ay = ⟪ ua1 , ch-init fc ⟫ ; x=fy = x=fy } = ⊥-elim ( <-irr z31 z30 ) where |
1520 z30 : * mc < * (cf nmx mc) | |
1521 z30 = proj1 (cf-is-<-monotonic nmx mc (MinSUP.asm msp1)) | |
1522 z31 : ( * (cf nmx mc) ≡ * mc ) ∨ ( * (cf nmx mc) < * mc ) | |
1523 z31 = <=to≤ ( MinSUP.x≤sup msp1 (subst (λ k → odef (ZChain.chain zc) (cf nmx k)) (sym x=fy) | |
1524 ⟪ proj2 (cf-is-≤-monotonic nmx _ (proj2 (cf-is-≤-monotonic nmx _ ua1 ) )) , ch-init (fsuc _ (fsuc _ fc)) ⟫ )) | |
951 | 1525 not-hasprev record { ax = ax ; y = y ; ay = ⟪ ua1 , ch-is-sup u u<x is-sup1 fc ⟫; x=fy = x=fy } = ⊥-elim ( <-irr z48 z32 ) where |
943 | 1526 z30 : * mc < * (cf nmx mc) |
1527 z30 = proj1 (cf-is-<-monotonic nmx mc (MinSUP.asm msp1)) | |
951 | 1528 z31 : ( supf mc ≡ mc ) ∨ ( * (supf mc) < * mc ) |
1529 z31 = MinSUP.x≤sup msp1 (ZChain.csupf zc (z09 (ZChain.asupf zc) )) | |
1530 z32 : * (supf mc) < * (cf nmx (cf nmx y)) | |
1531 z32 = ftrans<=-< z31 (subst (λ k → * mc < * k ) (cong (cf nmx) x=fy) z30 ) | |
1532 z48 : ( * (cf nmx (cf nmx y)) ≡ * (supf mc)) ∨ (* (cf nmx (cf nmx y)) < * (supf mc) ) | |
1533 z48 = <=to≤ (ZChain1.order (SZ1 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc (& A)) mc<A u<x (fsuc _ ( fsuc _ fc ))) | |
943 | 1534 |
940
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1535 is-sup : IsSup A (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 (ZChain.supf zc) d) (MinSUP.asm spd) |
954 | 1536 is-sup = record { x≤sup = z22 ; minsup = ? } where |
952 | 1537 z23 : {z : Ordinal } → odef (uchain (cf nmx) (cf-is-≤-monotonic nmx) asc) z → (z ≡ MinSUP.sup spd) ∨ (z << MinSUP.sup spd) |
1538 z23 lt = MinSUP.x≤sup spd lt | |
1539 z22 : {y : Ordinal} → odef (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 (ZChain.supf zc) d) y → | |
940
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1540 (y ≡ MinSUP.sup spd) ∨ (y << MinSUP.sup spd) |
952 | 1541 z22 {a} ⟪ aa , ch-init fc ⟫ = case2 ( ( ftrans<=-< z32 ( sc<<d {mc} asc spd ) )) where |
1542 z32 : ( a ≡ supf mc ) ∨ ( * a < * (supf mc) ) | |
1543 z32 = ZChain.fcy<sup zc (o<→≤ mc<A) fc | |
1544 z22 {a} ⟪ aa , ch-is-sup u u<x is-sup1 fc ⟫ = tri u (supf mc) | |
1545 z60 z61 ( λ sc<u → ⊥-elim ( o≤> ( subst (λ k → k o≤ supf mc) (ChainP.supu=u is-sup1) z51) sc<u )) where | |
1546 z53 : supf u o< supf (& A) | |
1547 z53 = ordtrans<-≤ u<x (ZChain.supf-mono zc (o<→≤ d<A) ) | |
1548 z52 : ( u ≡ mc ) ∨ ( u << mc ) | |
1549 z52 = MinSUP.x≤sup msp1 ⟪ subst (λ k → odef A k ) (ChainP.supu=u is-sup1) (A∋fcs _ _ (cf-is-≤-monotonic nmx) fc) | |
1550 , ch-is-sup u z53 is-sup1 (init (ZChain.asupf zc) (ChainP.supu=u is-sup1)) ⟫ | |
1551 z56 : u ≡ mc → supf u ≡ supf mc | |
1552 z56 eq = cong supf eq | |
1553 z57 : u << mc → supf u o≤ supf mc | |
1554 z57 lt = ZChain.supf-<= zc (case2 z58) where | |
1555 z58 : supf u << supf mc -- supf u o< supf d -- supf u << supf d | |
1556 z58 = subst₂ ( λ j k → j << k ) (sym (ChainP.supu=u is-sup1)) (sym sc=c) lt | |
1557 z51 : supf u o≤ supf mc | |
1558 z51 = or z52 (λ le → o≤-refl0 (z56 le) ) z57 | |
1559 z60 : u o< supf mc → (a ≡ d ) ∨ ( * a < * d ) | |
1560 z60 u<smc = case2 ( ftrans<=-< (ZChain1.order (SZ1 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc (& A)) mc<A | |
1561 (subst (λ k → k o< supf mc) (sym (ChainP.supu=u is-sup1)) u<smc) fc ) smc<<d ) | |
1562 z61 : u ≡ supf mc → (a ≡ d ) ∨ ( * a < * d ) | |
1563 z61 u=sc = case2 (fsc<<d {mc} asc spd (subst (λ k → FClosure A (cf nmx) k a) (trans (ChainP.supu=u is-sup1) u=sc) fc ) ) | |
940
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1564 -- u<x : ZChain.supf zc u o< ZChain.supf zc d |
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1565 -- supf u o< spuf c → order |
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1566 |
947 | 1567 not-hasprev : ¬ HasPrev A (UnionCF A (cf nmx) (cf-is-≤-monotonic nmx) as0 supf d) d (cf nmx) |
952 | 1568 not-hasprev record { ax = ax ; y = y ; ay = ⟪ ua1 , ch-init fc ⟫ ; x=fy = x=fy } = ⊥-elim ( <-irr z31 z30 ) where |
1569 z30 : * d < * (cf nmx d) | |
1570 z30 = proj1 (cf-is-<-monotonic nmx d (MinSUP.asm spd)) | |
1571 z32 : ( cf nmx (cf nmx y) ≡ supf mc ) ∨ ( * (cf nmx (cf nmx y)) < * (supf mc) ) | |
1572 z32 = ZChain.fcy<sup zc (o<→≤ mc<A) (fsuc _ (fsuc _ fc)) | |
1573 z31 : ( * (cf nmx d) ≡ * d ) ∨ ( * (cf nmx d) < * d ) | |
1574 z31 = case2 ( subst (λ k → * (cf nmx k) < * d ) (sym x=fy) ( ftrans<=-< z32 ( sc<<d {mc} asc spd ) )) | |
948 | 1575 not-hasprev record { ax = ax ; y = y ; ay = ⟪ ua1 , ch-is-sup u u<x is-sup1 fc ⟫; x=fy = x=fy } = ⊥-elim ( <-irr z46 z30 ) where |
1576 z45 : (* (cf nmx (cf nmx y)) ≡ * d) ∨ (* (cf nmx (cf nmx y)) < * d) → (* (cf nmx d) ≡ * d) ∨ (* (cf nmx d) < * d) | |
1577 z45 p = subst (λ k → (* (cf nmx k) ≡ * d) ∨ (* (cf nmx k) < * d)) (sym x=fy) p | |
1578 z48 : supf mc << d | |
1579 z48 = sc<<d {mc} asc spd | |
949 | 1580 z53 : supf u o< supf (& A) |
1581 z53 = ordtrans<-≤ u<x (ZChain.supf-mono zc (o<→≤ d<A) ) | |
1582 z52 : ( u ≡ mc ) ∨ ( u << mc ) | |
950 | 1583 z52 = MinSUP.x≤sup msp1 ⟪ subst (λ k → odef A k ) (ChainP.supu=u is-sup1) (A∋fcs _ _ (cf-is-≤-monotonic nmx) fc) |
949 | 1584 , ch-is-sup u z53 is-sup1 (init (ZChain.asupf zc) (ChainP.supu=u is-sup1)) ⟫ |
1585 z51 : supf u o≤ supf mc | |
952 | 1586 z51 = or z52 (λ le → o≤-refl0 (z56 le) ) z57 where |
950 | 1587 z56 : u ≡ mc → supf u ≡ supf mc |
1588 z56 eq = cong supf eq | |
1589 z57 : u << mc → supf u o≤ supf mc | |
1590 z57 lt = ZChain.supf-<= zc (case2 z58) where | |
951 | 1591 z58 : supf u << supf mc -- supf u o< supf d -- supf u << supf d |
1592 z58 = subst₂ ( λ j k → j << k ) (sym (ChainP.supu=u is-sup1)) (sym sc=c) lt | |
949 | 1593 z49 : supf u o< supf mc → (cf nmx (cf nmx y) ≡ supf mc) ∨ (* (cf nmx (cf nmx y)) < * (supf mc) ) |
1594 z49 su<smc = ZChain1.order (SZ1 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc (& A)) mc<A su<smc (fsuc _ ( fsuc _ fc )) | |
1595 z50 : (cf nmx (cf nmx y) ≡ supf d) ∨ (* (cf nmx (cf nmx y)) < * (supf d) ) | |
1596 z50 = ZChain1.order (SZ1 (cf nmx) (cf-is-≤-monotonic nmx) as0 zc (& A)) d<A u<x (fsuc _ ( fsuc _ fc )) | |
948 | 1597 z47 : {mc d1 : Ordinal } {asc : odef A (supf mc)} (spd : MinSUP A (uchain (cf nmx) (cf-is-≤-monotonic nmx) asc )) |
951 | 1598 → (cf nmx (cf nmx y) ≡ supf mc) ∨ (* (cf nmx (cf nmx y)) < * (supf mc) ) → supf mc << d1 |
948 | 1599 → * (cf nmx (cf nmx y)) < * d1 |
950 | 1600 z47 {mc} {d1} {asc} spd (case1 eq) smc<d = subst (λ k → k < * d1 ) (sym (cong (*) eq)) smc<d |
1601 z47 {mc} {d1} {asc} spd (case2 lt) smc<d = IsStrictPartialOrder.trans PO lt smc<d | |
948 | 1602 z30 : * d < * (cf nmx d) |
1603 z30 = proj1 (cf-is-<-monotonic nmx d (MinSUP.asm spd)) | |
1604 z46 : (* (cf nmx d) ≡ * d) ∨ (* (cf nmx d) < * d) | |
952 | 1605 z46 = or (osuc-≡< z51) z55 z54 where |
950 | 1606 z55 : supf u ≡ supf mc → (* (cf nmx d) ≡ * d) ∨ (* (cf nmx d) < * d) |
1607 z55 eq = <=to≤ (MinSUP.x≤sup spd ( subst₂ (λ j k → FClosure A (cf nmx) j (cf nmx k) ) eq (sym x=fy ) (fsuc _ (fsuc _ fc)) ) ) | |
1608 z54 : supf u o< supf mc → (* (cf nmx d) ≡ * d) ∨ (* (cf nmx d) < * d) | |
1609 z54 lt = z45 (case2 (z47 {mc} {d} {asc} spd (z49 lt) z48 )) | |
1610 -- z46 with osuc-≡< z51 | |
1611 -- ... | case1 eq = MinSUP.x≤sup spd ( subst₂ (λ j k → FClosure A (cf nmx) j k ) (trans (ChainP.supu=u is-sup1) eq) refl fc ) | |
1612 -- ... | case2 lt = z45 (case2 (z47 {mc} {d} {asc} spd (z49 lt) z48 )) | |
948 | 1613 |
940
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1614 sd=d : supf d ≡ d |
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1615 sd=d = ZChain.sup=u zc (MinSUP.asm spd) (o<→≤ d<A) ⟪ is-sup , not-hasprev ⟫ |
aee83a7f9f57
not-hasprev z29 and z31 cause memory exhaust
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
939
diff
changeset
|
1616 |
934 | 1617 sc<sd : {mc d : Ordinal } → supf mc << supf d → supf mc o< supf d |
1618 sc<sd {mc} {d} sc<<sd with osuc-≡< ( ZChain.supf-<= zc (case2 sc<<sd ) ) | |
1619 ... | case1 eq = ⊥-elim ( <-irr (case1 (cong (*) (sym eq) )) sc<<sd ) | |
1620 ... | case2 lt = lt | |
1621 | |
1622 sms<sa : supf mc o< supf (& A) | |
1623 sms<sa with osuc-≡< ( ZChain.supf-mono zc (o<→≤ ( ∈∧P→o< ⟪ MinSUP.asm msp1 , lift true ⟫) )) | |
1624 ... | case2 lt = lt | |
943 | 1625 ... | case1 eq = ⊥-elim ( o<¬≡ eq ( ordtrans<-≤ (sc<sd (subst (λ k → supf mc << k ) (sym sd=d) (sc<<d {mc} asc spd)) ) |
934 | 1626 ( ZChain.supf-mono zc (o<→≤ d<A )))) |
928 | 1627 |
927 | 1628 ss<sa : supf c o< supf (& A) |
934 | 1629 ss<sa = subst (λ k → supf k o< supf (& A)) (sym c=mc) sms<sa |
1630 | |
551 | 1631 zorn00 : Maximal A |
1632 zorn00 with is-o∅ ( & HasMaximal ) -- we have no Level (suc n) LEM | |
804 | 1633 ... | no not = record { maximal = ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) ; as = zorn01 ; ¬maximal<x = zorn02 } where |
551 | 1634 -- yes we have the maximal |
1635 zorn03 : odef HasMaximal ( & ( ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) ) ) | |
606 | 1636 zorn03 = ODC.x∋minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) -- Axiom of choice |
551 | 1637 zorn01 : A ∋ ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) |
1638 zorn01 = proj1 zorn03 | |
1639 zorn02 : {x : HOD} → A ∋ x → ¬ (ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) < x) | |
1640 zorn02 {x} ax m<x = proj2 zorn03 (& x) ax (subst₂ (λ j k → j < k) (sym *iso) (sym *iso) m<x ) | |
927 | 1641 ... | yes ¬Maximal = ⊥-elim ( z04 nmx (SZ (cf nmx) (cf-is-≤-monotonic nmx) as0 (& A) )) where |
551 | 1642 -- if we have no maximal, make ZChain, which contradict SUP condition |
1643 nmx : ¬ Maximal A | |
1644 nmx mx = ∅< {HasMaximal} zc5 ( ≡o∅→=od∅ ¬Maximal ) where | |
1645 zc5 : odef A (& (Maximal.maximal mx)) ∧ (( y : Ordinal ) → odef A y → ¬ (* (& (Maximal.maximal mx)) < * y)) | |
804 | 1646 zc5 = ⟪ Maximal.as mx , (λ y ay mx<y → Maximal.¬maximal<x mx (subst (λ k → odef A k ) (sym &iso) ay) (subst (λ k → k < * y) *iso mx<y) ) ⟫ |
551 | 1647 |
516 | 1648 -- usage (see filter.agda ) |
1649 -- | |
497 | 1650 -- _⊆'_ : ( A B : HOD ) → Set n |
1651 -- _⊆'_ A B = (x : Ordinal ) → odef A x → odef B x | |
482 | 1652 |
497 | 1653 -- MaximumSubset : {L P : HOD} |
1654 -- → o∅ o< & L → o∅ o< & P → P ⊆ L | |
1655 -- → IsPartialOrderSet P _⊆'_ | |
1656 -- → ( (B : HOD) → B ⊆ P → IsTotalOrderSet B _⊆'_ → SUP P B _⊆'_ ) | |
1657 -- → Maximal P (_⊆'_) | |
1658 -- MaximumSubset {L} {P} 0<L 0<P P⊆L PO SP = Zorn-lemma {P} {_⊆'_} 0<P PO SP |