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