Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate src/zorn.agda @ 698:3837fa940cd9
...
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Tue, 12 Jul 2022 15:29:41 +0900 |
| parents | 96184d542e20 |
| children | 4df0b36db305 0278f0d151f2 |
| rev | line source |
|---|---|
| 478 | 1 {-# OPTIONS --allow-unsolved-metas #-} |
| 508 | 2 open import Level hiding ( suc ; zero ) |
| 431 | 3 open import Ordinals |
| 552 | 4 open import Relation.Binary |
| 5 open import Relation.Binary.Core | |
| 6 open import Relation.Binary.PropositionalEquality | |
| 497 | 7 import OD |
| 552 | 8 module zorn {n : Level } (O : Ordinals {n}) (_<_ : (x y : OD.HOD O ) → Set n ) (PO : IsStrictPartialOrder _≡_ _<_ ) where |
| 431 | 9 |
| 560 | 10 -- |
| 11 -- Zorn-lemma : { A : HOD } | |
| 12 -- → o∅ o< & A | |
| 13 -- → ( ( B : HOD) → (B⊆A : B ⊆ A) → IsTotalOrderSet B → SUP A B ) -- SUP condition | |
| 14 -- → Maximal A | |
| 15 -- | |
| 16 | |
| 431 | 17 open import zf |
| 477 | 18 open import logic |
| 19 -- open import partfunc {n} O | |
| 20 | |
| 21 open import Relation.Nullary | |
| 22 open import Data.Empty | |
| 23 import BAlgbra | |
| 431 | 24 |
| 555 | 25 open import Data.Nat hiding ( _<_ ; _≤_ ) |
| 26 open import Data.Nat.Properties | |
| 27 open import nat | |
| 28 | |
| 431 | 29 |
| 30 open inOrdinal O | |
| 31 open OD O | |
| 32 open OD.OD | |
| 33 open ODAxiom odAxiom | |
| 477 | 34 import OrdUtil |
| 35 import ODUtil | |
| 431 | 36 open Ordinals.Ordinals O |
| 37 open Ordinals.IsOrdinals isOrdinal | |
| 38 open Ordinals.IsNext isNext | |
| 39 open OrdUtil O | |
| 477 | 40 open ODUtil O |
| 41 | |
| 42 | |
| 43 import ODC | |
| 44 | |
| 45 | |
| 46 open _∧_ | |
| 47 open _∨_ | |
| 48 open Bool | |
| 431 | 49 |
| 50 | |
| 51 open HOD | |
| 52 | |
| 560 | 53 -- |
| 54 -- Partial Order on HOD ( possibly limited in A ) | |
| 55 -- | |
| 56 | |
| 571 | 57 _<<_ : (x y : Ordinal ) → Set n -- Set n order |
| 570 | 58 x << y = * x < * y |
| 59 | |
| 60 POO : IsStrictPartialOrder _≡_ _<<_ | |
| 61 POO = record { isEquivalence = record { refl = refl ; sym = sym ; trans = trans } | |
| 62 ; trans = IsStrictPartialOrder.trans PO | |
| 63 ; irrefl = λ x=y x<y → IsStrictPartialOrder.irrefl PO (cong (*) x=y) x<y | |
| 64 ; <-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 } } | |
| 65 | |
|
528
8facdd7cc65a
TransitiveClosure with x <= f x is possible
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
527
diff
changeset
|
66 _≤_ : (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
|
67 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
|
68 |
| 554 | 69 ≤-ftrans : {x y z : HOD} → x ≤ y → y ≤ z → x ≤ z |
| 70 ≤-ftrans {x} {y} {z} (case1 refl ) (case1 refl ) = case1 refl | |
| 71 ≤-ftrans {x} {y} {z} (case1 refl ) (case2 y<z) = case2 y<z | |
| 72 ≤-ftrans {x} {_} {z} (case2 x<y ) (case1 refl ) = case2 x<y | |
| 73 ≤-ftrans {x} {y} {z} (case2 x<y) (case2 y<z) = case2 ( IsStrictPartialOrder.trans PO x<y y<z ) | |
| 74 | |
| 556 | 75 <-irr : {a b : HOD} → (a ≡ b ) ∨ (a < b ) → b < a → ⊥ |
| 76 <-irr {a} {b} (case1 a=b) b<a = IsStrictPartialOrder.irrefl PO (sym a=b) b<a | |
| 77 <-irr {a} {b} (case2 a<b) b<a = IsStrictPartialOrder.irrefl PO refl | |
| 78 (IsStrictPartialOrder.trans PO b<a a<b) | |
| 490 | 79 |
| 561 | 80 ptrans = IsStrictPartialOrder.trans PO |
| 81 | |
| 492 | 82 open _==_ |
| 83 open _⊆_ | |
| 84 | |
| 530 | 85 -- |
| 560 | 86 -- Closure of ≤-monotonic function f has total order |
| 530 | 87 -- |
| 88 | |
| 89 ≤-monotonic-f : (A : HOD) → ( Ordinal → Ordinal ) → Set (Level.suc n) | |
| 90 ≤-monotonic-f A f = (x : Ordinal ) → odef A x → ( * x ≤ * (f x) ) ∧ odef A (f x ) | |
| 91 | |
| 551 | 92 data FClosure (A : HOD) (f : Ordinal → Ordinal ) (s : Ordinal) : Ordinal → Set n where |
| 600 | 93 init : odef A s → FClosure A f s s |
| 555 | 94 fsuc : (x : Ordinal) ( p : FClosure A f s x ) → FClosure A f s (f x) |
| 554 | 95 |
| 556 | 96 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 |
| 600 | 97 A∋fc {A} s f mf (init as) = as |
| 556 | 98 A∋fc {A} s f mf (fsuc y fcy) = proj2 (mf y ( A∋fc {A} s f mf fcy ) ) |
| 555 | 99 |
| 556 | 100 s≤fc : {A : HOD} (s : Ordinal ) {y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) → (fcy : FClosure A f s y ) → * s ≤ * y |
| 600 | 101 s≤fc {A} s {.s} f mf (init x) = case1 refl |
| 556 | 102 s≤fc {A} s {.(f x)} f mf (fsuc x fcy) with proj1 (mf x (A∋fc s f mf fcy ) ) |
| 103 ... | case1 x=fx = subst (λ k → * s ≤ * k ) (*≡*→≡ x=fx) ( s≤fc {A} s f mf fcy ) | |
| 104 ... | case2 x<fx with s≤fc {A} s f mf fcy | |
| 105 ... | case1 s≡x = case2 ( subst₂ (λ j k → j < k ) (sym s≡x) refl x<fx ) | |
| 106 ... | case2 s<x = case2 ( IsStrictPartialOrder.trans PO s<x x<fx ) | |
| 555 | 107 |
| 557 | 108 fcn : {A : HOD} (s : Ordinal) { x : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) → FClosure A f s x → ℕ |
| 600 | 109 fcn s mf (init as) = zero |
| 558 | 110 fcn {A} s {x} {f} mf (fsuc y p) with proj1 (mf y (A∋fc s f mf p)) |
| 111 ... | case1 eq = fcn s mf p | |
| 112 ... | case2 y<fy = suc (fcn s mf p ) | |
| 557 | 113 |
| 558 | 114 fcn-inject : {A : HOD} (s : Ordinal) { x y : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) |
| 115 → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → fcn s mf cx ≡ fcn s mf cy → * x ≡ * y | |
| 559 | 116 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 |
| 117 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 | |
| 600 | 118 fc00 zero zero refl (init _) (init x₁) i=x i=y = refl |
| 119 fc00 zero zero refl (init as) (fsuc y cy) i=x i=y with proj1 (mf y (A∋fc s f mf cy ) ) | |
| 120 ... | case1 y=fy = subst (λ k → * s ≡ k ) y=fy ( fc00 zero zero refl (init as) cy i=x i=y ) | |
| 121 fc00 zero zero refl (fsuc x cx) (init as) i=x i=y with proj1 (mf x (A∋fc s f mf cx ) ) | |
| 122 ... | case1 x=fx = subst (λ k → k ≡ * s ) x=fx ( fc00 zero zero refl cx (init as) i=x i=y ) | |
| 559 | 123 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 ) ) |
| 124 ... | 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 ) | |
| 125 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 ) ) | |
| 126 ... | 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 ) | |
| 127 ... | case1 x=fx | case2 y<fy = subst (λ k → k ≡ * (f y)) x=fx (fc02 x cx i=x) where | |
| 128 fc02 : (x1 : Ordinal) → (cx1 : FClosure A f s x1 ) → suc i ≡ fcn s mf cx1 → * x1 ≡ * (f y) | |
| 129 fc02 .(f x1) (fsuc x1 cx1) i=x1 with proj1 (mf x1 (A∋fc s f mf cx1 ) ) | |
| 560 | 130 ... | case1 eq = trans (sym eq) ( fc02 x1 cx1 i=x1 ) -- derefence while f x ≡ x |
| 559 | 131 ... | case2 lt = subst₂ (λ j k → * (f j) ≡ * (f k )) &iso &iso ( cong (λ k → * ( f (& k ))) fc04) where |
| 132 fc04 : * x1 ≡ * y | |
| 133 fc04 = fc00 i j (cong pred i=j) cx1 cy (cong pred i=x1) (cong pred j=y) | |
| 134 ... | case2 x<fx | case1 y=fy = subst (λ k → * (f x) ≡ k ) y=fy (fc03 y cy j=y) where | |
| 135 fc03 : (y1 : Ordinal) → (cy1 : FClosure A f s y1 ) → suc j ≡ fcn s mf cy1 → * (f x) ≡ * y1 | |
| 136 fc03 .(f y1) (fsuc y1 cy1) j=y1 with proj1 (mf y1 (A∋fc s f mf cy1 ) ) | |
| 137 ... | case1 eq = trans ( fc03 y1 cy1 j=y1 ) eq | |
| 138 ... | case2 lt = subst₂ (λ j k → * (f j) ≡ * (f k )) &iso &iso ( cong (λ k → * ( f (& k ))) fc05) where | |
| 139 fc05 : * x ≡ * y1 | |
| 140 fc05 = fc00 i j (cong pred i=j) cx cy1 (cong pred i=x) (cong pred j=y1) | |
| 141 ... | 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))) | |
| 557 | 142 |
| 600 | 143 |
| 557 | 144 fcn-< : {A : HOD} (s : Ordinal ) { x y : Ordinal} {f : Ordinal → Ordinal} → (mf : ≤-monotonic-f A f) |
| 145 → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → fcn s mf cx Data.Nat.< fcn s mf cy → * x < * y | |
| 558 | 146 fcn-< {A} s {x} {y} {f} mf cx cy x<y = fc01 (fcn s mf cy) cx cy refl x<y where |
| 147 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 | |
| 148 fc01 (suc i) {y} cx (fsuc y1 cy) i=y (s≤s x<i) with proj1 (mf y1 (A∋fc s f mf cy ) ) | |
| 149 ... | case1 y=fy = subst (λ k → * x < k ) y=fy ( fc01 (suc i) {y1} cx cy i=y (s≤s x<i) ) | |
| 150 ... | case2 y<fy with <-cmp (fcn s mf cx ) i | |
| 151 ... | tri> ¬a ¬b c = ⊥-elim ( nat-≤> x<i c ) | |
| 152 ... | tri≈ ¬a b ¬c = subst (λ k → k < * (f y1) ) (fcn-inject s mf cy cx (sym (trans b (cong pred i=y) ))) y<fy | |
| 153 ... | tri< a ¬b ¬c = IsStrictPartialOrder.trans PO fc02 y<fy where | |
| 154 fc03 : suc i ≡ suc (fcn s mf cy) → i ≡ fcn s mf cy | |
| 155 fc03 eq = cong pred eq | |
| 156 fc02 : * x < * y1 | |
| 157 fc02 = fc01 i cx cy (fc03 i=y ) a | |
| 557 | 158 |
| 559 | 159 fcn-cmp : {A : HOD} (s : Ordinal) { x y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) |
| 554 | 160 → (cx : FClosure A f s x) → (cy : FClosure A f s y ) → Tri (* x < * y) (* x ≡ * y) (* y < * x ) |
| 559 | 161 fcn-cmp {A} s {x} {y} f mf cx cy with <-cmp ( fcn s mf cx ) (fcn s mf cy ) |
| 162 ... | tri< a ¬b ¬c = tri< fc11 (λ eq → <-irr (case1 (sym eq)) fc11) (λ lt → <-irr (case2 fc11) lt) where | |
| 163 fc11 : * x < * y | |
| 164 fc11 = fcn-< {A} s {x} {y} {f} mf cx cy a | |
| 165 ... | tri≈ ¬a b ¬c = tri≈ (λ lt → <-irr (case1 (sym fc10)) lt) fc10 (λ lt → <-irr (case1 fc10) lt) where | |
| 166 fc10 : * x ≡ * y | |
| 167 fc10 = fcn-inject {A} s {x} {y} {f} mf cx cy b | |
| 168 ... | tri> ¬a ¬b c = tri> (λ lt → <-irr (case2 fc12) lt) (λ eq → <-irr (case1 eq) fc12) fc12 where | |
| 169 fc12 : * y < * x | |
| 170 fc12 = fcn-< {A} s {y} {x} {f} mf cy cx c | |
| 171 | |
| 600 | 172 |
| 562 | 173 fcn-imm : {A : HOD} (s : Ordinal) { x y : Ordinal } (f : Ordinal → Ordinal) (mf : ≤-monotonic-f A f) |
| 174 → (cx : FClosure A f s x) → (cy : FClosure A f s y ) → ¬ ( ( * x < * y ) ∧ ( * y < * (f x )) ) | |
| 563 | 175 fcn-imm {A} s {x} {y} f mf cx cy ⟪ x<y , y<fx ⟫ = fc21 where |
| 176 fc20 : fcn s mf cy Data.Nat.< suc (fcn s mf cx) → (fcn s mf cy ≡ fcn s mf cx) ∨ ( fcn s mf cy Data.Nat.< fcn s mf cx ) | |
| 177 fc20 y<sx with <-cmp ( fcn s mf cy ) (fcn s mf cx ) | |
| 178 ... | tri< a ¬b ¬c = case2 a | |
| 179 ... | tri≈ ¬a b ¬c = case1 b | |
| 180 ... | tri> ¬a ¬b c = ⊥-elim ( nat-≤> y<sx (s≤s c)) | |
| 181 fc17 : {x y : Ordinal } → (cx : FClosure A f s x) → (cy : FClosure A f s y ) → suc (fcn s mf cx) ≡ fcn s mf cy → * (f x ) ≡ * y | |
| 182 fc17 {x} {y} cx cy sx=y = fc18 (fcn s mf cy) cx cy refl sx=y where | |
| 183 fc18 : (i : ℕ ) → {y : Ordinal } → (cx : FClosure A f s x ) (cy : FClosure A f s y ) → (i ≡ fcn s mf cy ) → suc (fcn s mf cx) ≡ i → * (f x) ≡ * y | |
| 184 fc18 (suc i) {y} cx (fsuc y1 cy) i=y sx=i with proj1 (mf y1 (A∋fc s f mf cy ) ) | |
| 185 ... | case1 y=fy = subst (λ k → * (f x) ≡ k ) y=fy ( fc18 (suc i) {y1} cx cy i=y sx=i) -- dereference | |
| 186 ... | case2 y<fy = subst₂ (λ j k → * (f j) ≡ * (f k) ) &iso &iso (cong (λ k → * (f (& k) ) ) fc19) where | |
| 187 fc19 : * x ≡ * y1 | |
| 188 fc19 = fcn-inject s mf cx cy (cong pred ( trans sx=i i=y )) | |
| 189 fc21 : ⊥ | |
| 190 fc21 with <-cmp (suc ( fcn s mf cx )) (fcn s mf cy ) | |
| 191 ... | tri< a ¬b ¬c = <-irr (case2 y<fx) (fc22 a) where -- suc ncx < ncy | |
| 192 cxx : FClosure A f s (f x) | |
| 193 cxx = fsuc x cx | |
| 194 fc16 : (x : Ordinal ) → (cx : FClosure A f s x) → (fcn s mf cx ≡ fcn s mf (fsuc x cx)) ∨ ( suc (fcn s mf cx ) ≡ fcn s mf (fsuc x cx)) | |
| 600 | 195 fc16 x (init as) with proj1 (mf s as ) |
| 563 | 196 ... | case1 _ = case1 refl |
| 197 ... | case2 _ = case2 refl | |
| 198 fc16 .(f x) (fsuc x cx ) with proj1 (mf (f x) (A∋fc s f mf (fsuc x cx)) ) | |
| 199 ... | case1 _ = case1 refl | |
| 200 ... | case2 _ = case2 refl | |
| 201 fc22 : (suc ( fcn s mf cx )) Data.Nat.< (fcn s mf cy ) → * (f x) < * y | |
| 202 fc22 a with fc16 x cx | |
| 203 ... | case1 eq = fcn-< s mf cxx cy (subst (λ k → k Data.Nat.< fcn s mf cy ) eq (<-trans a<sa a)) | |
| 204 ... | case2 eq = fcn-< s mf cxx cy (subst (λ k → k Data.Nat.< fcn s mf cy ) eq a ) | |
| 205 ... | tri≈ ¬a b ¬c = <-irr (case1 (fc17 cx cy b)) y<fx | |
| 206 ... | tri> ¬a ¬b c with fc20 c -- ncy < suc ncx | |
| 207 ... | case1 y=x = <-irr (case1 ( fcn-inject s mf cy cx y=x )) x<y | |
| 208 ... | case2 y<x = <-irr (case2 x<y) (fcn-< s mf cy cx y<x ) | |
| 209 | |
| 560 | 210 -- open import Relation.Binary.Properties.Poset as Poset |
| 211 | |
| 212 IsTotalOrderSet : ( A : HOD ) → Set (Level.suc n) | |
| 213 IsTotalOrderSet A = {a b : HOD} → odef A (& a) → odef A (& b) → Tri (a < b) (a ≡ b) (b < a ) | |
| 214 | |
| 567 | 215 ⊆-IsTotalOrderSet : { A B : HOD } → B ⊆ A → IsTotalOrderSet A → IsTotalOrderSet B |
| 568 | 216 ⊆-IsTotalOrderSet {A} {B} B⊆A T ax ay = T (incl B⊆A ax) (incl B⊆A ay) |
| 567 | 217 |
| 568 | 218 _⊆'_ : ( A B : HOD ) → Set n |
| 219 _⊆'_ A B = {x : Ordinal } → odef A x → odef B x | |
| 560 | 220 |
| 221 -- | |
| 222 -- inductive maxmum tree from x | |
| 223 -- tree structure | |
| 224 -- | |
| 554 | 225 |
| 567 | 226 record HasPrev (A B : HOD) {x : Ordinal } (xa : odef A x) ( f : Ordinal → Ordinal ) : Set n where |
| 533 | 227 field |
| 534 | 228 y : Ordinal |
| 541 | 229 ay : odef B y |
| 534 | 230 x=fy : x ≡ f y |
| 529 | 231 |
| 570 | 232 record IsSup (A B : HOD) {x : Ordinal } (xa : odef A x) : Set n where |
| 654 | 233 field |
| 571 | 234 x<sup : {y : Ordinal} → odef B y → (y ≡ x ) ∨ (y << x ) |
| 568 | 235 |
| 656 | 236 record SUP ( A B : HOD ) : Set (Level.suc n) where |
| 237 field | |
| 238 sup : HOD | |
| 239 A∋maximal : A ∋ sup | |
| 240 x<sup : {x : HOD} → B ∋ x → (x ≡ sup ) ∨ (x < sup ) -- B is Total, use positive | |
| 241 | |
| 690 | 242 -- |
| 243 -- sup and its fclosure is in a chain HOD | |
| 244 -- chain HOD is sorted by sup as Ordinal and <-ordered | |
| 245 -- whole chain is a union of separated Chain | |
| 246 -- minimum index is y not ϕ | |
| 247 -- | |
| 248 | |
| 694 | 249 record ChainP (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal) (sup z : Ordinal) : Set n where |
| 690 | 250 field |
| 695 | 251 y-init : supf o∅ ≡ y |
| 252 asup : (x : Ordinal) → odef A (supf x) | |
| 694 | 253 fcy<sup : {z : Ordinal } → FClosure A f y z → z << supf sup |
| 695 | 254 csupz : FClosure A f (supf sup) z |
| 255 order : {sup1 z1 : Ordinal} → (lt : sup1 o< sup ) → FClosure A f (supf sup1 ) z1 → z1 << supf sup | |
| 694 | 256 |
| 257 data Chain (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal) : Ordinal → Ordinal → Set n where | |
| 258 ch-init : (z : Ordinal) → FClosure A f y z → Chain A f mf ay supf y z | |
| 259 ch-is-sup : {sup z : Ordinal } | |
| 260 → ( is-sup : ChainP A f mf ay supf sup z) | |
| 261 → ( fc : FClosure A f (supf sup) z ) → Chain A f mf ay supf sup z | |
| 262 | |
| 263 -- Union of supf z which o< x | |
| 264 -- | |
| 690 | 265 |
| 694 | 266 record UChain ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } (ay : odef A y ) |
| 267 (supf : Ordinal → Ordinal) (x : Ordinal) (z : Ordinal) : Set n where | |
| 268 field | |
| 269 u : Ordinal | |
| 270 u<x : u o< x | |
| 271 chain∋z : Chain A f mf ay supf u z | |
| 272 | |
| 273 ∈∧P→o< : {A : HOD } {y : Ordinal} → {P : Set n} → odef A y ∧ P → y o< & A | |
| 274 ∈∧P→o< {A } {y} p = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) (proj1 p ))) | |
| 275 | |
| 276 UnionCF : ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } (ay : odef A y ) | |
| 277 ( supf : Ordinal → Ordinal ) ( x : Ordinal ) → HOD | |
| 278 UnionCF A f mf ay supf x | |
| 279 = 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 | 280 |
| 664 | 281 record ZChain1 ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal } (ay : odef A y ) ( z : Ordinal ) : Set (Level.suc n) where |
| 655 | 282 field |
| 694 | 283 supf : Ordinal → Ordinal |
| 695 | 284 -- is-chain : {w : Ordinal } → Chain A f mf ay supf z w |
| 285 -- supf-mono : (x y : Ordinal ) → x o≤ y → supf x o≤ supf y | |
| 673 | 286 |
| 674 | 287 record ZChain ( A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {init : Ordinal} (ay : odef A init) |
| 288 (zc0 : (x : Ordinal) → ZChain1 A f mf ay x ) ( z : Ordinal ) : Set (Level.suc n) where | |
|
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
289 chain : HOD |
| 694 | 290 chain = UnionCF A f mf ay (ZChain1.supf (zc0 (& A))) (& A) |
| 568 | 291 field |
| 292 chain⊆A : chain ⊆' A | |
| 653 | 293 chain∋init : odef chain init |
| 294 initial : {y : Ordinal } → odef chain y → * init ≤ * y | |
| 568 | 295 f-next : {a : Ordinal } → odef chain a → odef chain (f a) |
| 654 | 296 f-total : IsTotalOrderSet chain |
| 568 | 297 is-max : {a b : Ordinal } → (ca : odef chain a ) → b o< osuc z → (ab : odef A b) |
| 574 | 298 → HasPrev A chain ab f ∨ IsSup A chain ab |
| 568 | 299 → * a < * b → odef chain b |
| 653 | 300 |
| 568 | 301 record Maximal ( A : HOD ) : Set (Level.suc n) where |
| 302 field | |
| 303 maximal : HOD | |
| 304 A∋maximal : A ∋ maximal | |
| 305 ¬maximal<x : {x : HOD} → A ∋ x → ¬ maximal < x -- A is Partial, use negative | |
| 567 | 306 |
|
684
822fce8af579
no transfinite on data Chain trichotomos
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
683
diff
changeset
|
307 -- data Chain (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) : Ordinal → Ordinal → Set n where |
|
822fce8af579
no transfinite on data Chain trichotomos
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
683
diff
changeset
|
308 -- |
|
822fce8af579
no transfinite on data Chain trichotomos
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
683
diff
changeset
|
309 -- data Chain is total |
|
822fce8af579
no transfinite on data Chain trichotomos
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
683
diff
changeset
|
310 |
| 694 | 311 chain-total : (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal ) |
| 312 {s s1 a b : Ordinal } ( ca : Chain A f mf ay supf s a ) ( cb : Chain A f mf ay supf s1 b ) → Tri (* a < * b) (* a ≡ * b) (* b < * a ) | |
| 313 chain-total A f mf {y} ay supf {xa} {xb} {a} {b} ca cb = ct-ind xa xb ca cb where | |
| 314 ct-ind : (xa xb : Ordinal) → {a b : Ordinal} → Chain A f mf ay supf xa a → Chain A f mf ay supf xb b → Tri (* a < * b) (* a ≡ * b) (* b < * a) | |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
315 ct-ind xa xb {a} {b} (ch-init a fca) (ch-init b fcb) = fcn-cmp y f mf fca fcb |
| 690 | 316 ct-ind xa xb {a} {b} (ch-init a fca) (ch-is-sup supb fcb) = tri< ct01 (λ eq → <-irr (case1 (sym eq)) ct01) (λ lt → <-irr (case2 ct01) lt) where |
| 695 | 317 ct00 : * a < * (supf xb) |
| 318 ct00 = ChainP.fcy<sup supb fca | |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
319 ct01 : * a < * b |
| 695 | 320 ct01 with s≤fc (supf xb) f mf fcb |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
321 ... | case1 eq = subst (λ k → * a < k ) eq ct00 |
|
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
322 ... | case2 lt = IsStrictPartialOrder.trans POO ct00 lt |
| 690 | 323 ct-ind xa xb {a} {b} (ch-is-sup supa fca) (ch-init b fcb)= tri> (λ lt → <-irr (case2 ct01) lt) (λ eq → <-irr (case1 eq) ct01) ct01 where |
| 695 | 324 ct00 : * b < * (supf xa) |
| 325 ct00 = ChainP.fcy<sup supa fcb | |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
326 ct01 : * b < * a |
| 695 | 327 ct01 with s≤fc (supf xa) f mf fca |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
328 ... | case1 eq = subst (λ k → * b < k ) eq ct00 |
|
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
329 ... | case2 lt = IsStrictPartialOrder.trans POO ct00 lt |
| 690 | 330 ct-ind xa xb {a} {b} (ch-is-sup supa fca) (ch-is-sup supb fcb) with trio< xa xb |
| 685 | 331 ... | tri< a₁ ¬b ¬c = tri< ct02 (λ eq → <-irr (case1 (sym eq)) ct02) (λ lt → <-irr (case2 ct02) lt) where |
| 695 | 332 ct03 : * a < * (supf xb) |
| 333 ct03 = ChainP.order supb a₁ (ChainP.csupz supa) | |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
334 ct02 : * a < * b |
| 695 | 335 ct02 with s≤fc (supf xb) f mf fcb |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
336 ... | case1 eq = subst (λ k → * a < k ) eq ct03 |
|
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
337 ... | case2 lt = IsStrictPartialOrder.trans POO ct03 lt |
| 695 | 338 ... | tri≈ ¬a refl ¬c = fcn-cmp (supf xa) f mf fca fcb |
| 685 | 339 ... | tri> ¬a ¬b c = tri> (λ lt → <-irr (case2 ct04) lt) (λ eq → <-irr (case1 (eq)) ct04) ct04 where |
| 695 | 340 ct05 : * b < * (supf xa) |
| 341 ct05 = ChainP.order supa c (ChainP.csupz supb) | |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
342 ct04 : * b < * a |
| 695 | 343 ct04 with s≤fc (supf xa) f mf fca |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
344 ... | case1 eq = subst (λ k → * b < k ) eq ct05 |
|
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
345 ... | case2 lt = IsStrictPartialOrder.trans POO ct05 lt |
|
684
822fce8af579
no transfinite on data Chain trichotomos
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
683
diff
changeset
|
346 |
| 698 | 347 ChainP-next : (A : HOD ) ( f : Ordinal → Ordinal ) (mf : ≤-monotonic-f A f) {y : Ordinal} (ay : odef A y) (supf : Ordinal → Ordinal ) |
| 348 → {x z : Ordinal } → ChainP A f mf ay supf x z → ChainP A f mf ay supf x (f z ) | |
| 349 ChainP-next A f mf {y} ay supf {x} {z} cp = record { y-init = ChainP.y-init cp ; asup = ChainP.asup cp | |
| 350 ; fcy<sup = ChainP.fcy<sup cp ; csupz = fsuc _ (ChainP.csupz cp) ; order = ChainP.order cp } | |
| 351 | |
| 497 | 352 Zorn-lemma : { A : HOD } |
| 464 | 353 → o∅ o< & A |
| 568 | 354 → ( ( B : HOD) → (B⊆A : B ⊆' A) → IsTotalOrderSet B → SUP A B ) -- SUP condition |
| 497 | 355 → Maximal A |
| 552 | 356 Zorn-lemma {A} 0<A supP = zorn00 where |
| 571 | 357 <-irr0 : {a b : HOD} → A ∋ a → A ∋ b → (a ≡ b ) ∨ (a < b ) → b < a → ⊥ |
| 358 <-irr0 {a} {b} A∋a A∋b = <-irr | |
| 537 | 359 z07 : {y : Ordinal} → {P : Set n} → odef A y ∧ P → y o< & A |
| 360 z07 {y} p = subst (λ k → k o< & A) &iso ( c<→o< (subst (λ k → odef A k ) (sym &iso ) (proj1 p ))) | |
| 530 | 361 s : HOD |
| 362 s = ODC.minimal O A (λ eq → ¬x<0 ( subst (λ k → o∅ o< k ) (=od∅→≡o∅ eq) 0<A )) | |
| 568 | 363 as : A ∋ * ( & s ) |
| 364 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
|
365 as0 : odef A (& s ) |
|
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
366 as0 = subst (λ k → odef A k ) &iso as |
| 547 | 367 s<A : & s o< & A |
| 568 | 368 s<A = c<→o< (subst (λ k → odef A (& k) ) *iso as ) |
| 530 | 369 HasMaximal : HOD |
| 537 | 370 HasMaximal = record { od = record { def = λ x → odef A x ∧ ( (m : Ordinal) → odef A m → ¬ (* x < * m)) } ; odmax = & A ; <odmax = z07 } |
| 371 no-maximum : HasMaximal =h= od∅ → (x : Ordinal) → odef A x ∧ ((m : Ordinal) → odef A m → odef A x ∧ (¬ (* x < * m) )) → ⊥ | |
| 372 no-maximum nomx x P = ¬x<0 (eq→ nomx {x} ⟪ proj1 P , (λ m ma p → proj2 ( proj2 P m ma ) p ) ⟫ ) | |
| 532 | 373 Gtx : { x : HOD} → A ∋ x → HOD |
| 537 | 374 Gtx {x} ax = record { od = record { def = λ y → odef A y ∧ (x < (* y)) } ; odmax = & A ; <odmax = z07 } |
| 375 z08 : ¬ Maximal A → HasMaximal =h= od∅ | |
| 376 z08 nmx = record { eq→ = λ {x} lt → ⊥-elim ( nmx record {maximal = * x ; A∋maximal = subst (λ k → odef A k) (sym &iso) (proj1 lt) | |
| 377 ; ¬maximal<x = λ {y} ay → subst (λ k → ¬ (* x < k)) *iso (proj2 lt (& y) ay) } ) ; eq← = λ {y} lt → ⊥-elim ( ¬x<0 lt )} | |
| 378 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)) | |
| 379 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 | |
| 380 ¬x<m : ¬ (* x < * m) | |
| 381 ¬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 | 382 |
| 560 | 383 -- Uncountable ascending chain by axiom of choice |
| 530 | 384 cf : ¬ Maximal A → Ordinal → Ordinal |
| 532 | 385 cf nmx x with ODC.∋-p O A (* x) |
| 386 ... | no _ = o∅ | |
| 387 ... | yes ax with is-o∅ (& ( Gtx ax )) | |
| 538 | 388 ... | yes nogt = -- no larger element, so it is maximal |
| 389 ⊥-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 | 390 ... | no not = & (ODC.minimal O (Gtx ax) (λ eq → not (=od∅→≡o∅ eq))) |
| 537 | 391 is-cf : (nmx : ¬ Maximal A ) → {x : Ordinal} → odef A x → odef A (cf nmx x) ∧ ( * x < * (cf nmx x) ) |
| 392 is-cf nmx {x} ax with ODC.∋-p O A (* x) | |
| 393 ... | no not = ⊥-elim ( not (subst (λ k → odef A k ) (sym &iso) ax )) | |
| 394 ... | yes ax with is-o∅ (& ( Gtx ax )) | |
| 395 ... | 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 ⟫ ) | |
| 396 ... | no not = ODC.x∋minimal O (Gtx ax) (λ eq → not (=od∅→≡o∅ eq)) | |
| 606 | 397 |
| 398 --- | |
| 399 --- infintie ascention sequence of f | |
| 400 --- | |
| 530 | 401 cf-is-<-monotonic : (nmx : ¬ Maximal A ) → (x : Ordinal) → odef A x → ( * x < * (cf nmx x) ) ∧ odef A (cf nmx x ) |
| 537 | 402 cf-is-<-monotonic nmx x ax = ⟪ proj2 (is-cf nmx ax ) , proj1 (is-cf nmx ax ) ⟫ |
| 530 | 403 cf-is-≤-monotonic : (nmx : ¬ Maximal A ) → ≤-monotonic-f A ( cf nmx ) |
| 532 | 404 cf-is-≤-monotonic nmx x ax = ⟪ case2 (proj1 ( cf-is-<-monotonic nmx x ax )) , proj2 ( cf-is-<-monotonic nmx x ax ) ⟫ |
| 543 | 405 |
| 674 | 406 sp0 : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) (zc0 : (x : Ordinal) → ZChain1 A f mf as0 x ) (zc : ZChain A f mf as0 zc0 (& A) ) |
| 653 | 407 (total : IsTotalOrderSet (ZChain.chain zc) ) → SUP A (ZChain.chain zc) |
| 408 sp0 f mf zc0 zc total = supP (ZChain.chain zc) (ZChain.chain⊆A zc) total | |
| 543 | 409 zc< : {x y z : Ordinal} → {P : Set n} → (x o< y → P) → x o< z → z o< y → P |
| 410 zc< {x} {y} {z} {P} prev x<z z<y = prev (ordtrans x<z z<y) | |
| 411 | |
| 412 --- | |
| 560 | 413 --- the maximum chain has fix point of any ≤-monotonic function |
| 543 | 414 --- |
| 674 | 415 fixpoint : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) (zc0 : (x : Ordinal) → ZChain1 A f mf as0 x) (zc : ZChain A f mf as0 zc0 (& A) ) |
|
633
6cd4a483122c
ZChain1 is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
631
diff
changeset
|
416 → (total : IsTotalOrderSet (ZChain.chain zc) ) |
| 653 | 417 → f (& (SUP.sup (sp0 f mf zc0 zc total ))) ≡ & (SUP.sup (sp0 f mf zc0 zc total)) |
| 418 fixpoint f mf zc0 zc total = z14 where | |
| 538 | 419 chain = ZChain.chain zc |
| 653 | 420 sp1 = sp0 f mf zc0 zc total |
| 565 | 421 z10 : {a b : Ordinal } → (ca : odef chain a ) → b o< osuc (& A) → (ab : odef A b ) |
| 570 | 422 → HasPrev A chain ab f ∨ IsSup A chain {b} ab -- (supO chain (ZChain.chain⊆A zc) (ZChain.f-total zc) ≡ b ) |
| 538 | 423 → * a < * b → odef chain b |
| 424 z10 = ZChain.is-max zc | |
| 543 | 425 z11 : & (SUP.sup sp1) o< & A |
| 426 z11 = c<→o< ( SUP.A∋maximal sp1) | |
| 538 | 427 z12 : odef chain (& (SUP.sup sp1)) |
| 428 z12 with o≡? (& s) (& (SUP.sup sp1)) | |
| 653 | 429 ... | yes eq = subst (λ k → odef chain k) eq ( ZChain.chain∋init zc ) |
| 430 ... | no ne = z10 {& s} {& (SUP.sup sp1)} ( ZChain.chain∋init zc ) (ordtrans z11 <-osuc ) (SUP.A∋maximal sp1) | |
| 570 | 431 (case2 z19 ) z13 where |
| 538 | 432 z13 : * (& s) < * (& (SUP.sup sp1)) |
| 653 | 433 z13 with SUP.x<sup sp1 ( ZChain.chain∋init zc ) |
| 538 | 434 ... | case1 eq = ⊥-elim ( ne (cong (&) eq) ) |
| 435 ... | case2 lt = subst₂ (λ j k → j < k ) (sym *iso) (sym *iso) lt | |
| 570 | 436 z19 : IsSup A chain {& (SUP.sup sp1)} (SUP.A∋maximal sp1) |
| 571 | 437 z19 = record { x<sup = z20 } where |
| 438 z20 : {y : Ordinal} → odef chain y → (y ≡ & (SUP.sup sp1)) ∨ (y << & (SUP.sup sp1)) | |
| 439 z20 {y} zy with SUP.x<sup sp1 (subst (λ k → odef chain k ) (sym &iso) zy) | |
| 570 | 440 ... | case1 y=p = case1 (subst (λ k → k ≡ _ ) &iso ( cong (&) y=p )) |
| 441 ... | case2 y<p = case2 (subst (λ k → * y < k ) (sym *iso) y<p ) | |
| 442 -- λ {y} zy → subst (λ k → (y ≡ & k ) ∨ (y << & k)) ? (SUP.x<sup sp1 ? ) } | |
| 653 | 443 z14 : f (& (SUP.sup (sp0 f mf zc0 zc total ))) ≡ & (SUP.sup (sp0 f mf zc0 zc total )) |
|
633
6cd4a483122c
ZChain1 is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
631
diff
changeset
|
444 z14 with total (subst (λ k → odef chain k) (sym &iso) (ZChain.f-next zc z12 )) z12 |
| 631 | 445 ... | tri< a ¬b ¬c = ⊥-elim z16 where |
| 446 z16 : ⊥ | |
| 447 z16 with proj1 (mf (& ( SUP.sup sp1)) ( SUP.A∋maximal sp1 )) | |
| 448 ... | case1 eq = ⊥-elim (¬b (subst₂ (λ j k → j ≡ k ) refl *iso (sym eq) )) | |
| 449 ... | case2 lt = ⊥-elim (¬c (subst₂ (λ j k → k < j ) refl *iso lt )) | |
| 450 ... | tri≈ ¬a b ¬c = subst ( λ k → k ≡ & (SUP.sup sp1) ) &iso ( cong (&) b ) | |
| 451 ... | tri> ¬a ¬b c = ⊥-elim z17 where | |
| 452 z15 : (* (f ( & ( SUP.sup sp1 ))) ≡ SUP.sup sp1) ∨ (* (f ( & ( SUP.sup sp1 ))) < SUP.sup sp1) | |
| 453 z15 = SUP.x<sup sp1 (subst (λ k → odef chain k ) (sym &iso) (ZChain.f-next zc z12 )) | |
| 454 z17 : ⊥ | |
| 455 z17 with z15 | |
| 456 ... | case1 eq = ¬b eq | |
| 457 ... | case2 lt = ¬a lt | |
| 560 | 458 |
| 459 -- ZChain contradicts ¬ Maximal | |
| 460 -- | |
| 571 | 461 -- ZChain forces fix point on any ≤-monotonic function (fixpoint) |
| 560 | 462 -- ¬ Maximal create cf which is a <-monotonic function by axiom of choice. This contradicts fix point of ZChain |
| 463 -- | |
| 697 | 464 z04 : (nmx : ¬ Maximal A ) |
| 465 → (zc0 : (x : Ordinal) → ZChain1 A (cf nmx) (cf-is-≤-monotonic nmx) as0 x) | |
| 466 → (zc : ZChain A (cf nmx) (cf-is-≤-monotonic nmx) as0 zc0 (& A)) | |
| 664 | 467 → IsTotalOrderSet (ZChain.chain zc) → ⊥ |
| 653 | 468 z04 nmx zc0 zc total = <-irr0 {* (cf nmx c)} {* c} (subst (λ k → odef A k ) (sym &iso) (proj1 (is-cf nmx (SUP.A∋maximal sp1 )))) |
| 571 | 469 (subst (λ k → odef A (& k)) (sym *iso) (SUP.A∋maximal sp1) ) |
| 653 | 470 (case1 ( cong (*)( fixpoint (cf nmx) (cf-is-≤-monotonic nmx ) zc0 zc total ))) -- x ≡ f x ̄ |
|
633
6cd4a483122c
ZChain1 is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
631
diff
changeset
|
471 (proj1 (cf-is-<-monotonic nmx c (SUP.A∋maximal sp1 ))) where -- x < f x |
|
6cd4a483122c
ZChain1 is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
631
diff
changeset
|
472 sp1 : SUP A (ZChain.chain zc) |
| 653 | 473 sp1 = sp0 (cf nmx) (cf-is-≤-monotonic nmx) zc0 zc total |
| 538 | 474 c = & (SUP.sup sp1) |
| 548 | 475 |
| 560 | 476 -- |
| 547 | 477 -- create all ZChains under o< x |
| 560 | 478 -- |
|
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
479 |
| 630 | 480 sind : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) → (x : Ordinal) |
| 664 | 481 → ((z : Ordinal) → z o< x → ZChain1 A f mf ay z ) → ZChain1 A f mf ay x |
| 695 | 482 sind f mf {y} ay x prev with trio< o∅ x |
| 483 ... | tri> ¬a ¬b c = ⊥-elim (¬x<0 c ) | |
| 484 ... | tri≈ ¬a b ¬c = record { supf = λ _ → y } | |
| 485 ... | tri< 0<x ¬b ¬c with Oprev-p x | |
| 630 | 486 ... | yes op = sc4 where |
| 654 | 487 open ZChain1 |
| 630 | 488 px = Oprev.oprev op |
| 656 | 489 px<x : px o< x |
| 490 px<x = subst (λ k → px o< k) (Oprev.oprev=x op) <-osuc | |
| 664 | 491 sc : ZChain1 A f mf ay px |
| 656 | 492 sc = prev px px<x |
| 675 | 493 pchain : HOD |
| 695 | 494 pchain = UnionCF A f mf ay (ZChain1.supf sc) x |
| 675 | 495 |
| 683 | 496 no-ext : ZChain1 A f mf ay x |
| 695 | 497 no-ext = record { supf = ZChain1.supf sc } |
| 664 | 498 sc4 : ZChain1 A f mf ay x |
| 681 | 499 sc4 with ODC.∋-p O A (* x) |
| 683 | 500 ... | no noax = no-ext |
| 675 | 501 ... | yes ax with ODC.p∨¬p O ( HasPrev A pchain ax f ) |
| 683 | 502 ... | case1 pr = no-ext |
| 675 | 503 ... | case2 ¬fy<x with ODC.p∨¬p O (IsSup A pchain ax ) |
| 695 | 504 ... | case1 is-sup = record { supf = psup1 } where |
| 505 psup1 : Ordinal → Ordinal | |
| 506 psup1 z with trio< z x | |
| 507 ... | tri< a ¬b ¬c = ZChain1.supf sc z | |
| 508 ... | tri≈ ¬a b ¬c = x | |
| 509 ... | tri> ¬a ¬b c = x | |
| 683 | 510 ... | case2 ¬x=sup = no-ext |
| 664 | 511 ... | no ¬ox = sc4 where |
| 683 | 512 pzc : (z : Ordinal) → z o< x → ZChain1 A f mf ay z |
| 513 pzc z z<x = prev z z<x | |
| 695 | 514 psupf : (z : Ordinal) → Ordinal |
| 515 psupf z with trio< z x | |
| 516 ... | tri< a ¬b ¬c = ZChain1.supf (pzc z a) z | |
| 517 ... | tri≈ ¬a b ¬c = o∅ | |
| 518 ... | tri> ¬a ¬b c = o∅ | |
| 681 | 519 UZ : HOD |
| 695 | 520 UZ = UnionCF A f mf ay psupf x |
| 686 | 521 total-UZ : IsTotalOrderSet UZ |
| 522 total-UZ {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where | |
| 523 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
| 695 | 524 uz01 = chain-total A f mf ay psupf (UChain.chain∋z (proj2 ca)) (UChain.chain∋z (proj2 cb)) |
| 683 | 525 usup : SUP A UZ |
| 686 | 526 usup = supP UZ (λ lt → proj1 lt) total-UZ |
| 687 | 527 spu = & (SUP.sup usup) |
| 683 | 528 sc4 : ZChain1 A f mf ay x |
| 695 | 529 sc4 = record { supf = psup1 } where |
| 683 | 530 psup1 : Ordinal → Ordinal |
| 695 | 531 psup1 z with trio< z x |
| 532 ... | tri< a ¬b ¬c = ZChain1.supf (pzc z a) z | |
| 533 ... | tri≈ ¬a b ¬c = spu | |
| 534 ... | tri> ¬a ¬b c = spu | |
| 630 | 535 |
| 674 | 536 ind : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) {y : Ordinal} (ay : odef A y) → (x : Ordinal) |
| 537 → (zc0 : (x : Ordinal) → ZChain1 A f mf ay x) | |
| 664 | 538 → ((z : Ordinal) → z o< x → ZChain A f mf ay zc0 z) → ZChain A f mf ay zc0 x |
| 695 | 539 ind f mf {y} ay x zc0 prev with trio< o∅ x |
| 540 ... | tri> ¬a ¬b c = ⊥-elim (¬x<0 c ) | |
| 696 | 541 ... | tri≈ ¬a refl ¬c = record { initial = initial1 } where |
| 542 initial1 : {z : Ordinal} → odef (UnionCF A f mf ay (ZChain1.supf (zc0 (& A))) (& A)) z → * y ≤ * z | |
| 543 initial1 {z} uz = ? where | |
| 544 zc01 : odef A z ∧ UChain A f mf ay (ZChain1.supf (zc0 (& A))) (& A) z | |
| 545 zc01 = uz | |
| 695 | 546 ... | tri< 0<x ¬b ¬c with Oprev-p x |
| 697 | 547 ... | yes op = zc4 where |
| 682 | 548 -- |
| 549 -- we have previous ordinal to use induction | |
| 550 -- | |
| 551 px = Oprev.oprev op | |
| 552 zc : ZChain A f mf ay zc0 (Oprev.oprev op) | |
| 553 zc = prev px (subst (λ k → px o< k) (Oprev.oprev=x op) <-osuc ) | |
| 554 px<x : px o< x | |
| 555 px<x = subst (λ k → px o< k) (Oprev.oprev=x op) <-osuc | |
| 697 | 556 zc0-b<x : (b : Ordinal ) → b o< x → b o< osuc px |
| 557 zc0-b<x b lt = subst (λ k → b o< k ) (sym (Oprev.oprev=x op)) lt | |
| 558 | |
| 611 | 559 -- if previous chain satisfies maximality, we caan reuse it |
| 560 -- | |
| 696 | 561 no-extenion : ( {a b z : Ordinal} → (z<x : z o< x) → odef (ZChain.chain zc) a → b o< osuc x → (ab : odef A b) → |
| 562 HasPrev A (ZChain.chain zc ) ab f ∨ IsSup A (ZChain.chain zc ) ab → | |
| 682 | 563 * a < * b → odef (ZChain.chain zc ) b ) → ZChain A f mf ay zc0 x |
| 696 | 564 no-extenion is-max = record { initial = ZChain.initial zc ; chain∋init = ZChain.chain∋init zc } |
| 610 | 565 |
| 664 | 566 zc4 : ZChain A f mf ay zc0 x |
| 697 | 567 zc4 with ODC.∋-p O A (* x) |
| 626 | 568 ... | no noax = no-extenion zc1 where -- ¬ A ∋ p, just skip |
| 682 | 569 zc1 : {a b z : Ordinal} → (z<x : z o< x) → odef (ZChain.chain zc ) a → b o< osuc x → (ab : odef A b) → |
| 570 HasPrev A (ZChain.chain zc ) ab f ∨ IsSup A (ZChain.chain zc ) ab → | |
| 571 * a < * b → odef (ZChain.chain zc ) b | |
| 675 | 572 zc1 {a} {b} z<x za b<ox ab P a<b with osuc-≡< b<ox |
| 568 | 573 ... | case1 eq = ⊥-elim ( noax (subst (λ k → odef A k) (trans eq (sym &iso)) ab ) ) |
| 697 | 574 ... | case2 lt = ZChain.is-max zc za (subst (λ k → b o< k) (sym (Oprev.oprev=x op)) lt ) ab P a<b |
| 682 | 575 ... | yes ax with ODC.p∨¬p O ( HasPrev A (ZChain.chain zc ) ax f ) |
| 674 | 576 -- we have to check adding x preserve is-max ZChain A y f mf zc0 x |
| 626 | 577 ... | case1 pr = no-extenion zc7 where -- we have previous A ∋ z < x , f z ≡ x, so chain ∋ f z ≡ x because of f-next |
| 682 | 578 chain0 = ZChain.chain zc |
| 579 zc7 : {a b z : Ordinal} → (z<x : z o< x) → odef (ZChain.chain zc ) a → b o< osuc x → (ab : odef A b) → | |
| 580 HasPrev A (ZChain.chain zc ) ab f ∨ IsSup A (ZChain.chain zc ) ab → | |
| 581 * a < * b → odef (ZChain.chain zc ) b | |
| 675 | 582 zc7 {a} {b} z<x za b<ox ab P a<b with osuc-≡< b<ox |
| 696 | 583 ... | case2 lt = ZChain.is-max zc za (subst (λ k → b o< k) (sym (Oprev.oprev=x op)) lt ) ab P a<b |
| 584 ... | case1 b=x = subst (λ k → odef chain0 k ) (trans (sym (HasPrev.x=fy pr )) (trans &iso (sym b=x)) ) ( ZChain.f-next zc (HasPrev.ay pr)) | |
| 682 | 585 ... | case2 ¬fy<x with ODC.p∨¬p O (IsSup A (ZChain.chain zc ) ax ) |
| 586 ... | case1 is-sup = -- x is a sup of zc | |
| 698 | 587 record { chain⊆A = pchain⊆A ; f-next = pnext ; f-total = ptotal |
| 588 ; initial = pinit ; chain∋init = pcy ; is-max = p-ismax } where | |
| 697 | 589 pchain : HOD |
| 590 pchain = UnionCF A f mf ay (ZChain1.supf (zc0 (& A))) (& A) | |
| 698 | 591 psupf = ZChain1.supf (zc0 (& A)) |
| 697 | 592 pchain⊆A : {y : Ordinal} → odef pchain y → odef A y |
| 593 pchain⊆A {y} ny = proj1 ny | |
| 698 | 594 pnext : {a : Ordinal} → odef pchain a → odef pchain (f a) |
| 595 pnext {a} ⟪ aa , ua ⟫ = ⟪ afa , record { u = UChain.u ua ; u<x = UChain.u<x ua ; chain∋z = fua } ⟫ where | |
| 596 afa : odef A ( f a ) | |
| 597 afa = proj2 ( mf a aa ) | |
| 598 fua : Chain A f mf ay psupf (UChain.u ua) (f a) | |
| 599 fua with UChain.chain∋z ua | |
| 600 ... | ch-init a fc = ch-init (f a) ( fsuc _ fc ) | |
| 601 ... | ch-is-sup is-sup fc = ch-is-sup (ChainP-next A f mf ay _ is-sup ) (fsuc _ fc) | |
| 602 ptotal : {a b : HOD } → odef pchain (& a) → odef pchain (& b) | |
| 603 → Tri ( a < b) ( a ≡ b) ( b < a ) | |
| 604 ptotal {a} {b} ca cb = subst₂ (λ j k → Tri (j < k) (j ≡ k) (k < j)) *iso *iso uz01 where | |
| 605 uz01 : Tri (* (& a) < * (& b)) (* (& a) ≡ * (& b)) (* (& b) < * (& a) ) | |
| 606 uz01 = chain-total A f mf ay _ (UChain.chain∋z (proj2 ca)) (UChain.chain∋z (proj2 cb)) | |
| 607 pinit : {y₁ : Ordinal} → odef pchain y₁ → * y ≤ * y₁ | |
| 608 pinit {a} ⟪ aa , ua ⟫ with UChain.chain∋z ua | |
| 609 ... | ch-init a fc = s≤fc y f mf fc | |
| 610 ... | ch-is-sup is-sup fc = ≤-ftrans (case2 zc7) (s≤fc _ f mf fc) where | |
| 611 zc7 : y << psupf (UChain.u ua) | |
| 612 zc7 = ChainP.fcy<sup is-sup (init ay) | |
| 613 pcy : odef pchain y | |
| 614 pcy = ⟪ ay , record { u = y ; u<x = ∈∧P→o< ⟪ ay , lift true ⟫ ; chain∋z = ch-init _ (init ay) } ⟫ | |
| 615 p-ismax : {a b : Ordinal} → odef pchain a → | |
| 616 b o< osuc x → (ab : odef A b) → | |
| 617 ( HasPrev A pchain ab f ∨ IsSup A pchain ab ) → | |
| 618 * a < * b → odef pchain b | |
| 619 p-ismax {a} {b} ua b<ox ab (case1 hasp) a<b = ? | |
| 620 p-ismax {a} {b} ua b<ox ab (case2 sup) a<b = ? | |
| 611 | 621 |
| 622 ... | case2 ¬x=sup = no-extenion z18 where -- x is not f y' nor sup of former ZChain from y -- no extention | |
| 682 | 623 z18 : {a b z : Ordinal} → (z<x : z o< x) → odef (ZChain.chain zc ) a → b o< osuc x → (ab : odef A b) → |
| 624 HasPrev A (ZChain.chain zc ) ab f ∨ IsSup A (ZChain.chain zc ) ab → | |
| 625 * a < * b → odef (ZChain.chain zc ) b | |
| 675 | 626 z18 {a} {b} z<x za b<x ab p a<b with osuc-≡< b<x |
| 697 | 627 ... | case2 lt = ZChain.is-max zc za (subst (λ k → b o< k) (sym (Oprev.oprev=x op)) lt ) ab p a<b |
| 565 | 628 ... | case1 b=x with p |
| 697 | 629 ... | case1 pr = ⊥-elim ( ¬fy<x record {y = HasPrev.y pr ; ay = HasPrev.ay pr ; x=fy = trans (trans &iso (sym b=x) ) (HasPrev.x=fy pr ) } ) |
| 571 | 630 ... | case2 b=sup = ⊥-elim ( ¬x=sup record { |
| 697 | 631 x<sup = λ {y} zy → subst (λ k → (y ≡ k) ∨ (y << k)) (trans b=x (sym &iso)) (IsSup.x<sup b=sup zy ) } ) |
| 682 | 632 ... | no op = zc5 where |
| 697 | 633 uzc : {z : Ordinal} → (u : UChain A f mf ay (ZChain1.supf (zc0 (& A))) x z ) → ZChain A f mf ay zc0 (UChain.u u) |
| 682 | 634 uzc {z} u = prev (UChain.u u) (UChain.u<x u) |
| 697 | 635 UZ : HOD |
| 636 UZ = UnionCF A f mf ay (ZChain1.supf (zc0 (& A))) x | |
| 682 | 637 zc5 : ZChain A f mf ay zc0 x |
| 697 | 638 zc5 with ODC.∋-p O A (* x) |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
639 ... | no noax = {!!} where -- ¬ A ∋ p, just skip |
| 697 | 640 ... | yes ax with ODC.p∨¬p O ( HasPrev A UZ ax f ) |
| 682 | 641 -- we have to check adding x preserve is-max ZChain A y f mf zc0 x |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
642 ... | case1 pr = {!!} where -- we have previous A ∋ z < x , f z ≡ x, so chain ∋ f z ≡ x because of f-next |
| 697 | 643 ... | case2 ¬fy<x with ODC.p∨¬p O (IsSup A UZ ax ) |
|
689
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
644 ... | case1 is-sup = {!!} -- x is a sup of (zc ?) |
|
34650e39e553
Chain is not strictly positive
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
688
diff
changeset
|
645 ... | case2 ¬x=sup = {!!} -- no-extenion z18 where -- x is not f y' nor sup of former ZChain from y -- no extention |
| 682 | 646 |
| 553 | 647 |
| 664 | 648 SZ0 : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) → {y : Ordinal} (ay : odef A y) → (x : Ordinal) → ZChain1 A f mf ay x |
| 649 SZ0 f mf ay x = TransFinite {λ z → ZChain1 A f mf ay z} (sind f mf ay ) x | |
| 629 | 650 |
| 674 | 651 SZ : ( f : Ordinal → Ordinal ) → (mf : ≤-monotonic-f A f ) → {y : Ordinal} (ay : odef A y) → ZChain A f mf ay (SZ0 f mf ay ) (& A) |
| 652 SZ f mf {y} ay = TransFinite {λ z → ZChain A f mf ay (SZ0 f mf ay ) z } (λ x → ind f mf ay x (SZ0 f mf ay ) ) (& A) | |
|
608
6655f03984f9
mutual tranfinite in zorn
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
607
diff
changeset
|
653 |
| 551 | 654 zorn00 : Maximal A |
| 655 zorn00 with is-o∅ ( & HasMaximal ) -- we have no Level (suc n) LEM | |
| 656 ... | no not = record { maximal = ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) ; A∋maximal = zorn01 ; ¬maximal<x = zorn02 } where | |
| 657 -- yes we have the maximal | |
| 658 zorn03 : odef HasMaximal ( & ( ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) ) ) | |
| 606 | 659 zorn03 = ODC.x∋minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) -- Axiom of choice |
| 551 | 660 zorn01 : A ∋ ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) |
| 661 zorn01 = proj1 zorn03 | |
| 662 zorn02 : {x : HOD} → A ∋ x → ¬ (ODC.minimal O HasMaximal (λ eq → not (=od∅→≡o∅ eq)) < x) | |
| 663 zorn02 {x} ax m<x = proj2 zorn03 (& x) ax (subst₂ (λ j k → j < k) (sym *iso) (sym *iso) m<x ) | |
| 674 | 664 ... | yes ¬Maximal = ⊥-elim ( z04 nmx zc0 zorn04 total ) where |
| 551 | 665 -- if we have no maximal, make ZChain, which contradict SUP condition |
| 666 nmx : ¬ Maximal A | |
| 667 nmx mx = ∅< {HasMaximal} zc5 ( ≡o∅→=od∅ ¬Maximal ) where | |
| 668 zc5 : odef A (& (Maximal.maximal mx)) ∧ (( y : Ordinal ) → odef A y → ¬ (* (& (Maximal.maximal mx)) < * y)) | |
| 669 zc5 = ⟪ Maximal.A∋maximal mx , (λ y ay mx<y → Maximal.¬maximal<x mx (subst (λ k → odef A k ) (sym &iso) ay) (subst (λ k → k < * y) *iso mx<y) ) ⟫ | |
| 664 | 670 zc0 : (x : Ordinal) → ZChain1 A (cf nmx) (cf-is-≤-monotonic nmx) as0 x |
| 671 zc0 x = TransFinite {λ z → ZChain1 A (cf nmx) (cf-is-≤-monotonic nmx) as0 z} (sind (cf nmx) (cf-is-≤-monotonic nmx) as0) x | |
| 674 | 672 zorn04 : ZChain A (cf nmx) (cf-is-≤-monotonic nmx) as0 zc0 (& A) |
| 653 | 673 zorn04 = SZ (cf nmx) (cf-is-≤-monotonic nmx) (subst (λ k → odef A k ) &iso as ) |
| 634 | 674 total : IsTotalOrderSet (ZChain.chain zorn04) |
| 654 | 675 total {a} {b} = zorn06 where |
| 676 zorn06 : odef (ZChain.chain zorn04) (& a) → odef (ZChain.chain zorn04) (& b) → Tri (a < b) (a ≡ b) (b < a) | |
| 677 zorn06 = ZChain.f-total (SZ (cf nmx) (cf-is-≤-monotonic nmx) (subst (λ k → odef A k ) &iso as) ) | |
| 551 | 678 |
| 516 | 679 -- usage (see filter.agda ) |
| 680 -- | |
| 497 | 681 -- _⊆'_ : ( A B : HOD ) → Set n |
| 682 -- _⊆'_ A B = (x : Ordinal ) → odef A x → odef B x | |
| 482 | 683 |
| 497 | 684 -- MaximumSubset : {L P : HOD} |
| 685 -- → o∅ o< & L → o∅ o< & P → P ⊆ L | |
| 686 -- → IsPartialOrderSet P _⊆'_ | |
| 687 -- → ( (B : HOD) → B ⊆ P → IsTotalOrderSet B _⊆'_ → SUP P B _⊆'_ ) | |
| 688 -- → Maximal P (_⊆'_) | |
| 689 -- MaximumSubset {L} {P} 0<L 0<P P⊆L PO SP = Zorn-lemma {P} {_⊆'_} 0<P PO SP |