Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate ordinal.agda @ 41:b60db5903f01
mnimul
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 24 May 2019 08:21:41 +0900 |
| parents | 457e6626e0b1 |
| children | 0d9b9db14361 |
| rev | line source |
|---|---|
| 34 | 1 {-# OPTIONS --allow-unsolved-metas #-} |
| 16 | 2 open import Level |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
3 module ordinal where |
| 3 | 4 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
5 open import zf |
| 3 | 6 |
| 23 | 7 open import Data.Nat renaming ( zero to Zero ; suc to Suc ; ℕ to Nat ; _⊔_ to _n⊔_ ) |
| 3 | 8 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
9 open import Relation.Binary.PropositionalEquality |
| 3 | 10 |
| 24 | 11 data OrdinalD {n : Level} : (lv : Nat) → Set n where |
| 12 Φ : (lv : Nat) → OrdinalD lv | |
| 13 OSuc : (lv : Nat) → OrdinalD {n} lv → OrdinalD lv | |
| 17 | 14 ℵ_ : (lv : Nat) → OrdinalD (Suc lv) |
| 3 | 15 |
| 24 | 16 record Ordinal {n : Level} : Set n where |
| 16 | 17 field |
| 18 lv : Nat | |
| 24 | 19 ord : OrdinalD {n} lv |
| 16 | 20 |
| 34 | 21 data ¬ℵ {n : Level} {lx : Nat } : ( x : OrdinalD {n} lx ) → Set where |
| 22 ¬ℵΦ : ¬ℵ (Φ lx) | |
| 23 ¬ℵs : {x : OrdinalD {n} lx } → ¬ℵ x → ¬ℵ (OSuc lx x) | |
| 24 | |
| 24 | 25 data _d<_ {n : Level} : {lx ly : Nat} → OrdinalD {n} lx → OrdinalD {n} ly → Set n where |
| 26 Φ< : {lx : Nat} → {x : OrdinalD {n} lx} → Φ lx d< OSuc lx x | |
| 27 s< : {lx : Nat} → {x y : OrdinalD {n} lx} → x d< y → OSuc lx x d< OSuc lx y | |
| 41 | 28 ℵΦ< : {lx : Nat} → Φ (Suc lx) d< (ℵ lx) |
| 34 | 29 ℵ< : {lx : Nat} → {x : OrdinalD {n} (Suc lx) } → ¬ℵ x → OSuc (Suc lx) x d< (ℵ lx) |
| 30 ℵs< : {lx : Nat} → (ℵ lx) d< OSuc (Suc lx) (ℵ lx) | |
| 35 | 31 ℵss< : {lx : Nat} → {x : OrdinalD {n} (Suc lx) } → (ℵ lx) d< x → (ℵ lx) d< OSuc (Suc lx) x |
| 17 | 32 |
| 33 open Ordinal | |
| 34 | |
| 27 | 35 _o<_ : {n : Level} ( x y : Ordinal ) → Set n |
| 17 | 36 _o<_ x y = (lv x < lv y ) ∨ ( ord x d< ord y ) |
| 3 | 37 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
38 open import Data.Nat.Properties |
| 6 | 39 open import Data.Empty |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
40 open import Data.Unit using ( ⊤ ) |
| 6 | 41 open import Relation.Nullary |
| 42 | |
| 43 open import Relation.Binary | |
| 44 open import Relation.Binary.Core | |
| 45 | |
| 24 | 46 o∅ : {n : Level} → Ordinal {n} |
| 47 o∅ = record { lv = Zero ; ord = Φ Zero } | |
| 21 | 48 |
| 34 | 49 s<refl : {n : Level } {lx : Nat } { x : OrdinalD {n} lx } → x d< OSuc lx x |
| 50 s<refl {n} {lv} {Φ lv} = Φ< | |
| 51 s<refl {n} {lv} {OSuc lv x} = s< s<refl | |
| 52 s<refl {n} {Suc lv} {ℵ lv} = ℵs< | |
| 53 | |
| 39 | 54 open import Relation.Binary.HeterogeneousEquality using (_≅_;refl) |
| 55 | |
| 56 ordinal-cong : {n : Level} {x y : Ordinal {n}} → | |
| 57 lv x ≡ lv y → ord x ≅ ord y → x ≡ y | |
| 58 ordinal-cong refl refl = refl | |
| 21 | 59 |
| 24 | 60 ≡→¬d< : {n : Level} → {lv : Nat} → {x : OrdinalD {n} lv } → x d< x → ⊥ |
| 61 ≡→¬d< {n} {lx} {OSuc lx y} (s< t) = ≡→¬d< t | |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
62 |
| 24 | 63 trio<> : {n : Level} → {lx : Nat} {x : OrdinalD {n} lx } { y : OrdinalD lx } → y d< x → x d< y → ⊥ |
| 34 | 64 trio<> {n} {lx} {.(OSuc lx _)} {.(OSuc lx _)} (s< s) (s< t) = trio<> s t |
| 65 trio<> {_} {.(Suc _)} {.(OSuc (Suc _) (ℵ _))} {.(ℵ _)} ℵs< (ℵ< {_} {.(ℵ _)} ()) | |
| 66 trio<> {_} {.(Suc _)} {.(ℵ _)} {.(OSuc (Suc _) (ℵ _))} (ℵ< ()) ℵs< | |
| 35 | 67 trio<> {n} {lx} {.(OSuc lx _)} {.(Φ lx)} Φ< () |
| 68 trio<> {n} {.(Suc _)} {.(ℵ _)} {.(Φ (Suc _))} ℵΦ< () | |
| 69 trio<> {n} {.(Suc _)} {.(ℵ _)} {.(OSuc (Suc _) (Φ (Suc _)))} (ℵ< ¬ℵΦ) (ℵss< ()) | |
| 70 trio<> {n} {.(Suc _)} {.(ℵ _)} {.(OSuc (Suc _) (OSuc (Suc _) _))} (ℵ< (¬ℵs x)) (ℵss< x<y) = trio<> (ℵ< x) x<y | |
| 71 trio<> {n} {.(Suc _)} {.(OSuc (Suc _) (Φ (Suc _)))} {.(ℵ _)} (ℵss< ()) (ℵ< ¬ℵΦ) | |
| 72 trio<> {n} {.(Suc _)} {.(OSuc (Suc _) (OSuc (Suc _) _))} {.(ℵ _)} (ℵss< y<x) (ℵ< (¬ℵs x)) = trio<> y<x (ℵ< x) | |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
73 |
| 24 | 74 trio<≡ : {n : Level} → {lx : Nat} {x : OrdinalD {n} lx } { y : OrdinalD lx } → x ≡ y → x d< y → ⊥ |
| 17 | 75 trio<≡ refl = ≡→¬d< |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
76 |
| 24 | 77 trio>≡ : {n : Level} → {lx : Nat} {x : OrdinalD {n} lx } { y : OrdinalD lx } → x ≡ y → y d< x → ⊥ |
| 17 | 78 trio>≡ refl = ≡→¬d< |
|
9
5ed16e2d8eb7
try to fix axiom of replacement
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
8
diff
changeset
|
79 |
| 24 | 80 triO : {n : Level} → {lx ly : Nat} → OrdinalD {n} lx → OrdinalD {n} ly → Tri (lx < ly) ( lx ≡ ly ) ( lx > ly ) |
| 81 triO {n} {lx} {ly} x y = <-cmp lx ly | |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
82 |
| 35 | 83 fin : {n : Level} → {lx : Nat} → {y : OrdinalD {n} (Suc lx) } → y d< (ℵ lx) → ¬ℵ y |
| 84 fin {_} {_} {Φ (Suc _)} ℵΦ< = ¬ℵΦ | |
| 85 fin {_} {_} {OSuc (Suc _) _} (ℵ< x) = ¬ℵs x | |
| 86 | |
| 24 | 87 triOrdd : {n : Level} → {lx : Nat} → Trichotomous _≡_ ( _d<_ {n} {lx} {lx} ) |
| 88 triOrdd {_} {lv} (Φ lv) (Φ lv) = tri≈ ≡→¬d< refl ≡→¬d< | |
| 89 triOrdd {_} {Suc lv} (ℵ lv) (ℵ lv) = tri≈ ≡→¬d< refl ≡→¬d< | |
| 90 triOrdd {_} {lv} (Φ lv) (OSuc lv y) = tri< Φ< (λ ()) ( λ lt → trio<> lt Φ< ) | |
| 41 | 91 triOrdd {_} {.(Suc lv)} (Φ (Suc lv)) (ℵ lv) = tri< ℵΦ< (λ ()) ( λ lt → trio<> lt ℵΦ<) |
| 92 triOrdd {_} {Suc lv} (ℵ lv) (Φ (Suc lv)) = tri> ( λ lt → trio<> lt ℵΦ< ) (λ ()) ℵΦ< | |
| 35 | 93 triOrdd {_} {Suc lv} (ℵ lv) (OSuc (Suc lv) y ) with triOrdd (ℵ lv) y |
| 94 triOrdd {_} {Suc lv} (ℵ lv) (OSuc .(Suc lv) y) | tri< a ¬b ¬c = tri< (ℵss< a) (λ ()) (trio<> (ℵss< a) ) | |
| 95 triOrdd {_} {Suc lv} (ℵ lv) (OSuc .(Suc lv) y) | tri≈ ¬a refl ¬c = tri< ℵs< (λ ()) ( λ lt → trio<> lt ℵs< ) | |
| 96 triOrdd {_} {Suc lv} (ℵ lv) (OSuc .(Suc lv) y) | tri> ¬a ¬b c = tri> ( λ lt → trio<> lt ( ℵ< (fin c)) ) (λ ()) ( ℵ< (fin c) ) | |
| 24 | 97 triOrdd {_} {lv} (OSuc lv x) (Φ lv) = tri> (λ lt → trio<> lt Φ<) (λ ()) Φ< |
| 35 | 98 triOrdd {_} {.(Suc lv)} (OSuc (Suc lv) x) (ℵ lv) with triOrdd x (ℵ lv) |
| 99 triOrdd {_} {.(Suc lv)} (OSuc (Suc lv) x) (ℵ lv) | tri< a ¬b ¬c = tri< (ℵ< (fin a ) ) (λ ()) ( λ lt → trio<> lt (ℵ< (fin a ))) | |
| 100 triOrdd {_} {.(Suc lv)} (OSuc (Suc lv) x) (ℵ lv) | tri≈ ¬a refl ¬c = tri> (λ lt → trio<> lt ℵs< ) (λ ()) ℵs< | |
| 101 triOrdd {_} {.(Suc lv)} (OSuc (Suc lv) x) (ℵ lv) | tri> ¬a ¬b c = tri> (λ lt → trio<> lt (ℵss< c )) (λ ()) ( ℵss< c ) | |
| 24 | 102 triOrdd {_} {lv} (OSuc lv x) (OSuc lv y) with triOrdd x y |
| 103 triOrdd {_} {lv} (OSuc lv x) (OSuc lv y) | tri< a ¬b ¬c = tri< (s< a) (λ tx=ty → trio<≡ tx=ty (s< a) ) ( λ lt → trio<> lt (s< a) ) | |
| 104 triOrdd {_} {lv} (OSuc lv x) (OSuc lv x) | tri≈ ¬a refl ¬c = tri≈ ≡→¬d< refl ≡→¬d< | |
| 105 triOrdd {_} {lv} (OSuc lv x) (OSuc lv y) | tri> ¬a ¬b c = tri> ( λ lt → trio<> lt (s< c) ) (λ tx=ty → trio>≡ tx=ty (s< c) ) (s< c) | |
|
9
5ed16e2d8eb7
try to fix axiom of replacement
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
8
diff
changeset
|
106 |
| 24 | 107 d<→lv : {n : Level} {x y : Ordinal {n}} → ord x d< ord y → lv x ≡ lv y |
| 17 | 108 d<→lv Φ< = refl |
| 109 d<→lv (s< lt) = refl | |
| 110 d<→lv ℵΦ< = refl | |
| 34 | 111 d<→lv (ℵ< _) = refl |
| 112 d<→lv ℵs< = refl | |
| 35 | 113 d<→lv (ℵss< _) = refl |
| 114 | |
| 115 xsyℵ : {n : Level} {lx : Nat} {x y : OrdinalD {n} lx } → x d< y → ¬ℵ y → ¬ℵ x | |
| 116 xsyℵ {_} {_} {Φ lv₁} {y} x<y t = ¬ℵΦ | |
| 117 xsyℵ {_} {_} {OSuc lv₁ x} {OSuc lv₁ y} (s< x<y) (¬ℵs t) = ¬ℵs ( xsyℵ x<y t) | |
| 118 xsyℵ {_} {_} {OSuc .(Suc _) x} {.(ℵ _)} (ℵ< x₁) () | |
| 119 xsyℵ {_} {_} {ℵ lv₁} {.(OSuc (Suc lv₁) (ℵ lv₁))} ℵs< (¬ℵs t) = t | |
| 120 xsyℵ (ℵss< ()) (¬ℵs ¬ℵΦ) | |
| 121 xsyℵ (ℵss< x<y) (¬ℵs t) = xsyℵ x<y t | |
| 16 | 122 |
| 24 | 123 orddtrans : {n : Level} {lx : Nat} {x y z : OrdinalD {n} lx } → x d< y → y d< z → x d< z |
| 124 orddtrans {_} {lx} {.(Φ lx)} {.(OSuc lx _)} {.(OSuc lx _)} Φ< (s< y<z) = Φ< | |
| 41 | 125 orddtrans {_} {Suc lx} {Φ (Suc lx)} {OSuc (Suc lx) y} {ℵ lx} Φ< (ℵ< _) = ℵΦ< |
| 24 | 126 orddtrans {_} {lx} {.(OSuc lx _)} {.(OSuc lx _)} {.(OSuc lx _)} (s< x<y) (s< y<z) = s< ( orddtrans x<y y<z ) |
| 34 | 127 orddtrans {_} {Suc lx} {.(OSuc (Suc lx) _)} {.(OSuc (Suc lx) (Φ (Suc lx)))} {.(ℵ lx)} (s< ()) (ℵ< ¬ℵΦ) |
| 128 orddtrans ℵs< (ℵ< ()) | |
| 35 | 129 orddtrans {n} {Suc lx} {OSuc (Suc lx) x} {OSuc (Suc ly) y} {ℵ _} (s< x<y) (ℵ< t) = ℵ< ( xsyℵ x<y t ) |
| 130 orddtrans {n} {.(Suc _)} {.(Φ (Suc _))} {.(ℵ _)} {.(OSuc (Suc _) (ℵ _))} ℵΦ< ℵs< = Φ< | |
| 41 | 131 orddtrans {n} {.(Suc _)} {OSuc (Suc _) .(Φ (Suc _))} {.(ℵ _)} {OSuc (Suc _) (ℵ k)} (ℵ< ¬ℵΦ) ℵs< = s< ℵΦ< |
| 35 | 132 orddtrans {n} {.(Suc _)} {OSuc (Suc lv) (OSuc (Suc _) x)} {ℵ lv} {.(OSuc (Suc _) (ℵ _))} (ℵ< (¬ℵs t)) ℵs< = s< ( ℵ< t ) |
| 133 orddtrans {n} {.(Suc lv)} {ℵ lv} {OSuc .(Suc lv) (ℵ lv)} {OSuc .(Suc lv) .(OSuc (Suc lv) (ℵ lv))} ℵs< (s< ℵs<) = ℵss< ℵs< | |
| 134 orddtrans ℵΦ< (ℵss< y<z) = Φ< | |
| 41 | 135 orddtrans (ℵ< {lx} {Φ .(Suc lx)} nxx) (ℵss< {_} {k} y<z) = s< (orddtrans ℵΦ< y<z) |
| 35 | 136 orddtrans (ℵ< {lx} {OSuc .(Suc lx) xx} (¬ℵs nxx)) (ℵss< y<z) = s< (orddtrans (ℵ< nxx) y<z) |
| 137 orddtrans (ℵ< {.lv₁} {ℵ lv₁} ()) (ℵss< y<z) | |
| 138 orddtrans (ℵss< x<y) (s< y<z) = ℵss< ( orddtrans x<y y<z ) | |
| 139 orddtrans (ℵss< ()) (ℵ< ¬ℵΦ) | |
| 140 orddtrans (ℵss< ℵs<) (ℵ< (¬ℵs ())) | |
| 141 orddtrans (ℵss< (ℵss< x<y)) (ℵ< (¬ℵs x)) = orddtrans (ℵss< x<y) ( ℵ< x ) | |
| 142 orddtrans {n} {Suc lx} {x} {y} {z} ℵs< (s< (ℵss< {lx} {ss} y<z)) = ℵss< ( ℵss< y<z ) | |
|
9
5ed16e2d8eb7
try to fix axiom of replacement
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
8
diff
changeset
|
143 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
144 max : (x y : Nat) → Nat |
|
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
145 max Zero Zero = Zero |
|
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
146 max Zero (Suc x) = (Suc x) |
|
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
147 max (Suc x) Zero = (Suc x) |
|
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
148 max (Suc x) (Suc y) = Suc ( max x y ) |
| 3 | 149 |
| 24 | 150 maxαd : {n : Level} → { lx : Nat } → OrdinalD {n} lx → OrdinalD lx → OrdinalD lx |
| 17 | 151 maxαd x y with triOrdd x y |
| 152 maxαd x y | tri< a ¬b ¬c = y | |
| 153 maxαd x y | tri≈ ¬a b ¬c = x | |
| 154 maxαd x y | tri> ¬a ¬b c = x | |
| 6 | 155 |
| 24 | 156 maxα : {n : Level} → Ordinal {n} → Ordinal → Ordinal |
| 17 | 157 maxα x y with <-cmp (lv x) (lv y) |
| 158 maxα x y | tri< a ¬b ¬c = x | |
| 159 maxα x y | tri> ¬a ¬b c = y | |
| 160 maxα x y | tri≈ ¬a refl ¬c = record { lv = lv x ; ord = maxαd (ord x) (ord y) } | |
| 7 | 161 |
| 24 | 162 _o≤_ : {n : Level} → Ordinal → Ordinal → Set (suc n) |
| 23 | 163 a o≤ b = (a ≡ b) ∨ ( a o< b ) |
| 164 | |
| 27 | 165 ordtrans : {n : Level} {x y z : Ordinal {n} } → x o< y → y o< z → x o< z |
| 166 ordtrans {n} {x} {y} {z} (case1 x₁) (case1 x₂) = case1 ( <-trans x₁ x₂ ) | |
| 167 ordtrans {n} {x} {y} {z} (case1 x₁) (case2 x₂) with d<→lv x₂ | |
| 168 ... | refl = case1 x₁ | |
| 169 ordtrans {n} {x} {y} {z} (case2 x₁) (case1 x₂) with d<→lv x₁ | |
| 170 ... | refl = case1 x₂ | |
| 171 ordtrans {n} {x} {y} {z} (case2 x₁) (case2 x₂) with d<→lv x₁ | d<→lv x₂ | |
| 172 ... | refl | refl = case2 ( orddtrans x₁ x₂ ) | |
| 173 | |
| 174 | |
| 24 | 175 trio< : {n : Level } → Trichotomous {suc n} _≡_ _o<_ |
| 23 | 176 trio< a b with <-cmp (lv a) (lv b) |
| 24 | 177 trio< a b | tri< a₁ ¬b ¬c = tri< (case1 a₁) (λ refl → ¬b (cong ( λ x → lv x ) refl ) ) lemma1 where |
| 178 lemma1 : ¬ (Suc (lv b) ≤ lv a) ∨ (ord b d< ord a) | |
| 179 lemma1 (case1 x) = ¬c x | |
| 180 lemma1 (case2 x) with d<→lv x | |
| 181 lemma1 (case2 x) | refl = ¬b refl | |
| 182 trio< a b | tri> ¬a ¬b c = tri> lemma1 (λ refl → ¬b (cong ( λ x → lv x ) refl ) ) (case1 c) where | |
| 183 lemma1 : ¬ (Suc (lv a) ≤ lv b) ∨ (ord a d< ord b) | |
| 184 lemma1 (case1 x) = ¬a x | |
| 185 lemma1 (case2 x) with d<→lv x | |
| 186 lemma1 (case2 x) | refl = ¬b refl | |
| 23 | 187 trio< a b | tri≈ ¬a refl ¬c with triOrdd ( ord a ) ( ord b ) |
| 24 | 188 trio< record { lv = .(lv b) ; ord = x } b | tri≈ ¬a refl ¬c | tri< a ¬b ¬c₁ = tri< (case2 a) (λ refl → ¬b (lemma1 refl )) lemma2 where |
| 189 lemma1 : (record { lv = _ ; ord = x }) ≡ b → x ≡ ord b | |
| 190 lemma1 refl = refl | |
| 191 lemma2 : ¬ (Suc (lv b) ≤ lv b) ∨ (ord b d< x) | |
| 192 lemma2 (case1 x) = ¬a x | |
| 193 lemma2 (case2 x) = trio<> x a | |
| 194 trio< record { lv = .(lv b) ; ord = x } b | tri≈ ¬a refl ¬c | tri> ¬a₁ ¬b c = tri> lemma2 (λ refl → ¬b (lemma1 refl )) (case2 c) where | |
| 195 lemma1 : (record { lv = _ ; ord = x }) ≡ b → x ≡ ord b | |
| 196 lemma1 refl = refl | |
| 197 lemma2 : ¬ (Suc (lv b) ≤ lv b) ∨ (x d< ord b) | |
| 198 lemma2 (case1 x) = ¬a x | |
| 199 lemma2 (case2 x) = trio<> x c | |
| 200 trio< record { lv = .(lv b) ; ord = x } b | tri≈ ¬a refl ¬c | tri≈ ¬a₁ refl ¬c₁ = tri≈ lemma1 refl lemma1 where | |
| 201 lemma1 : ¬ (Suc (lv b) ≤ lv b) ∨ (ord b d< ord b) | |
| 202 lemma1 (case1 x) = ¬a x | |
| 203 lemma1 (case2 x) = ≡→¬d< x | |
| 23 | 204 |
| 24 | 205 OrdTrans : {n : Level} → Transitive {suc n} _o≤_ |
| 16 | 206 OrdTrans (case1 refl) (case1 refl) = case1 refl |
| 207 OrdTrans (case1 refl) (case2 lt2) = case2 lt2 | |
| 208 OrdTrans (case2 lt1) (case1 refl) = case2 lt1 | |
| 17 | 209 OrdTrans (case2 (case1 x)) (case2 (case1 y)) = case2 (case1 ( <-trans x y ) ) |
| 210 OrdTrans (case2 (case1 x)) (case2 (case2 y)) with d<→lv y | |
| 211 OrdTrans (case2 (case1 x)) (case2 (case2 y)) | refl = case2 (case1 x ) | |
| 212 OrdTrans (case2 (case2 x)) (case2 (case1 y)) with d<→lv x | |
| 213 OrdTrans (case2 (case2 x)) (case2 (case1 y)) | refl = case2 (case1 y) | |
| 214 OrdTrans (case2 (case2 x)) (case2 (case2 y)) with d<→lv x | d<→lv y | |
| 215 OrdTrans (case2 (case2 x)) (case2 (case2 y)) | refl | refl = case2 (case2 (orddtrans x y )) | |
| 16 | 216 |
| 24 | 217 OrdPreorder : {n : Level} → Preorder (suc n) (suc n) (suc n) |
| 218 OrdPreorder {n} = record { Carrier = Ordinal | |
| 16 | 219 ; _≈_ = _≡_ |
| 23 | 220 ; _∼_ = _o≤_ |
| 16 | 221 ; isPreorder = record { |
| 222 isEquivalence = record { refl = refl ; sym = sym ; trans = trans } | |
| 223 ; reflexive = case1 | |
| 24 | 224 ; trans = OrdTrans |
| 16 | 225 } |
| 226 } | |
| 227 | |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
228 TransFinite : {n : Level} → { ψ : Ordinal {n} → Set n } |
| 22 | 229 → ( ∀ (lx : Nat ) → ψ ( record { lv = Suc lx ; ord = ℵ lx } )) |
| 24 | 230 → ( ∀ (lx : Nat ) → ψ ( record { lv = lx ; ord = Φ lx } ) ) |
| 231 → ( ∀ (lx : Nat ) → (x : OrdinalD lx ) → ψ ( record { lv = lx ; ord = x } ) → ψ ( record { lv = lx ; ord = OSuc lx x } ) ) | |
| 22 | 232 → ∀ (x : Ordinal) → ψ x |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
233 TransFinite caseℵ caseΦ caseOSuc record { lv = lv ; ord = Φ lv } = caseΦ lv |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
234 TransFinite caseℵ caseΦ caseOSuc record { lv = lv ; ord = OSuc lv ord₁ } = caseOSuc lv ord₁ |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
235 ( TransFinite caseℵ caseΦ caseOSuc (record { lv = lv ; ord = ord₁ } )) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
236 TransFinite caseℵ caseΦ caseOSuc record { lv = Suc lv₁ ; ord = ℵ lv₁ } = caseℵ lv₁ |
| 22 | 237 |