Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate OD.agda @ 185:a002ce0346dd
...
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Mon, 22 Jul 2019 18:36:45 +0900 |
| parents | 65e1b2e415bb |
| children | 914cc522c53a |
| rev | line source |
|---|---|
| 16 | 1 open import Level |
|
182
9f3c0e0b2bc9
remove ordinal-definable
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
180
diff
changeset
|
2 module OD where |
| 3 | 3 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
4 open import zf |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
5 open import ordinal |
| 23 | 6 open import Data.Nat renaming ( zero to Zero ; suc to Suc ; ℕ to Nat ; _⊔_ to _n⊔_ ) |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
7 open import Relation.Binary.PropositionalEquality |
|
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
8 open import Data.Nat.Properties |
| 6 | 9 open import Data.Empty |
| 10 open import Relation.Nullary | |
| 11 open import Relation.Binary | |
| 12 open import Relation.Binary.Core | |
| 13 | |
| 27 | 14 -- Ordinal Definable Set |
| 11 | 15 |
| 141 | 16 record OD {n : Level} : Set (suc n) where |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
17 field |
|
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
18 def : (x : Ordinal {n} ) → Set n |
|
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
19 |
| 141 | 20 open OD |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
21 |
|
44
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
22 open Ordinal |
| 120 | 23 open _∧_ |
|
44
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
24 |
| 141 | 25 record _==_ {n : Level} ( a b : OD {n} ) : Set n where |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
26 field |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
27 eq→ : ∀ { x : Ordinal {n} } → def a x → def b x |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
28 eq← : ∀ { x : Ordinal {n} } → def b x → def a x |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
29 |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
30 id : {n : Level} {A : Set n} → A → A |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
31 id x = x |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
32 |
| 141 | 33 eq-refl : {n : Level} { x : OD {n} } → x == x |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
34 eq-refl {n} {x} = record { eq→ = id ; eq← = id } |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
35 |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
36 open _==_ |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
37 |
| 141 | 38 eq-sym : {n : Level} { x y : OD {n} } → x == y → y == x |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
39 eq-sym eq = record { eq→ = eq← eq ; eq← = eq→ eq } |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
40 |
| 141 | 41 eq-trans : {n : Level} { x y z : OD {n} } → x == y → y == z → x == z |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
42 eq-trans x=y y=z = record { eq→ = λ t → eq→ y=z ( eq→ x=y t) ; eq← = λ t → eq← x=y ( eq← y=z t) } |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
43 |
| 141 | 44 ⇔→== : {n : Level} { x y : OD {suc n} } → ( {z : Ordinal {suc n}} → def x z ⇔ def y z) → x == y |
| 120 | 45 eq→ ( ⇔→== {n} {x} {y} eq ) {z} m = proj1 eq m |
| 46 eq← ( ⇔→== {n} {x} {y} eq ) {z} m = proj2 eq m | |
| 47 | |
| 179 | 48 -- Ordinal in OD ( and ZFSet ) Transitive Set |
| 141 | 49 Ord : { n : Level } → ( a : Ordinal {n} ) → OD {n} |
|
140
312e27aa3cb5
remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
139
diff
changeset
|
50 Ord {n} a = record { def = λ y → y o< a } |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
51 |
| 141 | 52 od∅ : {n : Level} → OD {n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
53 od∅ {n} = Ord o∅ |
| 40 | 54 |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
55 postulate |
| 141 | 56 -- OD can be iso to a subset of Ordinal ( by means of Godel Set ) |
| 57 od→ord : {n : Level} → OD {n} → Ordinal {n} | |
| 58 ord→od : {n : Level} → Ordinal {n} → OD {n} | |
| 166 | 59 c<→o< : {n : Level} {x y : OD {n} } → def y ( od→ord x ) → od→ord x o< od→ord y |
| 60 oiso : {n : Level} {x : OD {n}} → ord→od ( od→ord x ) ≡ x | |
| 113 | 61 diso : {n : Level} {x : Ordinal {n}} → od→ord ( ord→od x ) ≡ x |
| 150 | 62 -- we should prove this in agda, but simply put here |
| 141 | 63 ==→o≡ : {n : Level} → { x y : OD {suc n} } → (x == y) → x ≡ y |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
64 -- next assumption causes ∀ x ∋ ∅ . It menas only an ordinal becomes a set |
| 159 | 65 -- o<→c< : {n : Level} {x y : Ordinal {n} } → x o< y → def (ord→od y) x |
| 66 -- ord→od x ≡ Ord x results the same | |
| 100 | 67 -- supermum as Replacement Axiom |
| 95 | 68 sup-o : {n : Level } → ( Ordinal {n} → Ordinal {n}) → Ordinal {n} |
| 98 | 69 sup-o< : {n : Level } → { ψ : Ordinal {n} → Ordinal {n}} → ∀ {x : Ordinal {n}} → ψ x o< sup-o ψ |
| 111 | 70 -- contra-position of mimimulity of supermum required in Power Set Axiom |
| 165 | 71 -- sup-x : {n : Level } → ( Ordinal {n} → Ordinal {n}) → Ordinal {n} |
| 72 -- sup-lb : {n : Level } → { ψ : Ordinal {n} → Ordinal {n}} → {z : Ordinal {n}} → z o< sup-o ψ → z o< osuc (ψ (sup-x ψ)) | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
73 -- sup-lb : {n : Level } → ( ψ : Ordinal {n} → Ordinal {n}) → ( ∀ {x : Ordinal {n}} → ψx o< z ) → z o< osuc ( sup-o ψ ) |
| 183 | 74 -- mimimul and x∋minimul is an Axiom of choice |
| 141 | 75 minimul : {n : Level } → (x : OD {suc n} ) → ¬ (x == od∅ )→ OD {suc n} |
| 117 | 76 -- this should be ¬ (x == od∅ )→ ∃ ox → x ∋ Ord ox ( minimum of x ) |
| 141 | 77 x∋minimul : {n : Level } → (x : OD {suc n} ) → ( ne : ¬ (x == od∅ ) ) → def x ( od→ord ( minimul x ne ) ) |
| 183 | 78 -- |
| 141 | 79 minimul-1 : {n : Level } → (x : OD {suc n} ) → ( ne : ¬ (x == od∅ ) ) → (y : OD {suc n}) → ¬ ( def (minimul x ne) (od→ord y)) ∧ (def x (od→ord y) ) |
| 123 | 80 |
| 141 | 81 _∋_ : { n : Level } → ( a x : OD {n} ) → Set n |
| 95 | 82 _∋_ {n} a x = def a ( od→ord x ) |
| 83 | |
| 141 | 84 _c<_ : { n : Level } → ( x a : OD {n} ) → Set n |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
85 x c< a = a ∋ x |
| 103 | 86 |
| 141 | 87 _c≤_ : {n : Level} → OD {n} → OD {n} → Set (suc n) |
| 95 | 88 a c≤ b = (a ≡ b) ∨ ( b ∋ a ) |
| 89 | |
| 141 | 90 cseq : {n : Level} → OD {n} → OD {n} |
|
140
312e27aa3cb5
remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
139
diff
changeset
|
91 cseq x = record { def = λ y → def x (osuc y) } where |
| 113 | 92 |
| 141 | 93 def-subst : {n : Level } {Z : OD {n}} {X : Ordinal {n} }{z : OD {n}} {x : Ordinal {n} }→ def Z X → Z ≡ z → X ≡ x → def z x |
| 95 | 94 def-subst df refl refl = df |
| 95 | |
| 141 | 96 sup-od : {n : Level } → ( OD {n} → OD {n}) → OD {n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
97 sup-od ψ = Ord ( sup-o ( λ x → od→ord (ψ (ord→od x ))) ) |
| 95 | 98 |
| 141 | 99 sup-c< : {n : Level } → ( ψ : OD {n} → OD {n}) → ∀ {x : OD {n}} → def ( sup-od ψ ) (od→ord ( ψ x )) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
100 sup-c< {n} ψ {x} = def-subst {n} {_} {_} {Ord ( sup-o ( λ x → od→ord (ψ (ord→od x ))) )} {od→ord ( ψ x )} |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
101 lemma refl (cong ( λ k → od→ord (ψ k) ) oiso) where |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
102 lemma : od→ord (ψ (ord→od (od→ord x))) o< sup-o (λ x → od→ord (ψ (ord→od x))) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
103 lemma = subst₂ (λ j k → j o< k ) refl diso (o<-subst sup-o< refl (sym diso) ) |
| 28 | 104 |
| 142 | 105 otrans : {n : Level} {a x : Ordinal {n} } → def (Ord a) x → { y : Ordinal {n} } → y o< x → def (Ord a) y |
| 106 otrans {n} {a} {x} x<a {y} y<x = ordtrans y<x x<a | |
| 123 | 107 |
| 37 | 108 ∅3 : {n : Level} → { x : Ordinal {n}} → ( ∀(y : Ordinal {n}) → ¬ (y o< x ) ) → x ≡ o∅ {n} |
| 81 | 109 ∅3 {n} {x} = TransFinite {n} c2 c3 x where |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
110 c0 : Nat → Ordinal {n} → Set n |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
111 c0 lx x = (∀(y : Ordinal {n}) → ¬ (y o< x)) → x ≡ o∅ {n} |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
112 c2 : (lx : Nat) → c0 lx (record { lv = lx ; ord = Φ lx } ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
113 c2 Zero not = refl |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
114 c2 (Suc lx) not with not ( record { lv = lx ; ord = Φ lx } ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
115 ... | t with t (case1 ≤-refl ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
116 c2 (Suc lx) not | t | () |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
117 c3 : (lx : Nat) (x₁ : OrdinalD lx) → c0 lx (record { lv = lx ; ord = x₁ }) → c0 lx (record { lv = lx ; ord = OSuc lx x₁ }) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
118 c3 lx (Φ .lx) d not with not ( record { lv = lx ; ord = Φ lx } ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
119 ... | t with t (case2 Φ< ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
120 c3 lx (Φ .lx) d not | t | () |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
121 c3 lx (OSuc .lx x₁) d not with not ( record { lv = lx ; ord = OSuc lx x₁ } ) |
| 34 | 122 ... | t with t (case2 (s< s<refl ) ) |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
123 c3 lx (OSuc .lx x₁) d not | t | () |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
124 |
| 57 | 125 ∅5 : {n : Level} → { x : Ordinal {n} } → ¬ ( x ≡ o∅ {n} ) → o∅ {n} o< x |
| 126 ∅5 {n} {record { lv = Zero ; ord = (Φ .0) }} not = ⊥-elim (not refl) | |
| 127 ∅5 {n} {record { lv = Zero ; ord = (OSuc .0 ord) }} not = case2 Φ< | |
| 128 ∅5 {n} {record { lv = (Suc lv) ; ord = ord }} not = case1 (s≤s z≤n) | |
| 37 | 129 |
| 46 | 130 ord-iso : {n : Level} {y : Ordinal {n} } → record { lv = lv (od→ord (ord→od y)) ; ord = ord (od→ord (ord→od y)) } ≡ record { lv = lv y ; ord = ord y } |
| 131 ord-iso = cong ( λ k → record { lv = lv k ; ord = ord k } ) diso | |
|
44
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
132 |
| 51 | 133 -- avoiding lv != Zero error |
| 141 | 134 orefl : {n : Level} → { x : OD {n} } → { y : Ordinal {n} } → od→ord x ≡ y → od→ord x ≡ y |
| 51 | 135 orefl refl = refl |
| 136 | |
| 141 | 137 ==-iso : {n : Level} → { x y : OD {n} } → ord→od (od→ord x) == ord→od (od→ord y) → x == y |
| 51 | 138 ==-iso {n} {x} {y} eq = record { |
| 139 eq→ = λ d → lemma ( eq→ eq (def-subst d (sym oiso) refl )) ; | |
| 140 eq← = λ d → lemma ( eq← eq (def-subst d (sym oiso) refl )) } | |
| 141 where | |
| 141 | 142 lemma : {x : OD {n} } {z : Ordinal {n}} → def (ord→od (od→ord x)) z → def x z |
| 51 | 143 lemma {x} {z} d = def-subst d oiso refl |
| 144 | |
| 141 | 145 =-iso : {n : Level } {x y : OD {suc n} } → (x == y) ≡ (ord→od (od→ord x) == y) |
| 57 | 146 =-iso {_} {_} {y} = cong ( λ k → k == y ) (sym oiso) |
| 147 | |
| 141 | 148 ord→== : {n : Level} → { x y : OD {n} } → od→ord x ≡ od→ord y → x == y |
| 51 | 149 ord→== {n} {x} {y} eq = ==-iso (lemma (od→ord x) (od→ord y) (orefl eq)) where |
| 150 lemma : ( ox oy : Ordinal {n} ) → ox ≡ oy → (ord→od ox) == (ord→od oy) | |
| 151 lemma ox ox refl = eq-refl | |
| 152 | |
| 153 o≡→== : {n : Level} → { x y : Ordinal {n} } → x ≡ y → ord→od x == ord→od y | |
| 154 o≡→== {n} {x} {.x} refl = eq-refl | |
| 155 | |
| 156 >→¬< : {x y : Nat } → (x < y ) → ¬ ( y < x ) | |
| 157 >→¬< (s≤s x<y) (s≤s y<x) = >→¬< x<y y<x | |
| 158 | |
| 141 | 159 c≤-refl : {n : Level} → ( x : OD {n} ) → x c≤ x |
| 51 | 160 c≤-refl x = case1 refl |
| 161 | |
| 141 | 162 ∋→o< : {n : Level} → { a x : OD {suc n} } → a ∋ x → od→ord x o< od→ord a |
| 91 | 163 ∋→o< {n} {a} {x} lt = t where |
| 164 t : (od→ord x) o< (od→ord a) | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
165 t = c<→o< {suc n} {x} {a} lt |
| 91 | 166 |
| 150 | 167 o∅≡od∅ : {n : Level} → ord→od (o∅ {suc n}) ≡ od∅ {suc n} |
| 168 o∅≡od∅ {n} = ==→o≡ lemma where | |
| 169 lemma0 : {x : Ordinal} → def (ord→od o∅) x → def od∅ x | |
| 170 lemma0 {x} lt = o<-subst (c<→o< {suc n} {ord→od x} {ord→od o∅} (def-subst {suc n} {ord→od o∅} {x} lt refl (sym diso)) ) diso diso | |
| 171 lemma1 : {x : Ordinal} → def od∅ x → def (ord→od o∅) x | |
| 172 lemma1 (case1 ()) | |
| 173 lemma1 (case2 ()) | |
| 174 lemma : ord→od o∅ == od∅ | |
| 175 lemma = record { eq→ = lemma0 ; eq← = lemma1 } | |
| 176 | |
| 177 ord-od∅ : {n : Level} → od→ord (od∅ {suc n}) ≡ o∅ {suc n} | |
| 178 ord-od∅ {n} = sym ( subst (λ k → k ≡ od→ord (od∅ {suc n}) ) diso (cong ( λ k → od→ord k ) o∅≡od∅ ) ) | |
| 80 | 179 |
| 141 | 180 o<→¬c> : {n : Level} → { x y : OD {n} } → (od→ord x ) o< ( od→ord y) → ¬ (y c< x ) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
181 o<→¬c> {n} {x} {y} olt clt = o<> olt (c<→o< clt ) where |
| 51 | 182 |
| 141 | 183 o≡→¬c< : {n : Level} → { x y : OD {n} } → (od→ord x ) ≡ ( od→ord y) → ¬ x c< y |
| 111 | 184 o≡→¬c< {n} {x} {y} oeq lt = o<¬≡ (orefl oeq ) (c<→o< lt) |
| 54 | 185 |
|
140
312e27aa3cb5
remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
139
diff
changeset
|
186 ∅0 : {n : Level} → record { def = λ x → Lift n ⊥ } == od∅ {n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
187 eq→ ∅0 {w} (lift ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
188 eq← ∅0 {w} (case1 ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
189 eq← ∅0 {w} (case2 ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
190 |
| 141 | 191 ∅< : {n : Level} → { x y : OD {n} } → def x (od→ord y ) → ¬ ( x == od∅ {n} ) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
192 ∅< {n} {x} {y} d eq with eq→ (eq-trans eq (eq-sym ∅0) ) d |
| 60 | 193 ∅< {n} {x} {y} d eq | lift () |
| 57 | 194 |
| 141 | 195 ∅6 : {n : Level} → { x : OD {suc n} } → ¬ ( x ∋ x ) -- no Russel paradox |
| 120 | 196 ∅6 {n} {x} x∋x = o<¬≡ refl ( c<→o< {suc n} {x} {x} x∋x ) |
| 51 | 197 |
| 141 | 198 def-iso : {n : Level} {A B : OD {n}} {x y : Ordinal {n}} → x ≡ y → (def A y → def B y) → def A x → def B x |
| 76 | 199 def-iso refl t = t |
| 200 | |
| 57 | 201 is-o∅ : {n : Level} → ( x : Ordinal {suc n} ) → Dec ( x ≡ o∅ {suc n} ) |
| 202 is-o∅ {n} record { lv = Zero ; ord = (Φ .0) } = yes refl | |
| 203 is-o∅ {n} record { lv = Zero ; ord = (OSuc .0 ord₁) } = no ( λ () ) | |
| 204 is-o∅ {n} record { lv = (Suc lv₁) ; ord = ord } = no (λ()) | |
| 205 | |
| 167 | 206 OrdP : {n : Level} → ( x : Ordinal {suc n} ) ( y : OD {suc n} ) → Dec ( Ord x ∋ y ) |
| 207 OrdP {n} x y with trio< x (od→ord y) | |
| 208 OrdP {n} x y | tri< a ¬b ¬c = no ¬c | |
| 209 OrdP {n} x y | tri≈ ¬a refl ¬c = no ( o<¬≡ refl ) | |
| 210 OrdP {n} x y | tri> ¬a ¬b c = yes c | |
| 119 | 211 |
| 79 | 212 -- open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ ) |
| 94 | 213 -- postulate f-extensionality : { n : Level} → Relation.Binary.PropositionalEquality.Extensionality (suc n) (suc (suc n)) |
|
59
d13d1351a1fa
lemma = cong₂ (λ x not → minimul x not ) oiso { }6
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
58
diff
changeset
|
214 |
| 141 | 215 in-codomain : {n : Level} → (X : OD {suc n} ) → ( ψ : OD {suc n} → OD {suc n} ) → OD {suc n} |
| 148 | 216 in-codomain {n} X ψ = record { def = λ x → ¬ ( (y : Ordinal {suc n}) → ¬ ( def X y ∧ ( x ≡ od→ord (ψ (ord→od y ))))) } |
| 141 | 217 |
| 96 | 218 -- Power Set of X ( or constructible by λ y → def X (od→ord y ) |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
219 |
| 141 | 220 ZFSubset : {n : Level} → (A x : OD {suc n} ) → OD {suc n} |
|
140
312e27aa3cb5
remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
139
diff
changeset
|
221 ZFSubset A x = record { def = λ y → def A y ∧ def x y } where |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
222 |
| 141 | 223 Def : {n : Level} → (A : OD {suc n}) → OD {suc n} |
| 154 | 224 Def {n} A = Ord ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) ) -- Ord x does not help ord-power→ |
| 96 | 225 |
| 226 -- Constructible Set on α | |
| 122 | 227 -- Def X = record { def = λ y → ∀ (x : OD ) → y < X ∧ y < od→ord x } |
| 228 -- L (Φ 0) = Φ | |
| 229 -- L (OSuc lv n) = { Def ( L n ) } | |
| 230 -- L (Φ (Suc n)) = Union (L α) (α < Φ (Suc n) ) | |
| 141 | 231 L : {n : Level} → (α : Ordinal {suc n}) → OD {suc n} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
232 L {n} record { lv = Zero ; ord = (Φ .0) } = od∅ |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
233 L {n} record { lv = lx ; ord = (OSuc lv ox) } = Def ( L {n} ( record { lv = lx ; ord = ox } ) ) |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
234 L {n} record { lv = (Suc lx) ; ord = (Φ (Suc lx)) } = -- Union ( L α ) |
| 121 | 235 cseq ( Ord (od→ord (L {n} (record { lv = lx ; ord = Φ lx })))) |
| 89 | 236 |
| 167 | 237 -- L0 : {n : Level} → (α : Ordinal {suc n}) → L (osuc α) ∋ L α |
| 141 | 238 -- L1 : {n : Level} → (α β : Ordinal {suc n}) → α o< β → ∀ (x : OD {suc n}) → L α ∋ x → L β ∋ x |
| 122 | 239 |
| 170 | 240 |
| 141 | 241 OD→ZF : {n : Level} → ZF {suc (suc n)} {suc n} |
| 242 OD→ZF {n} = record { | |
| 243 ZFSet = OD {suc n} | |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
244 ; _∋_ = _∋_ |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
245 ; _≈_ = _==_ |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
246 ; ∅ = od∅ |
| 28 | 247 ; _,_ = _,_ |
| 248 ; Union = Union | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
249 ; Power = Power |
| 28 | 250 ; Select = Select |
| 251 ; Replace = Replace | |
| 161 | 252 ; infinite = infinite |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
253 ; isZF = isZF |
| 28 | 254 } where |
| 144 | 255 ZFSet = OD {suc n} |
| 141 | 256 Select : (X : OD {suc n} ) → ((x : OD {suc n} ) → Set (suc n) ) → OD {suc n} |
|
156
3e7475fb28db
differeent Union approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
155
diff
changeset
|
257 Select X ψ = record { def = λ x → ( def X x ∧ ψ ( ord→od x )) } |
| 141 | 258 Replace : OD {suc n} → (OD {suc n} → OD {suc n} ) → OD {suc n} |
| 259 Replace X ψ = record { def = λ x → (x o< sup-o ( λ x → od→ord (ψ (ord→od x )))) ∧ def (in-codomain X ψ) x } | |
| 260 _,_ : OD {suc n} → OD {suc n} → OD {suc n} | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
261 x , y = Ord (omax (od→ord x) (od→ord y)) |
| 144 | 262 _∩_ : ( A B : ZFSet ) → ZFSet |
| 145 | 263 A ∩ B = record { def = λ x → def A x ∧ def B x } |
|
156
3e7475fb28db
differeent Union approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
155
diff
changeset
|
264 Union : OD {suc n} → OD {suc n} |
|
3e7475fb28db
differeent Union approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
155
diff
changeset
|
265 Union U = record { def = λ x → ¬ (∀ (u : Ordinal ) → ¬ ((def U u) ∧ (def (ord→od u) x))) } |
| 54 | 266 _∈_ : ( A B : ZFSet ) → Set (suc n) |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
267 A ∈ B = B ∋ A |
| 54 | 268 _⊆_ : ( A B : ZFSet ) → ∀{ x : ZFSet } → Set (suc n) |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
269 _⊆_ A B {x} = A ∋ x → B ∋ x |
| 141 | 270 Power : OD {suc n} → OD {suc n} |
| 129 | 271 Power A = Replace (Def (Ord (od→ord A))) ( λ x → A ∩ x ) |
| 103 | 272 ｛_｝ : ZFSet → ZFSet |
| 273 ｛ x ｝ = ( x , x ) | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
274 |
| 161 | 275 data infinite-d : ( x : Ordinal {suc n} ) → Set (suc n) where |
| 276 iφ : infinite-d o∅ | |
| 277 isuc : {x : Ordinal {suc n} } → infinite-d x → | |
| 278 infinite-d (od→ord ( Union (ord→od x , (ord→od x , ord→od x ) ) )) | |
| 279 | |
| 280 infinite : OD {suc n} | |
| 281 infinite = record { def = λ x → infinite-d x } | |
| 282 | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
283 infixr 200 _∈_ |
| 96 | 284 -- infixr 230 _∩_ _∪_ |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
285 infixr 220 _⊆_ |
| 161 | 286 isZF : IsZF (OD {suc n}) _∋_ _==_ od∅ _,_ Union Power Select Replace infinite |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
287 isZF = record { |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
288 isEquivalence = record { refl = eq-refl ; sym = eq-sym; trans = eq-trans } |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
289 ; pair = pair |
| 72 | 290 ; union→ = union→ |
| 291 ; union← = union← | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
292 ; empty = empty |
| 129 | 293 ; power→ = power→ |
| 76 | 294 ; power← = power← |
| 295 ; extensionality = extensionality | |
| 183 | 296 ; ε-induction = ε-induction |
|
78
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
297 ; infinity∅ = infinity∅ |
| 160 | 298 ; infinity = infinity |
| 116 | 299 ; selection = λ {X} {ψ} {y} → selection {X} {ψ} {y} |
| 135 | 300 ; replacement← = replacement← |
| 301 ; replacement→ = replacement→ | |
| 183 | 302 ; choice-func = choice-func |
| 303 ; choice = choice | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
304 } where |
| 129 | 305 |
| 141 | 306 pair : (A B : OD {suc n} ) → ((A , B) ∋ A) ∧ ((A , B) ∋ B) |
| 87 | 307 proj1 (pair A B ) = omax-x {n} (od→ord A) (od→ord B) |
| 308 proj2 (pair A B ) = omax-y {n} (od→ord A) (od→ord B) | |
| 129 | 309 |
| 167 | 310 empty : {n : Level } (x : OD {suc n} ) → ¬ (od∅ ∋ x) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
311 empty x (case1 ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
312 empty x (case2 ()) |
| 129 | 313 |
| 151 | 314 ord-⊆ : ( t x : OD {suc n} ) → _⊆_ t (Ord (od→ord t )) {x} |
| 315 ord-⊆ t x lt = c<→o< lt | |
| 154 | 316 o<→c< : {x y : Ordinal {suc n}} {z : OD {suc n}}→ x o< y → _⊆_ (Ord x) (Ord y) {z} |
| 155 | 317 o<→c< lt lt1 = ordtrans lt1 lt |
| 318 | |
| 319 ⊆→o< : {x y : Ordinal {suc n}} → (∀ (z : OD) → _⊆_ (Ord x) (Ord y) {z} ) → x o< osuc y | |
| 320 ⊆→o< {x} {y} lt with trio< x y | |
| 321 ⊆→o< {x} {y} lt | tri< a ¬b ¬c = ordtrans a <-osuc | |
| 322 ⊆→o< {x} {y} lt | tri≈ ¬a b ¬c = subst ( λ k → k o< osuc y) (sym b) <-osuc | |
| 323 ⊆→o< {x} {y} lt | tri> ¬a ¬b c with lt (ord→od y) (o<-subst c (sym diso) refl ) | |
| 324 ... | ttt = ⊥-elim ( o<¬≡ refl (o<-subst ttt diso refl )) | |
| 151 | 325 |
| 144 | 326 union→ : (X z u : OD) → (X ∋ u) ∧ (u ∋ z) → Union X ∋ z |
|
157
afc030b7c8d0
explict logical definition of Union failed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
156
diff
changeset
|
327 union→ X z u xx not = ⊥-elim ( not (od→ord u) ( record { proj1 = proj1 xx |
|
afc030b7c8d0
explict logical definition of Union failed
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
156
diff
changeset
|
328 ; proj2 = subst ( λ k → def k (od→ord z)) (sym oiso) (proj2 xx) } )) |
| 159 | 329 union← : (X z : OD) (X∋z : Union X ∋ z) → ¬ ( (u : OD ) → ¬ ((X ∋ u) ∧ (u ∋ z ))) |
| 166 | 330 union← X z UX∋z = TransFiniteExists _ lemma UX∋z where |
| 165 | 331 lemma : {y : Ordinal} → def X y ∧ def (ord→od y) (od→ord z) → ¬ ((u : OD) → ¬ (X ∋ u) ∧ (u ∋ z)) |
| 332 lemma {y} xx not = not (ord→od y) record { proj1 = subst ( λ k → def X k ) (sym diso) (proj1 xx ) ; proj2 = proj2 xx } | |
| 144 | 333 |
| 334 ψiso : {ψ : OD {suc n} → Set (suc n)} {x y : OD {suc n}} → ψ x → x ≡ y → ψ y | |
| 335 ψiso {ψ} t refl = t | |
| 336 selection : {ψ : OD → Set (suc n)} {X y : OD} → ((X ∋ y) ∧ ψ y) ⇔ (Select X ψ ∋ y) | |
| 337 selection {ψ} {X} {y} = record { | |
| 338 proj1 = λ cond → record { proj1 = proj1 cond ; proj2 = ψiso {ψ} (proj2 cond) (sym oiso) } | |
| 339 ; proj2 = λ select → record { proj1 = proj1 select ; proj2 = ψiso {ψ} (proj2 select) oiso } | |
| 340 } | |
| 341 replacement← : {ψ : OD → OD} (X x : OD) → X ∋ x → Replace X ψ ∋ ψ x | |
| 342 replacement← {ψ} X x lt = record { proj1 = sup-c< ψ {x} ; proj2 = lemma } where | |
| 343 lemma : def (in-codomain X ψ) (od→ord (ψ x)) | |
| 150 | 344 lemma not = ⊥-elim ( not ( od→ord x ) (record { proj1 = lt ; proj2 = cong (λ k → od→ord (ψ k)) (sym oiso)} )) |
| 144 | 345 replacement→ : {ψ : OD → OD} (X x : OD) → (lt : Replace X ψ ∋ x) → ¬ ( (y : OD) → ¬ (x == ψ y)) |
| 150 | 346 replacement→ {ψ} X x lt = contra-position lemma (lemma2 (proj2 lt)) where |
| 347 lemma2 : ¬ ((y : Ordinal) → ¬ def X y ∧ ((od→ord x) ≡ od→ord (ψ (ord→od y)))) | |
| 348 → ¬ ((y : Ordinal) → ¬ def X y ∧ (ord→od (od→ord x) == ψ (ord→od y))) | |
| 144 | 349 lemma2 not not2 = not ( λ y d → not2 y (record { proj1 = proj1 d ; proj2 = lemma3 (proj2 d)})) where |
| 150 | 350 lemma3 : {y : Ordinal } → (od→ord x ≡ od→ord (ψ (ord→od y))) → (ord→od (od→ord x) == ψ (ord→od y)) |
| 144 | 351 lemma3 {y} eq = subst (λ k → ord→od (od→ord x) == k ) oiso (o≡→== eq ) |
| 150 | 352 lemma : ( (y : OD) → ¬ (x == ψ y)) → ( (y : Ordinal) → ¬ def X y ∧ (ord→od (od→ord x) == ψ (ord→od y)) ) |
| 353 lemma not y not2 = not (ord→od y) (subst (λ k → k == ψ (ord→od y)) oiso ( proj2 not2 )) | |
| 144 | 354 |
| 355 --- | |
| 356 --- Power Set | |
| 357 --- | |
| 358 --- First consider ordinals in OD | |
| 100 | 359 --- |
| 360 --- ZFSubset A x = record { def = λ y → def A y ∧ def x y } subset of A | |
| 361 --- Power X = ord→od ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) ) Power X is a sup of all subset of A | |
| 362 -- | |
| 363 -- | |
| 142 | 364 ∩-≡ : { a b : OD {suc n} } → ({x : OD {suc n} } → (a ∋ x → b ∋ x)) → a == ( b ∩ a ) |
| 365 ∩-≡ {a} {b} inc = record { | |
| 366 eq→ = λ {x} x<a → record { proj2 = x<a ; | |
| 367 proj1 = def-subst {suc n} {_} {_} {b} {x} (inc (def-subst {suc n} {_} {_} {a} {_} x<a refl (sym diso) )) refl diso } ; | |
| 368 eq← = λ {x} x<a∩b → proj2 x<a∩b } | |
| 100 | 369 -- |
| 370 -- we have t ∋ x → A ∋ x means t is a subset of A, that is ZFSubset A t == t | |
| 371 -- Power A is a sup of ZFSubset A t, so Power A ∋ t | |
| 372 -- | |
| 141 | 373 ord-power← : (a : Ordinal ) (t : OD) → ({x : OD} → (t ∋ x → (Ord a) ∋ x)) → Def (Ord a) ∋ t |
| 129 | 374 ord-power← a t t→A = def-subst {suc n} {_} {_} {Def (Ord a)} {od→ord t} |
| 127 | 375 lemma refl (lemma1 lemma-eq )where |
| 129 | 376 lemma-eq : ZFSubset (Ord a) t == t |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
377 eq→ lemma-eq {z} w = proj2 w |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
378 eq← lemma-eq {z} w = record { proj2 = w ; |
| 129 | 379 proj1 = def-subst {suc n} {_} {_} {(Ord a)} {z} |
| 126 | 380 ( t→A (def-subst {suc n} {_} {_} {t} {od→ord (ord→od z)} w refl (sym diso) )) refl diso } |
| 141 | 381 lemma1 : {n : Level } {a : Ordinal {suc n}} { t : OD {suc n}} |
| 129 | 382 → (eq : ZFSubset (Ord a) t == t) → od→ord (ZFSubset (Ord a) (ord→od (od→ord t))) ≡ od→ord t |
| 150 | 383 lemma1 {n} {a} {t} eq = subst (λ k → od→ord (ZFSubset (Ord a) k) ≡ od→ord t ) (sym oiso) (cong (λ k → od→ord k ) (==→o≡ eq )) |
| 129 | 384 lemma : od→ord (ZFSubset (Ord a) (ord→od (od→ord t)) ) o< sup-o (λ x → od→ord (ZFSubset (Ord a) (ord→od x))) |
| 98 | 385 lemma = sup-o< |
| 129 | 386 |
| 179 | 387 -- double-neg-eilm : {n : Level } {A : Set n} → ¬ ¬ A → A -- we don't have this in intutionistic logic |
| 144 | 388 -- |
| 389 -- Every set in OD is a subset of Ordinals | |
| 390 -- | |
| 142 | 391 -- Power A = Replace (Def (Ord (od→ord A))) ( λ y → A ∩ y ) |
| 166 | 392 |
| 393 -- we have oly double negation form because of the replacement axiom | |
| 394 -- | |
| 395 power→ : ( A t : OD) → Power A ∋ t → {x : OD} → t ∋ x → ¬ ¬ (A ∋ x) | |
| 396 power→ A t P∋t {x} t∋x = TransFiniteExists _ lemma5 lemma4 where | |
| 142 | 397 a = od→ord A |
| 398 lemma2 : ¬ ( (y : OD) → ¬ (t == (A ∩ y))) | |
| 399 lemma2 = replacement→ (Def (Ord (od→ord A))) t P∋t | |
| 166 | 400 lemma3 : (y : OD) → t == ( A ∩ y ) → ¬ ¬ (A ∋ x) |
| 401 lemma3 y eq not = not (proj1 (eq→ eq t∋x)) | |
| 142 | 402 lemma4 : ¬ ((y : Ordinal) → ¬ (t == (A ∩ ord→od y))) |
| 403 lemma4 not = lemma2 ( λ y not1 → not (od→ord y) (subst (λ k → t == ( A ∩ k )) (sym oiso) not1 )) | |
| 166 | 404 lemma5 : {y : Ordinal} → t == (A ∩ ord→od y) → ¬ ¬ (def A (od→ord x)) |
| 405 lemma5 {y} eq not = (lemma3 (ord→od y) eq) not | |
| 406 | |
| 142 | 407 power← : (A t : OD) → ({x : OD} → (t ∋ x → A ∋ x)) → Power A ∋ t |
| 408 power← A t t→A = record { proj1 = lemma1 ; proj2 = lemma2 } where | |
| 409 a = od→ord A | |
| 410 lemma0 : {x : OD} → t ∋ x → Ord a ∋ x | |
| 411 lemma0 {x} t∋x = c<→o< (t→A t∋x) | |
| 412 lemma3 : Def (Ord a) ∋ t | |
| 413 lemma3 = ord-power← a t lemma0 | |
| 152 | 414 lt1 : od→ord (A ∩ ord→od (od→ord t)) o< sup-o (λ x → od→ord (A ∩ ord→od x)) |
| 415 lt1 = sup-o< {suc n} {λ x → od→ord (A ∩ ord→od x)} {od→ord t} | |
| 416 lemma4 : (A ∩ ord→od (od→ord t)) ≡ t | |
| 417 lemma4 = let open ≡-Reasoning in begin | |
| 418 A ∩ ord→od (od→ord t) | |
| 419 ≡⟨ cong (λ k → A ∩ k) oiso ⟩ | |
| 420 A ∩ t | |
| 421 ≡⟨ sym (==→o≡ ( ∩-≡ t→A )) ⟩ | |
| 422 t | |
| 423 ∎ | |
| 142 | 424 lemma1 : od→ord t o< sup-o (λ x → od→ord (A ∩ ord→od x)) |
| 152 | 425 lemma1 = subst (λ k → od→ord k o< sup-o (λ x → od→ord (A ∩ ord→od x))) |
| 426 lemma4 (sup-o< {suc n} {λ x → od→ord (A ∩ ord→od x)} {od→ord t}) | |
| 142 | 427 lemma2 : def (in-codomain (Def (Ord (od→ord A))) (_∩_ A)) (od→ord t) |
| 151 | 428 lemma2 not = ⊥-elim ( not (od→ord t) (record { proj1 = lemma3 ; proj2 = lemma6 }) ) where |
| 429 lemma6 : od→ord t ≡ od→ord (A ∩ ord→od (od→ord t)) | |
| 430 lemma6 = cong ( λ k → od→ord k ) (==→o≡ (subst (λ k → t == (A ∩ k)) (sym oiso) ( ∩-≡ t→A ))) | |
| 142 | 431 |
| 141 | 432 regularity : (x : OD) (not : ¬ (x == od∅)) → |
| 115 | 433 (x ∋ minimul x not) ∧ (Select (minimul x not) (λ x₁ → (minimul x not ∋ x₁) ∧ (x ∋ x₁)) == od∅) |
| 117 | 434 proj1 (regularity x not ) = x∋minimul x not |
| 435 proj2 (regularity x not ) = record { eq→ = lemma1 ; eq← = λ {y} d → lemma2 {y} d } where | |
| 436 lemma1 : {x₁ : Ordinal} → def (Select (minimul x not) (λ x₂ → (minimul x not ∋ x₂) ∧ (x ∋ x₂))) x₁ → def od∅ x₁ | |
| 437 lemma1 {x₁} s = ⊥-elim ( minimul-1 x not (ord→od x₁) lemma3 ) where | |
| 438 lemma3 : def (minimul x not) (od→ord (ord→od x₁)) ∧ def x (od→ord (ord→od x₁)) | |
| 142 | 439 lemma3 = record { proj1 = def-subst {suc n} {_} {_} {minimul x not} {_} (proj1 s) refl (sym diso) |
| 440 ; proj2 = proj2 (proj2 s) } | |
| 117 | 441 lemma2 : {x₁ : Ordinal} → def od∅ x₁ → def (Select (minimul x not) (λ x₂ → (minimul x not ∋ x₂) ∧ (x ∋ x₂))) x₁ |
| 442 lemma2 {y} d = ⊥-elim (empty (ord→od y) (def-subst {suc n} {_} {_} {od∅} {od→ord (ord→od y)} d refl (sym diso) )) | |
| 129 | 443 |
| 141 | 444 extensionality : {A B : OD {suc n}} → ((z : OD) → (A ∋ z) ⇔ (B ∋ z)) → A == B |
| 76 | 445 eq→ (extensionality {A} {B} eq ) {x} d = def-iso {suc n} {A} {B} (sym diso) (proj1 (eq (ord→od x))) d |
| 446 eq← (extensionality {A} {B} eq ) {x} d = def-iso {suc n} {B} {A} (sym diso) (proj2 (eq (ord→od x))) d | |
| 129 | 447 |
| 161 | 448 infinity∅ : infinite ∋ od∅ {suc n} |
| 449 infinity∅ = def-subst {suc n} {_} {_} {infinite} {od→ord (od∅ {suc n})} iφ refl lemma where | |
| 450 lemma : o∅ ≡ od→ord od∅ | |
| 451 lemma = let open ≡-Reasoning in begin | |
| 452 o∅ | |
| 453 ≡⟨ sym diso ⟩ | |
| 454 od→ord ( ord→od o∅ ) | |
| 455 ≡⟨ cong ( λ k → od→ord k ) o∅≡od∅ ⟩ | |
| 456 od→ord od∅ | |
| 457 ∎ | |
| 458 infinity : (x : OD) → infinite ∋ x → infinite ∋ Union (x , (x , x )) | |
| 459 infinity x lt = def-subst {suc n} {_} {_} {infinite} {od→ord (Union (x , (x , x )))} ( isuc {od→ord x} lt ) refl lemma where | |
| 460 lemma : od→ord (Union (ord→od (od→ord x) , (ord→od (od→ord x) , ord→od (od→ord x)))) | |
| 461 ≡ od→ord (Union (x , (x , x))) | |
| 462 lemma = cong (λ k → od→ord (Union ( k , ( k , k ) ))) oiso | |
| 463 | |
| 179 | 464 -- Axiom of choice ( is equivalent to the existence of minimul in our case ) |
| 162 | 465 -- ∀ X [ ∅ ∉ X → (∃ f : X → ⋃ X ) → ∀ A ∈ X ( f ( A ) ∈ A ) ] |
| 466 choice-func : (X : OD {suc n} ) → {x : OD } → ¬ ( x == od∅ ) → ( X ∋ x ) → OD | |
| 467 choice-func X {x} not X∋x = minimul x not | |
| 468 choice : (X : OD {suc n} ) → {A : OD } → ( X∋A : X ∋ A ) → (not : ¬ ( A == od∅ )) → A ∋ choice-func X not X∋A | |
| 469 choice X {A} X∋A not = x∋minimul A not | |
|
78
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
470 |
| 176 | 471 -- another form of regularity |
| 472 -- | |
| 473 ε-induction : {n m : Level} { ψ : OD {suc n} → Set m} | |
| 474 → ( {x : OD {suc n} } → ({ y : OD {suc n} } → x ∋ y → ψ y ) → ψ x ) | |
| 475 → (x : OD {suc n} ) → ψ x | |
| 476 ε-induction {n} {m} {ψ} ind x = subst (λ k → ψ k ) oiso (ε-induction-ord (lv (osuc (od→ord x))) (ord (osuc (od→ord x))) <-osuc) where | |
| 477 ε-induction-ord : (lx : Nat) ( ox : OrdinalD {suc n} lx ) {ly : Nat} {oy : OrdinalD {suc n} ly } | |
| 478 → (ly < lx) ∨ (oy d< ox ) → ψ (ord→od (record { lv = ly ; ord = oy } ) ) | |
| 479 ε-induction-ord Zero (Φ 0) (case1 ()) | |
| 480 ε-induction-ord Zero (Φ 0) (case2 ()) | |
| 481 ε-induction-ord lx (OSuc lx ox) {ly} {oy} y<x = | |
| 482 ind {ord→od (record { lv = ly ; ord = oy })} ( λ {y} lt → subst (λ k → ψ k ) oiso (ε-induction-ord lx ox (lemma y lt ))) where | |
| 483 lemma : (y : OD) → ord→od record { lv = ly ; ord = oy } ∋ y → od→ord y o< record { lv = lx ; ord = ox } | |
| 484 lemma y lt with osuc-≡< y<x | |
| 485 lemma y lt | case1 refl = o<-subst (c<→o< lt) refl diso | |
| 486 lemma y lt | case2 lt1 = ordtrans (o<-subst (c<→o< lt) refl diso) lt1 | |
| 487 ε-induction-ord (Suc lx) (Φ (Suc lx)) {ly} {oy} (case1 y<sox ) = | |
| 488 ind {ord→od (record { lv = ly ; ord = oy })} ( λ {y} lt → lemma y lt ) where | |
| 179 | 489 -- |
| 490 -- if lv of z if less than x Ok | |
| 491 -- else lv z = lv x. We can create OSuc of z which is larger than z and less than x in lemma | |
| 492 -- | |
| 493 -- lx Suc lx (1) lz(a) <lx by case1 | |
| 494 -- ly(1) ly(2) (2) lz(b) <lx by case1 | |
| 495 -- lz(a) lz(b) lz(c) lz(c) <lx by case2 ( ly==lz==lx) | |
| 496 -- | |
| 176 | 497 lemma0 : { lx ly : Nat } → ly < Suc lx → lx < ly → ⊥ |
| 498 lemma0 {Suc lx} {Suc ly} (s≤s lt1) (s≤s lt2) = lemma0 lt1 lt2 | |
| 499 lemma1 : {n : Level } {ly : Nat} {oy : OrdinalD {suc n} ly} → lv (od→ord (ord→od (record { lv = ly ; ord = oy }))) ≡ ly | |
| 500 lemma1 {n} {ly} {oy} = let open ≡-Reasoning in begin | |
| 501 lv (od→ord (ord→od (record { lv = ly ; ord = oy }))) | |
| 502 ≡⟨ cong ( λ k → lv k ) diso ⟩ | |
| 503 lv (record { lv = ly ; ord = oy }) | |
| 504 ≡⟨⟩ | |
| 505 ly | |
| 506 ∎ | |
| 507 lemma : (z : OD) → ord→od record { lv = ly ; ord = oy } ∋ z → ψ z | |
| 508 lemma z lt with c<→o< {suc n} {z} {ord→od (record { lv = ly ; ord = oy })} lt | |
| 509 lemma z lt | case1 lz<ly with <-cmp lx ly | |
| 510 lemma z lt | case1 lz<ly | tri< a ¬b ¬c = ⊥-elim ( lemma0 y<sox a) -- can't happen | |
| 180 | 511 lemma z lt | case1 lz<ly | tri≈ ¬a refl ¬c = -- ly(1) |
| 176 | 512 subst (λ k → ψ k ) oiso (ε-induction-ord lx (Φ lx) {_} {ord (od→ord z)} (case1 (subst (λ k → lv (od→ord z) < k ) lemma1 lz<ly ) )) |
| 180 | 513 lemma z lt | case1 lz<ly | tri> ¬a ¬b c = -- lz(a) |
| 176 | 514 subst (λ k → ψ k ) oiso (ε-induction-ord lx (Φ lx) {_} {ord (od→ord z)} (case1 (<-trans lz<ly (subst (λ k → k < lx ) (sym lemma1) c)))) |
| 515 lemma z lt | case2 lz=ly with <-cmp lx ly | |
| 516 lemma z lt | case2 lz=ly | tri< a ¬b ¬c = ⊥-elim ( lemma0 y<sox a) -- can't happen | |
| 180 | 517 lemma z lt | case2 lz=ly | tri> ¬a ¬b c with d<→lv lz=ly -- lz(b) |
| 179 | 518 ... | eq = subst (λ k → ψ k ) oiso |
| 519 (ε-induction-ord lx (Φ lx) {_} {ord (od→ord z)} (case1 (subst (λ k → k < lx ) (trans (sym lemma1)(sym eq) ) c ))) | |
| 180 | 520 lemma z lt | case2 lz=ly | tri≈ ¬a lx=ly ¬c with d<→lv lz=ly -- lz(c) |
| 179 | 521 ... | eq = lemma6 {ly} {Φ lx} {oy} lx=ly (sym (subst (λ k → lv (od→ord z) ≡ k) lemma1 eq)) where |
| 176 | 522 lemma5 : (ox : OrdinalD lx) → (lv (od→ord z) < lx) ∨ (ord (od→ord z) d< ox) → ψ z |
| 523 lemma5 ox lt = subst (λ k → ψ k ) oiso (ε-induction-ord lx ox lt ) | |
| 524 lemma6 : { ly : Nat } { ox : OrdinalD {suc n} lx } { oy : OrdinalD {suc n} ly } → | |
| 179 | 525 lx ≡ ly → ly ≡ lv (od→ord z) → ψ z |
| 176 | 526 lemma6 {ly} {ox} {oy} refl refl = lemma5 (OSuc lx (ord (od→ord z)) ) (case2 s<refl) |
| 527 |