Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate HOD.agda @ 118:78fe704c3543
Union done
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Wed, 26 Jun 2019 20:32:30 +0900 |
| parents | a4c97390d312 |
| children | 6e264c78e420 |
| rev | line source |
|---|---|
| 16 | 1 open import Level |
| 112 | 2 module HOD 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 |
| 112 | 16 record HOD {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 |
| 114 | 19 otrans : {x : Ordinal {n} } → def x → { y : Ordinal {n} } → y o< x → def y |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
20 |
| 112 | 21 open HOD |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
22 open import Data.Unit |
|
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
23 |
|
44
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
24 open Ordinal |
|
fcac01485f32
od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
43
diff
changeset
|
25 |
| 112 | 26 record _==_ {n : Level} ( a b : HOD {n} ) : Set n where |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
27 field |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
28 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
|
29 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
|
30 |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
31 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
|
32 id x = x |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
33 |
| 112 | 34 eq-refl : {n : Level} { x : HOD {n} } → x == x |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
35 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
|
36 |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
37 open _==_ |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
38 |
| 112 | 39 eq-sym : {n : Level} { x y : HOD {n} } → x == y → y == x |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
40 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
|
41 |
| 112 | 42 eq-trans : {n : Level} { x y z : HOD {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
|
43 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
|
44 |
| 112 | 45 -- Ordinal in HOD ( and ZFSet ) |
| 46 Ord : { n : Level } → ( a : Ordinal {n} ) → HOD {n} | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
47 Ord {n} a = record { def = λ y → y o< a ; otrans = lemma } where |
| 114 | 48 lemma : {x : Ordinal} → x o< a → {y : Ordinal} → y o< x → y o< a |
| 49 lemma {x} x<a {y} y<x = ordtrans {n} {y} {x} {a} y<x x<a | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
50 |
| 112 | 51 od∅ : {n : Level} → HOD {n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
52 od∅ {n} = Ord o∅ |
| 40 | 53 |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
54 postulate |
| 112 | 55 -- HOD can be iso to a subset of Ordinal ( by means of Godel Set ) |
| 56 od→ord : {n : Level} → HOD {n} → Ordinal {n} | |
| 113 | 57 ord→od : {n : Level} → Ordinal {n} → HOD {n} |
| 58 oiso : {n : Level} {x : HOD {n}} → ord→od ( od→ord x ) ≡ x | |
| 59 diso : {n : Level} {x : Ordinal {n}} → od→ord ( ord→od x ) ≡ x | |
| 112 | 60 c<→o< : {n : Level} {x y : HOD {n} } → def y ( od→ord x ) → od→ord x o< od→ord y |
| 116 | 61 ord-Ord :{n : Level} {x : Ordinal {n}} → x ≡ od→ord (Ord x) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
62 -- next assumption causes ∀ x ∋ ∅ . It menas only an ordinal becomes a set |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
63 -- o<→c< : {n : Level} {x y : Ordinal {n} } → x o< y → def (ord→od y) x |
| 100 | 64 -- supermum as Replacement Axiom |
| 95 | 65 sup-o : {n : Level } → ( Ordinal {n} → Ordinal {n}) → Ordinal {n} |
| 98 | 66 sup-o< : {n : Level } → { ψ : Ordinal {n} → Ordinal {n}} → ∀ {x : Ordinal {n}} → ψ x o< sup-o ψ |
| 111 | 67 -- contra-position of mimimulity of supermum required in Power Set Axiom |
| 98 | 68 sup-x : {n : Level } → ( Ordinal {n} → Ordinal {n}) → Ordinal {n} |
| 69 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
|
70 -- sup-lb : {n : Level } → ( ψ : Ordinal {n} → Ordinal {n}) → ( ∀ {x : Ordinal {n}} → ψx o< z ) → z o< osuc ( sup-o ψ ) |
| 117 | 71 minimul : {n : Level } → (x : HOD {suc n} ) → ¬ (x == od∅ )→ HOD {suc n} |
| 72 -- this should be ¬ (x == od∅ )→ ∃ ox → x ∋ Ord ox ( minimum of x ) | |
| 73 x∋minimul : {n : Level } → (x : HOD {suc n} ) → ( ne : ¬ (x == od∅ ) ) → def x ( od→ord ( minimul x ne ) ) | |
| 74 minimul-1 : {n : Level } → (x : HOD {suc n} ) → ( ne : ¬ (x == od∅ ) ) → (y : HOD {suc n}) → ¬ ( def (minimul x ne) (od→ord y)) ∧ (def x (od→ord y) ) | |
| 95 | 75 |
| 112 | 76 _∋_ : { n : Level } → ( a x : HOD {n} ) → Set n |
| 95 | 77 _∋_ {n} a x = def a ( od→ord x ) |
| 78 | |
| 112 | 79 _c<_ : { n : Level } → ( x a : HOD {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
|
80 x c< a = a ∋ x |
| 103 | 81 |
| 112 | 82 _c≤_ : {n : Level} → HOD {n} → HOD {n} → Set (suc n) |
| 95 | 83 a c≤ b = (a ≡ b) ∨ ( b ∋ a ) |
| 84 | |
| 113 | 85 cseq : {n : Level} → HOD {n} → HOD {n} |
| 118 | 86 cseq x = record { def = λ y → def x (osuc y) ; otrans = lemma } where |
| 87 lemma : {ox : Ordinal} → def x (osuc ox) → { oy : Ordinal}→ oy o< ox → def x (osuc oy) | |
| 88 lemma {ox} oox<Ox {oy} oy<ox = otrans x oox<Ox (osucc oy<ox ) | |
| 113 | 89 |
| 112 | 90 def-subst : {n : Level } {Z : HOD {n}} {X : Ordinal {n} }{z : HOD {n}} {x : Ordinal {n} }→ def Z X → Z ≡ z → X ≡ x → def z x |
| 95 | 91 def-subst df refl refl = df |
| 92 | |
| 113 | 93 o<→c< : {n : Level} {x y : Ordinal {n} } → x o< y → Ord y ∋ Ord x |
| 94 o<→c< {n} {x} {y} lt = subst ( λ k → k o< y ) ord-Ord lt | |
| 95 | |
| 112 | 96 sup-od : {n : Level } → ( HOD {n} → HOD {n}) → HOD {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 |
| 112 | 99 sup-c< : {n : Level } → ( ψ : HOD {n} → HOD {n}) → ∀ {x : HOD {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 |
| 37 | 105 ∅3 : {n : Level} → { x : Ordinal {n}} → ( ∀(y : Ordinal {n}) → ¬ (y o< x ) ) → x ≡ o∅ {n} |
| 81 | 106 ∅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
|
107 c0 : Nat → Ordinal {n} → Set n |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
108 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
|
109 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
|
110 c2 Zero not = refl |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
111 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
|
112 ... | t with t (case1 ≤-refl ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
113 c2 (Suc lx) not | t | () |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
114 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
|
115 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
|
116 ... | t with t (case2 Φ< ) |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
117 c3 lx (Φ .lx) d not | t | () |
|
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
118 c3 lx (OSuc .lx x₁) d not with not ( record { lv = lx ; ord = OSuc lx x₁ } ) |
| 34 | 119 ... | 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
|
120 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
|
121 |
| 112 | 122 transitive : {n : Level } { z y x : HOD {suc n} } → z ∋ y → y ∋ x → z ∋ x |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
123 transitive {n} {z} {y} {x} z∋y x∋y with ordtrans ( c<→o< {suc n} {x} {y} x∋y ) ( c<→o< {suc n} {y} {z} z∋y ) |
| 111 | 124 ... | t = otrans z z∋y (c<→o< {suc n} {x} {y} x∋y ) |
| 36 | 125 |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
126 record Minimumo {n : Level } (x : Ordinal {n}) : Set (suc n) where |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
127 field |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
128 mino : Ordinal {n} |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
129 min<x : mino o< x |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
130 |
| 57 | 131 ∅5 : {n : Level} → { x : Ordinal {n} } → ¬ ( x ≡ o∅ {n} ) → o∅ {n} o< x |
| 132 ∅5 {n} {record { lv = Zero ; ord = (Φ .0) }} not = ⊥-elim (not refl) | |
| 133 ∅5 {n} {record { lv = Zero ; ord = (OSuc .0 ord) }} not = case2 Φ< | |
| 134 ∅5 {n} {record { lv = (Suc lv) ; ord = ord }} not = case1 (s≤s z≤n) | |
| 37 | 135 |
| 46 | 136 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 } |
| 137 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
|
138 |
| 51 | 139 -- avoiding lv != Zero error |
| 112 | 140 orefl : {n : Level} → { x : HOD {n} } → { y : Ordinal {n} } → od→ord x ≡ y → od→ord x ≡ y |
| 51 | 141 orefl refl = refl |
| 142 | |
| 112 | 143 ==-iso : {n : Level} → { x y : HOD {n} } → ord→od (od→ord x) == ord→od (od→ord y) → x == y |
| 51 | 144 ==-iso {n} {x} {y} eq = record { |
| 145 eq→ = λ d → lemma ( eq→ eq (def-subst d (sym oiso) refl )) ; | |
| 146 eq← = λ d → lemma ( eq← eq (def-subst d (sym oiso) refl )) } | |
| 147 where | |
| 112 | 148 lemma : {x : HOD {n} } {z : Ordinal {n}} → def (ord→od (od→ord x)) z → def x z |
| 51 | 149 lemma {x} {z} d = def-subst d oiso refl |
| 150 | |
| 112 | 151 =-iso : {n : Level } {x y : HOD {suc n} } → (x == y) ≡ (ord→od (od→ord x) == y) |
| 57 | 152 =-iso {_} {_} {y} = cong ( λ k → k == y ) (sym oiso) |
| 153 | |
| 112 | 154 ord→== : {n : Level} → { x y : HOD {n} } → od→ord x ≡ od→ord y → x == y |
| 51 | 155 ord→== {n} {x} {y} eq = ==-iso (lemma (od→ord x) (od→ord y) (orefl eq)) where |
| 156 lemma : ( ox oy : Ordinal {n} ) → ox ≡ oy → (ord→od ox) == (ord→od oy) | |
| 157 lemma ox ox refl = eq-refl | |
| 158 | |
| 159 o≡→== : {n : Level} → { x y : Ordinal {n} } → x ≡ y → ord→od x == ord→od y | |
| 160 o≡→== {n} {x} {.x} refl = eq-refl | |
| 161 | |
| 162 >→¬< : {x y : Nat } → (x < y ) → ¬ ( y < x ) | |
| 163 >→¬< (s≤s x<y) (s≤s y<x) = >→¬< x<y y<x | |
| 164 | |
| 112 | 165 c≤-refl : {n : Level} → ( x : HOD {n} ) → x c≤ x |
| 51 | 166 c≤-refl x = case1 refl |
| 167 | |
| 112 | 168 ∋→o< : {n : Level} → { a x : HOD {suc n} } → a ∋ x → od→ord x o< od→ord a |
| 91 | 169 ∋→o< {n} {a} {x} lt = t where |
| 170 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
|
171 t = c<→o< {suc n} {x} {a} lt |
| 91 | 172 |
| 80 | 173 o∅≡od∅ : {n : Level} → ord→od (o∅ {suc n}) ≡ od∅ {suc n} |
| 174 o∅≡od∅ {n} with trio< {n} (o∅ {suc n}) (od→ord (od∅ {suc n} )) | |
| 175 o∅≡od∅ {n} | tri< a ¬b ¬c = ⊥-elim (lemma a) where | |
| 176 lemma : o∅ {suc n } o< (od→ord (od∅ {suc n} )) → ⊥ | |
| 113 | 177 lemma lt with o<→c< lt |
| 178 lemma lt | t = o<¬≡ refl t | |
| 80 | 179 o∅≡od∅ {n} | tri≈ ¬a b ¬c = trans (cong (λ k → ord→od k ) b ) oiso |
| 180 o∅≡od∅ {n} | tri> ¬a ¬b c = ⊥-elim (¬x<0 c) | |
| 181 | |
| 112 | 182 o<→¬c> : {n : Level} → { x y : HOD {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
|
183 o<→¬c> {n} {x} {y} olt clt = o<> olt (c<→o< clt ) where |
| 51 | 184 |
| 112 | 185 o≡→¬c< : {n : Level} → { x y : HOD {n} } → (od→ord x ) ≡ ( od→ord y) → ¬ x c< y |
| 111 | 186 o≡→¬c< {n} {x} {y} oeq lt = o<¬≡ (orefl oeq ) (c<→o< lt) |
| 54 | 187 |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
188 ∅0 : {n : Level} → record { def = λ x → Lift n ⊥ ; otrans = λ () } == od∅ {n} |
|
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} (lift ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
190 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
|
191 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
|
192 |
| 112 | 193 ∅< : {n : Level} → { x y : HOD {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
|
194 ∅< {n} {x} {y} d eq with eq→ (eq-trans eq (eq-sym ∅0) ) d |
| 60 | 195 ∅< {n} {x} {y} d eq | lift () |
| 57 | 196 |
| 112 | 197 -- ∅6 : {n : Level} → { x : HOD {suc n} } → ¬ ( x ∋ x ) -- no Russel paradox |
| 111 | 198 -- ∅6 {n} {x} x∋x = c<> {n} {x} {x} x∋x x∋x |
| 51 | 199 |
| 112 | 200 def-iso : {n : Level} {A B : HOD {n}} {x y : Ordinal {n}} → x ≡ y → (def A y → def B y) → def A x → def B x |
| 76 | 201 def-iso refl t = t |
| 202 | |
| 57 | 203 is-o∅ : {n : Level} → ( x : Ordinal {suc n} ) → Dec ( x ≡ o∅ {suc n} ) |
| 204 is-o∅ {n} record { lv = Zero ; ord = (Φ .0) } = yes refl | |
| 205 is-o∅ {n} record { lv = Zero ; ord = (OSuc .0 ord₁) } = no ( λ () ) | |
| 206 is-o∅ {n} record { lv = (Suc lv₁) ; ord = ord } = no (λ()) | |
| 207 | |
|
45
33860eb44e47
od∅' {n} = ord→od (o∅ {n})
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
44
diff
changeset
|
208 open _∧_ |
|
33860eb44e47
od∅' {n} = ord→od (o∅ {n})
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
44
diff
changeset
|
209 |
| 79 | 210 -- open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ ) |
| 94 | 211 -- 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
|
212 |
| 112 | 213 csuc : {n : Level} → HOD {suc n} → HOD {suc n} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
214 csuc x = ord→od ( osuc ( od→ord x )) |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
215 |
| 96 | 216 -- 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
|
217 |
| 112 | 218 ZFSubset : {n : Level} → (A x : HOD {suc n} ) → HOD {suc n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
219 ZFSubset A x = record { def = λ y → def A y ∧ def x y ; otrans = {!!} } |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
220 |
| 112 | 221 Def : {n : Level} → (A : HOD {suc n}) → HOD {suc n} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
222 Def {n} A = ord→od ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) ) |
| 96 | 223 |
| 224 -- Constructible Set on α | |
| 112 | 225 L : {n : Level} → (α : Ordinal {suc n}) → HOD {suc n} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
226 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
|
227 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
|
228 L {n} record { lv = (Suc lx) ; ord = (Φ (Suc lx)) } = -- Union ( L α ) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
229 record { def = λ y → osuc y o< (od→ord (L {n} (record { lv = lx ; ord = Φ lx }) )) ; otrans = {!!} } |
| 89 | 230 |
| 111 | 231 omega : { n : Level } → Ordinal {n} |
| 232 omega = record { lv = Suc Zero ; ord = Φ 1 } | |
| 233 | |
| 112 | 234 HOD→ZF : {n : Level} → ZF {suc (suc n)} {suc n} |
| 235 HOD→ZF {n} = record { | |
| 236 ZFSet = HOD {suc n} | |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
237 ; _∋_ = _∋_ |
|
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
238 ; _≈_ = _==_ |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
239 ; ∅ = od∅ |
| 28 | 240 ; _,_ = _,_ |
| 241 ; Union = Union | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
242 ; Power = Power |
| 28 | 243 ; Select = Select |
| 244 ; Replace = Replace | |
| 111 | 245 ; infinite = Ord omega |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
246 ; isZF = isZF |
| 28 | 247 } where |
| 112 | 248 Replace : HOD {suc n} → (HOD {suc n} → HOD {suc n} ) → HOD {suc n} |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
249 Replace X ψ = sup-od ψ |
| 115 | 250 Select : (X : HOD {suc n} ) → ((x : HOD {suc n} ) → Set (suc n) ) → HOD {suc n} |
| 116 | 251 Select X ψ = record { def = λ x → ((y : Ordinal {suc n} ) → X ∋ ord→od y → ψ (ord→od y)) ∧ (X ∋ ord→od x ) ; otrans = lemma } where |
| 252 lemma : {x : Ordinal} → ((y : Ordinal) → X ∋ ord→od y → ψ (ord→od y)) ∧ (X ∋ ord→od x) → | |
| 253 {y : Ordinal} → y o< x → ((y₁ : Ordinal) → X ∋ ord→od y₁ → ψ (ord→od y₁)) ∧ (X ∋ ord→od y) | |
| 115 | 254 lemma {x} select {y} y<x = record { proj1 = proj1 select ; proj2 = y<X } where |
| 255 y<X : X ∋ ord→od y | |
| 256 y<X = otrans X (proj2 select) (o<-subst y<x (sym diso) (sym diso) ) | |
| 112 | 257 _,_ : HOD {suc n} → HOD {suc n} → HOD {suc n} |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
258 x , y = Ord (omax (od→ord x) (od→ord y)) |
| 112 | 259 Union : HOD {suc n} → HOD {suc n} |
| 113 | 260 Union U = cseq U |
| 77 | 261 -- power : ∀ X ∃ A ∀ t ( t ∈ A ↔ ( ∀ {x} → t ∋ x → X ∋ x ) |
| 112 | 262 Power : HOD {suc n} → HOD {suc n} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
263 Power A = Def A |
| 112 | 264 ZFSet = HOD {suc n} |
| 54 | 265 _∈_ : ( 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
|
266 A ∈ B = B ∋ A |
| 54 | 267 _⊆_ : ( 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
|
268 _⊆_ A B {x} = A ∋ x → B ∋ x |
| 103 | 269 _∩_ : ( A B : ZFSet ) → ZFSet |
| 115 | 270 A ∩ B = Select (A , B) ( λ x → ( A ∋ x ) ∧ (B ∋ x) ) |
| 96 | 271 -- _∪_ : ( A B : ZFSet ) → ZFSet |
| 272 -- A ∪ B = Select (A , B) ( λ x → (A ∋ x) ∨ ( B ∋ x ) ) | |
| 103 | 273 ｛_｝ : ZFSet → ZFSet |
| 274 ｛ 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
|
275 |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
276 infixr 200 _∈_ |
| 96 | 277 -- infixr 230 _∩_ _∪_ |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
278 infixr 220 _⊆_ |
| 112 | 279 isZF : IsZF (HOD {suc n}) _∋_ _==_ od∅ _,_ Union Power Select Replace (Ord omega) |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
280 isZF = record { |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
281 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
|
282 ; pair = pair |
| 118 | 283 ; union-u = λ X z UX∋z → union-u {X} {z} UX∋z |
| 72 | 284 ; union→ = union→ |
| 285 ; union← = union← | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
286 ; empty = empty |
| 76 | 287 ; power→ = power→ |
| 288 ; power← = power← | |
| 289 ; extensionality = extensionality | |
|
30
3b0fdb95618e
problem on Ordinal ( OSuc ℵ )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
29
diff
changeset
|
290 ; minimul = minimul |
| 51 | 291 ; regularity = regularity |
|
78
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
292 ; infinity∅ = infinity∅ |
| 93 | 293 ; infinity = λ _ → infinity |
| 116 | 294 ; selection = λ {X} {ψ} {y} → selection {X} {ψ} {y} |
| 93 | 295 ; replacement = replacement |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
296 } where |
|
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
297 open _∧_ |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
298 open Minimumo |
| 112 | 299 pair : (A B : HOD {suc n} ) → ((A , B) ∋ A) ∧ ((A , B) ∋ B) |
| 87 | 300 proj1 (pair A B ) = omax-x {n} (od→ord A) (od→ord B) |
| 301 proj2 (pair A B ) = omax-y {n} (od→ord A) (od→ord B) | |
| 112 | 302 empty : (x : HOD {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
|
303 empty x (case1 ()) |
|
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
304 empty x (case2 ()) |
| 100 | 305 --- |
| 306 --- ZFSubset A x = record { def = λ y → def A y ∧ def x y } subset of A | |
| 307 --- Power X = ord→od ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) ) Power X is a sup of all subset of A | |
| 308 -- | |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
309 -- if Power A ∋ t, from a propertiy of minimum sup there is osuc ZFSubset A ∋ t |
| 100 | 310 -- then ZFSubset A ≡ t or ZFSubset A ∋ t. In the former case ZFSubset A ∋ x implies A ∋ x |
| 311 -- In case of later, ZFSubset A ∋ t and t ∋ x implies ZFSubset A ∋ x by transitivity | |
| 312 -- | |
| 112 | 313 power→ : (A t : HOD) → Power A ∋ t → {x : HOD} → t ∋ x → A ∋ x |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
314 power→ A t P∋t {x} t∋x = proj1 lemma-s where |
| 112 | 315 minsup : HOD |
|
99
74330d0cdcbc
Power Set done with min-sup assumption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
98
diff
changeset
|
316 minsup = ZFSubset A ( ord→od ( sup-x (λ x → od→ord ( ZFSubset A (ord→od x))))) |
|
74330d0cdcbc
Power Set done with min-sup assumption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
98
diff
changeset
|
317 lemma-t : csuc minsup ∋ t |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
318 lemma-t = {!!} -- o<→c< (o<-subst (sup-lb (o<-subst (c<→o< P∋t) refl diso )) refl refl ) |
| 98 | 319 lemma-s : ZFSubset A ( ord→od ( sup-x (λ x → od→ord ( ZFSubset A (ord→od x))))) ∋ x |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
320 lemma-s with osuc-≡< ( o<-subst (c<→o< lemma-t ) refl diso ) |
| 111 | 321 lemma-s | case1 eq = def-subst {!!} oiso refl |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
322 lemma-s | case2 lt = transitive {n} {minsup} {t} {x} (def-subst {!!} oiso refl ) t∋x |
| 100 | 323 -- |
| 324 -- we have t ∋ x → A ∋ x means t is a subset of A, that is ZFSubset A t == t | |
| 325 -- Power A is a sup of ZFSubset A t, so Power A ∋ t | |
| 326 -- | |
| 112 | 327 power← : (A t : HOD) → ({x : HOD} → (t ∋ x → A ∋ x)) → Power A ∋ t |
|
99
74330d0cdcbc
Power Set done with min-sup assumption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
98
diff
changeset
|
328 power← A t t→A = def-subst {suc n} {_} {_} {Power A} {od→ord t} |
| 103 | 329 {!!} refl lemma1 where |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
330 lemma-eq : ZFSubset A t == t |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
331 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
|
332 eq← lemma-eq {z} w = record { proj2 = w ; |
|
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
333 proj1 = def-subst {suc n} {_} {_} {A} {z} ( t→A (def-subst {suc n} {_} {_} {t} {od→ord (ord→od z)} w refl (sym diso) )) refl diso } |
|
99
74330d0cdcbc
Power Set done with min-sup assumption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
98
diff
changeset
|
334 lemma1 : od→ord (ZFSubset A (ord→od (od→ord t))) ≡ od→ord t |
| 111 | 335 lemma1 = subst (λ k → od→ord (ZFSubset A k) ≡ od→ord t ) (sym oiso) {!!} |
|
97
f2b579106770
power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
96
diff
changeset
|
336 lemma : od→ord (ZFSubset A (ord→od (od→ord t)) ) o< sup-o (λ x → od→ord (ZFSubset A (ord→od x))) |
| 98 | 337 lemma = sup-o< |
| 118 | 338 union-u : {X z : HOD {suc n}} → (U>z : Union X ∋ z ) → HOD {suc n} |
| 339 union-u {X} {z} U>z = Ord ( osuc ( od→ord z ) ) | |
| 112 | 340 union→ : (X z u : HOD) → (X ∋ u) ∧ (u ∋ z) → Union X ∋ z |
| 118 | 341 union→ X z u xx with trio< ( od→ord u ) ( osuc ( od→ord z )) |
| 342 union→ X z u xx | tri< a ¬b ¬c with osuc-< a (c<→o< (proj2 xx)) | |
| 343 union→ X z u xx | tri< a ¬b ¬c | () | |
| 344 union→ X z u xx | tri≈ ¬a b ¬c = def-subst {suc n} {_} {_} {X} {osuc (od→ord z)} (proj1 xx) refl b where | |
| 345 union→ X z u xx | tri> ¬a ¬b c = otrans X (proj1 xx) c | |
| 346 union← : (X z : HOD) (X∋z : Union X ∋ z) → (X ∋ union-u {X} {z} X∋z ) ∧ (union-u {X} {z} X∋z ∋ z ) | |
| 347 union← X z X∋z = record { proj1 = lemma ; proj2 = <-osuc } where | |
| 348 lemma : X ∋ union-u {X} {z} X∋z | |
| 349 lemma = def-subst {suc n} {_} {_} {X} {od→ord (Ord (osuc ( od→ord z )))} X∋z refl ord-Ord | |
| 112 | 350 ψiso : {ψ : HOD {suc n} → Set (suc n)} {x y : HOD {suc n}} → ψ x → x ≡ y → ψ y |
| 54 | 351 ψiso {ψ} t refl = t |
| 116 | 352 selection : {X : HOD } {ψ : (x : HOD ) → Set (suc n)} {y : HOD} → (((y₁ : HOD) → X ∋ y₁ → ψ y₁) ∧ (X ∋ y)) ⇔ (Select X ψ ∋ y) |
| 115 | 353 selection {X} {ψ} {y} = record { proj1 = λ s → record { |
| 116 | 354 proj1 = λ y1 y1<X → proj1 s (ord→od y1) y1<X ; proj2 = subst (λ k → def X k ) (sym diso) (proj2 s) } |
| 355 ; proj2 = λ s → record { proj1 = λ y1 dy1 → subst (λ k → ψ k ) oiso ((proj1 s) (od→ord y1) (def-subst {suc n} {_} {_} {X} {_} dy1 refl (sym diso ))) | |
| 356 ; proj2 = def-subst {suc n} {_} {_} {X} {od→ord y} (proj2 s ) refl diso } } where | |
| 112 | 357 replacement : {ψ : HOD → HOD} (X x : HOD) → Replace X ψ ∋ ψ x |
| 93 | 358 replacement {ψ} X x = sup-c< ψ {x} |
| 112 | 359 ∅-iso : {x : HOD} → ¬ (x == od∅) → ¬ ((ord→od (od→ord x)) == od∅) |
| 60 | 360 ∅-iso {x} neq = subst (λ k → ¬ k) (=-iso {n} ) neq |
| 112 | 361 regularity : (x : HOD) (not : ¬ (x == od∅)) → |
| 115 | 362 (x ∋ minimul x not) ∧ (Select (minimul x not) (λ x₁ → (minimul x not ∋ x₁) ∧ (x ∋ x₁)) == od∅) |
| 117 | 363 proj1 (regularity x not ) = x∋minimul x not |
| 364 proj2 (regularity x not ) = record { eq→ = lemma1 ; eq← = λ {y} d → lemma2 {y} d } where | |
| 365 lemma1 : {x₁ : Ordinal} → def (Select (minimul x not) (λ x₂ → (minimul x not ∋ x₂) ∧ (x ∋ x₂))) x₁ → def od∅ x₁ | |
| 366 lemma1 {x₁} s = ⊥-elim ( minimul-1 x not (ord→od x₁) lemma3 ) where | |
| 367 lemma3 : def (minimul x not) (od→ord (ord→od x₁)) ∧ def x (od→ord (ord→od x₁)) | |
| 368 lemma3 = proj1 s x₁ (proj2 s) | |
| 369 lemma2 : {x₁ : Ordinal} → def od∅ x₁ → def (Select (minimul x not) (λ x₂ → (minimul x not ∋ x₂) ∧ (x ∋ x₂))) x₁ | |
| 370 lemma2 {y} d = ⊥-elim (empty (ord→od y) (def-subst {suc n} {_} {_} {od∅} {od→ord (ord→od y)} d refl (sym diso) )) | |
| 112 | 371 extensionality : {A B : HOD {suc n}} → ((z : HOD) → (A ∋ z) ⇔ (B ∋ z)) → A == B |
| 76 | 372 eq→ (extensionality {A} {B} eq ) {x} d = def-iso {suc n} {A} {B} (sym diso) (proj1 (eq (ord→od x))) d |
| 373 eq← (extensionality {A} {B} eq ) {x} d = def-iso {suc n} {B} {A} (sym diso) (proj2 (eq (ord→od x))) d | |
| 112 | 374 xx-union : {x : HOD {suc n}} → (x , x) ≡ record { def = λ z → z o< osuc (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
|
375 xx-union {x} = cong ( λ k → Ord k ) (omxx (od→ord x)) |
| 112 | 376 xxx-union : {x : HOD {suc n}} → (x , (x , x)) ≡ record { def = λ z → z o< osuc (osuc (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
|
377 xxx-union {x} = cong ( λ k → Ord k ) lemma where |
| 112 | 378 lemma1 : {x : HOD {suc n}} → od→ord x o< od→ord (x , x) |
|
109
dab56d357fa3
remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
103
diff
changeset
|
379 lemma1 {x} = c<→o< ( proj1 (pair x x ) ) |
| 112 | 380 lemma2 : {x : HOD {suc n}} → od→ord (x , x) ≡ osuc (od→ord x) |
| 111 | 381 lemma2 = trans ( cong ( λ k → od→ord k ) xx-union ) {!!} |
| 112 | 382 lemma : {x : HOD {suc n}} → omax (od→ord x) (od→ord (x , x)) ≡ osuc (osuc (od→ord x)) |
| 91 | 383 lemma {x} = trans ( sym ( omax< (od→ord x) (od→ord (x , x)) lemma1 ) ) ( cong ( λ k → osuc k ) lemma2 ) |
| 112 | 384 uxxx-union : {x : HOD {suc n}} → Union (x , (x , x)) ≡ record { def = λ z → osuc z o< osuc (osuc (od→ord x)) } |
| 118 | 385 uxxx-union {x} = cong ( λ k → record { def = λ z → osuc z o< k ; otrans = {!!} } ) {!!} where |
| 90 | 386 lemma : od→ord (x , (x , x)) ≡ osuc (osuc (od→ord x)) |
| 111 | 387 lemma = trans ( cong ( λ k → od→ord k ) xxx-union ) {!!} |
| 112 | 388 uxxx-2 : {x : HOD {suc n}} → record { def = λ z → osuc z o< osuc (osuc (od→ord x)) } == record { def = λ z → z o< osuc (od→ord x) } |
| 91 | 389 eq→ ( uxxx-2 {x} ) {m} lt = proj1 (osuc2 m (od→ord x)) lt |
| 390 eq← ( uxxx-2 {x} ) {m} lt = proj2 (osuc2 m (od→ord x)) lt | |
| 112 | 391 uxxx-ord : {x : HOD {suc n}} → od→ord (Union (x , (x , x))) ≡ osuc (od→ord x) |
| 111 | 392 uxxx-ord {x} = trans (cong (λ k → od→ord k ) uxxx-union) {!!} |
| 112 | 393 infinite : HOD {suc n} |
| 111 | 394 infinite = Ord omega |
| 395 infinity∅ : Ord omega ∋ od∅ {suc n} | |
| 396 infinity∅ = {!!} | |
| 112 | 397 infinity : (x : HOD) → infinite ∋ x → infinite ∋ Union (x , (x , x )) |
| 111 | 398 infinity x lt = {!!} where |
| 91 | 399 lemma : (ox : Ordinal {suc n} ) → ox o< omega → osuc ox o< omega |
| 400 lemma record { lv = Zero ; ord = (Φ .0) } (case1 (s≤s x)) = case1 (s≤s z≤n) | |
| 401 lemma record { lv = Zero ; ord = (OSuc .0 ord₁) } (case1 (s≤s x)) = case1 (s≤s z≤n) | |
| 402 lemma record { lv = (Suc lv₁) ; ord = (Φ .(Suc lv₁)) } (case1 (s≤s ())) | |
| 403 lemma record { lv = (Suc lv₁) ; ord = (OSuc .(Suc lv₁) ord₁) } (case1 (s≤s ())) | |
| 404 lemma record { lv = 1 ; ord = (Φ 1) } (case2 c2) with d<→lv c2 | |
| 405 lemma record { lv = (Suc Zero) ; ord = (Φ .1) } (case2 ()) | refl | |
| 103 | 406 -- ∀ X [ ∅ ∉ X → (∃ f : X → ⋃ X ) → ∀ A ∈ X ( f ( A ) ∈ A ) ] -- this form is no good since X is a transitive set |
| 407 -- ∀ z [ ∀ x ( x ∈ z → ¬ ( x ≈ ∅ ) ) ∧ ∀ x ∀ y ( x , y ∈ z ∧ ¬ ( x ≈ y ) → x ∩ y ≈ ∅ ) → ∃ u ∀ x ( x ∈ z → ∃ t ( u ∩ x) ≈ ｛ t ｝) ] | |
| 112 | 408 record Choice (z : HOD {suc n}) : Set (suc (suc n)) where |
| 103 | 409 field |
| 112 | 410 u : {x : HOD {suc n}} ( x∈z : x ∈ z ) → HOD {suc n} |
| 411 t : {x : HOD {suc n}} ( x∈z : x ∈ z ) → (x : HOD {suc n} ) → HOD {suc n} | |
| 412 choice : { x : HOD {suc n} } → ( x∈z : x ∈ z ) → ( u x∈z ∩ x) == ｛ t x∈z x ｝ | |
| 413 -- choice : {x : HOD {suc n}} ( x ∈ z → ¬ ( x ≈ ∅ ) ) → | |
| 414 -- axiom-of-choice : { X : HOD } → ( ¬x∅ : ¬ ( X == od∅ ) ) → { A : HOD } → (A∈X : A ∈ X ) → choice ¬x∅ A∈X ∈ A | |
| 103 | 415 -- axiom-of-choice {X} nx {A} lt = ¬∅=→∅∈ {!!} |
|
78
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
416 |