Mercurial > hg > Members > kono > Proof > ZF-in-agda

annotate OD.agda @ 274:29a85a427ed2

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
ε-induction
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Sat, 25 Apr 2020 15:09:07 +0900
parents 985a1af11bce
children 6f10c47e4e7a
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
16
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 15
diff changeset
1 open import Level
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
2 open import Ordinals
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
3 module OD {n : Level } (O : Ordinals {n} ) where
3
e7990ff544bf reocrd ZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
4
14
e11e95d5ddee separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 11
diff changeset
5 open import zf
23
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 22
diff changeset
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
d9b704508281 isEquiv and isZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 4
diff changeset
9 open import Data.Empty
d9b704508281 isEquiv and isZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 4
diff changeset
10 open import Relation.Nullary
d9b704508281 isEquiv and isZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 4
diff changeset
11 open import Relation.Binary
d9b704508281 isEquiv and isZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 4
diff changeset
12 open import Relation.Binary.Core
d9b704508281 isEquiv and isZF
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 4
diff changeset
13
213
22d435172d1a separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 210
diff changeset
14 open import logic
22d435172d1a separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 210
diff changeset
15 open import nat
22d435172d1a separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 210
diff changeset
16
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
17 open inOrdinal O
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
18
27
bade0a35fdd9 OD, HOD, TC
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 26
diff changeset
19 -- Ordinal Definable Set
11
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 10
diff changeset
20
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
21 record OD : Set (suc n ) where
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
22 field
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
23 def : (x : Ordinal ) → Set n
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
24
141
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 140
diff changeset
25 open OD
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
26
120
ac214eab1c3c inifinite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 119
diff changeset
27 open _∧_
213
22d435172d1a separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 210
diff changeset
28 open _∨_
22d435172d1a separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 210
diff changeset
29 open Bool
44
fcac01485f32 od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 43
diff changeset
30
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
31 record _==_ ( a b : OD ) : Set n where
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
32 field
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
33 eq→ : ∀ { x : Ordinal } → def a x → def b x
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
34 eq← : ∀ { x : Ordinal } → def b x → def a x
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
35
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
36 id : {A : Set n} → A → A
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
37 id x = x
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
38
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
39 ==-refl : { x : OD } → x == x
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
40 ==-refl {x} = record { eq→ = id ; eq← = id }
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
41
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
42 open _==_
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
43
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
44 ==-trans : { x y z : OD } → x == y → y == z → x == z
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
45 ==-trans x=y y=z = record { eq→ = λ {m} t → eq→ y=z (eq→ x=y t) ; eq← = λ {m} t → eq← x=y (eq← y=z t) }
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
46
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
47 ==-sym : { x y : OD } → x == y → y == x
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
48 ==-sym x=y = record { eq→ = λ {m} t → eq← x=y t ; eq← = λ {m} t → eq→ x=y t }
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
49
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
50
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
51 ⇔→== : { x y : OD } → ( {z : Ordinal } → def x z ⇔ def y z) → x == y
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
52 eq→ ( ⇔→== {x} {y} eq ) {z} m = proj1 eq m
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
53 eq← ( ⇔→== {x} {y} eq ) {z} m = proj2 eq m
120
ac214eab1c3c inifinite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 119
diff changeset
54
179
aa89d1b8ce96 fix comments
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 176
diff changeset
55 -- Ordinal in OD ( and ZFSet ) Transitive Set
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
56 Ord : ( a : Ordinal ) → OD
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
57 Ord 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
58
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
59 od∅ : OD
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
60 od∅ = Ord o∅
40
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 39
diff changeset
61
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
62 -- next assumptions are our axiom
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
63 -- it defines a subset of OD, which is called HOD, usually defined as
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
64 -- HOD = { x | TC x ⊆ OD }
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
65 -- where TC x is a transitive clusure of x, i.e. Union of all elemnts of all subset of x
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
66
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
67 postulate
141
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 140
diff changeset
68 -- OD can be iso to a subset of Ordinal ( by means of Godel Set )
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
69 od→ord : OD → Ordinal
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
70 ord→od : Ordinal → OD
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
71 c<→o< : {x y : OD } → def y ( od→ord x ) → od→ord x o< od→ord y
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
72 oiso : {x : OD } → ord→od ( od→ord x ) ≡ x
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
73 diso : {x : Ordinal } → od→ord ( ord→od x ) ≡ x
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
74 ==→o≡ : { x y : OD } → (x == y) → x ≡ y
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
75 -- next assumption causes ∀ x ∋ ∅ . It menas only an ordinal is allowed as OD
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
76 -- o<→c< : {n : Level} {x y : Ordinal } → x o< y → def (ord→od y) x
159
3675bd617ac8 infinite continue...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 158
diff changeset
77 -- ord→od x ≡ Ord x results the same
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
78 -- supermum as Replacement Axiom ( this assumes Ordinal has some upper bound )
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
79 sup-o : ( Ordinal → Ordinal ) → Ordinal
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
80 sup-o< : { ψ : Ordinal → Ordinal } → ∀ {x : Ordinal } → ψ x o< sup-o ψ
111
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 109
diff changeset
81 -- contra-position of mimimulity of supermum required in Power Set Axiom
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
82 -- sup-x : {n : Level } → ( Ordinal → Ordinal ) → Ordinal
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
83 -- sup-lb : {n : Level } → { ψ : Ordinal → Ordinal } → {z : Ordinal } → z o< sup-o ψ → z o< osuc (ψ (sup-x ψ))
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
84 -- mimimul and x∋minimal is an Axiom of choice
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
85 minimal : (x : OD ) → ¬ (x == od∅ )→ OD
117
a4c97390d312 minimum assuption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 116
diff changeset
86 -- this should be ¬ (x == od∅ )→ ∃ ox → x ∋ Ord ox ( minimum of x )
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
87 x∋minimal : (x : OD ) → ( ne : ¬ (x == od∅ ) ) → def x ( od→ord ( minimal x ne ) )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
88 -- minimality (may proved by ε-induction )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
89 minimal-1 : (x : OD ) → ( ne : ¬ (x == od∅ ) ) → (y : OD ) → ¬ ( def (minimal x ne) (od→ord y)) ∧ (def x (od→ord y) )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
90
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
91 o<→c<→OD=Ord : ( {x y : Ordinal } → x o< y → def (ord→od y) x ) → {x : OD } → x ≡ Ord (od→ord x)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
92 o<→c<→OD=Ord o<→c< {x} = ==→o≡ ( record { eq→ = lemma1 ; eq← = lemma2 } ) where
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
93 lemma1 : {y : Ordinal} → def x y → def (Ord (od→ord x)) y
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
94 lemma1 {y} lt = subst ( λ k → k o< od→ord x ) diso (c<→o< {ord→od y} {x} (subst (λ k → def x k ) (sym diso) lt))
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
95 lemma2 : {y : Ordinal} → def (Ord (od→ord x)) y → def x y
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
96 lemma2 {y} lt = subst (λ k → def k y ) oiso (o<→c< {y} {od→ord x} lt )
123
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 122
diff changeset
97
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
98 _∋_ : ( a x : OD ) → Set n
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
99 _∋_ a x = def a ( od→ord x )
95
f3da2c87cee0 clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 94
diff changeset
100
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
101 _c<_ : ( x a : OD ) → Set n
109
dab56d357fa3 remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 103
diff changeset
102 x c< a = a ∋ x
103
c8b79d303867 starting over HOD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 100
diff changeset
103
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
104 cseq : {n : Level} → OD → OD
140
312e27aa3cb5 remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 139
diff changeset
105 cseq x = record { def = λ y → def x (osuc y) } where
113
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 112
diff changeset
106
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
107 def-subst : {Z : OD } {X : Ordinal }{z : OD } {x : Ordinal }→ def Z X → Z ≡ z → X ≡ x → def z x
95
f3da2c87cee0 clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 94
diff changeset
108 def-subst df refl refl = df
f3da2c87cee0 clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 94
diff changeset
109
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
110 sup-od : ( OD → OD ) → OD
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
111 sup-od ψ = Ord ( sup-o ( λ x → od→ord (ψ (ord→od x ))) )
95
f3da2c87cee0 clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 94
diff changeset
112
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
113 sup-c< : ( ψ : OD → OD ) → ∀ {x : OD } → def ( sup-od ψ ) (od→ord ( ψ x ))
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
114 sup-c< ψ {x} = def-subst {_} {_} {Ord ( sup-o ( λ x → od→ord (ψ (ord→od x ))) )} {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
115 lemma refl (cong ( λ k → od→ord (ψ k) ) oiso) where
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
116 lemma : od→ord (ψ (ord→od (od→ord x))) o< sup-o (λ x → od→ord (ψ (ord→od x)))
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
117 lemma = subst₂ (λ j k → j o< k ) refl diso (o<-subst (sup-o< ) refl (sym diso) )
28
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
118
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
119 otrans : {n : Level} {a x y : Ordinal } → def (Ord a) x → def (Ord x) y → def (Ord a) y
187
ac872f6b8692 add Todo
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 186
diff changeset
120 otrans x<a y<x = ordtrans y<x x<a
123
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 122
diff changeset
121
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
122 def→o< : {X : OD } → {x : Ordinal } → def X x → x o< od→ord X
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
123 def→o< {X} {x} lt = o<-subst {_} {_} {x} {od→ord X} ( c<→o< ( def-subst {X} {x} lt (sym oiso) (sym diso) )) diso diso
44
fcac01485f32 od→lv : {n : Level} → OD {n} → Nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 43
diff changeset
124
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
125
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
126 -- avoiding lv != Zero error
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
127 orefl : { x : OD } → { y : Ordinal } → od→ord x ≡ y → od→ord x ≡ y
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
128 orefl refl = refl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
129
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
130 ==-iso : { x y : OD } → ord→od (od→ord x) == ord→od (od→ord y) → x == y
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
131 ==-iso {x} {y} eq = record {
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
132 eq→ = λ d → lemma ( eq→ eq (def-subst d (sym oiso) refl )) ;
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
133 eq← = λ d → lemma ( eq← eq (def-subst d (sym oiso) refl )) }
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
134 where
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
135 lemma : {x : OD } {z : Ordinal } → def (ord→od (od→ord x)) z → def x z
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
136 lemma {x} {z} d = def-subst d oiso refl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
137
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
138 =-iso : {x y : OD } → (x == y) ≡ (ord→od (od→ord x) == y)
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
139 =-iso {_} {y} = cong ( λ k → k == y ) (sym oiso)
57
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 56
diff changeset
140
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
141 ord→== : { x y : OD } → od→ord x ≡ od→ord y → x == y
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
142 ord→== {x} {y} eq = ==-iso (lemma (od→ord x) (od→ord y) (orefl eq)) where
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
143 lemma : ( ox oy : Ordinal ) → ox ≡ oy → (ord→od ox) == (ord→od oy)
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
144 lemma ox ox refl = ==-refl
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
145
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
146 o≡→== : { x y : Ordinal } → x ≡ y → ord→od x == ord→od y
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
147 o≡→== {x} {.x} refl = ==-refl
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
148
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
149 o∅≡od∅ : ord→od (o∅ ) ≡ od∅
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
150 o∅≡od∅ = ==→o≡ lemma where
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
151 lemma0 : {x : Ordinal} → def (ord→od o∅) x → def od∅ x
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
152 lemma0 {x} lt = o<-subst (c<→o< {ord→od x} {ord→od o∅} (def-subst {ord→od o∅} {x} lt refl (sym diso)) ) diso diso
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
153 lemma1 : {x : Ordinal} → def od∅ x → def (ord→od o∅) x
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
154 lemma1 {x} lt = ⊥-elim (¬x<0 lt)
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
155 lemma : ord→od o∅ == od∅
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
156 lemma = record { eq→ = lemma0 ; eq← = lemma1 }
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
157
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
158 ord-od∅ : od→ord (od∅ ) ≡ o∅
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
159 ord-od∅ = sym ( subst (λ k → k ≡ od→ord (od∅ ) ) diso (cong ( λ k → od→ord k ) o∅≡od∅ ) )
80
461690d60d07 remove ∅-base-def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 79
diff changeset
160
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
161 ∅0 : record { def = λ x → Lift n ⊥ } == od∅
109
dab56d357fa3 remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 103
diff changeset
162 eq→ ∅0 {w} (lift ())
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
163 eq← ∅0 {w} lt = lift (¬x<0 lt)
109
dab56d357fa3 remove o<→c< and add otrans in OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 103
diff changeset
164
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
165 ∅< : { x y : OD } → def x (od→ord y ) → ¬ ( x == od∅ )
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
166 ∅< {x} {y} d eq with eq→ (==-trans eq (==-sym ∅0) ) d
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
167 ∅< {x} {y} d eq | lift ()
57
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 56
diff changeset
168
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
169 ∅6 : { x : OD } → ¬ ( x ∋ x ) -- no Russel paradox
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
170 ∅6 {x} x∋x = o<¬≡ refl ( c<→o< {x} {x} x∋x )
51
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 50
diff changeset
171
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
172 def-iso : {A B : OD } {x y : Ordinal } → x ≡ y → (def A y → def B y) → def A x → def B x
76
8e8f54e7a030 extensionality done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 74
diff changeset
173 def-iso refl t = t
8e8f54e7a030 extensionality done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 74
diff changeset
174
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
175 is-o∅ : ( x : Ordinal ) → Dec ( x ≡ o∅ )
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
176 is-o∅ x with trio< x o∅
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
177 is-o∅ x | tri< a ¬b ¬c = no ¬b
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
178 is-o∅ x | tri≈ ¬a b ¬c = yes b
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
179 is-o∅ x | tri> ¬a ¬b c = no ¬b
57
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 56
diff changeset
180
254
2ea2a19f9cd6 ordered pair clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 247
diff changeset
181 _,_ : OD → OD → OD
2ea2a19f9cd6 ordered pair clean up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 247
diff changeset
182 x , y = record { def = λ t → (t ≡ od→ord x ) ∨ ( t ≡ od→ord y ) } -- Ord (omax (od→ord x) (od→ord y))
188
1f2c8b094908 axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 187
diff changeset
183
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
184 --
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
185 -- Axiom of choice in intutionistic logic implies the exclude middle
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
186 -- https://plato.stanford.edu/entries/axiom-choice/#AxiChoLog
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
187 --
257
53b7acd63481 move product to OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 254
diff changeset
188
53b7acd63481 move product to OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 254
diff changeset
189 ppp : { p : Set n } { a : OD } → record { def = λ x → p } ∋ a → p
53b7acd63481 move product to OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 254
diff changeset
190 ppp {p} {a} d = d
53b7acd63481 move product to OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 254
diff changeset
191
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
192 p∨¬p : ( p : Set n ) → p ∨ ( ¬ p ) -- assuming axiom of choice
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
193 p∨¬p p with is-o∅ ( od→ord ( record { def = λ x → p } ))
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
194 p∨¬p p | yes eq = case2 (¬p eq) where
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
195 ps = record { def = λ x → p }
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
196 lemma : ps == od∅ → p → ⊥
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
197 lemma eq p0 = ¬x<0 {od→ord ps} (eq→ eq p0 )
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
198 ¬p : (od→ord ps ≡ o∅) → p → ⊥
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
199 ¬p eq = lemma ( subst₂ (λ j k → j == k ) oiso o∅≡od∅ ( o≡→== eq ))
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
200 p∨¬p p | no ¬p = case1 (ppp {p} {minimal ps (λ eq → ¬p (eqo∅ eq))} lemma) where
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
201 ps = record { def = λ x → p }
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
202 eqo∅ : ps == od∅ → od→ord ps ≡ o∅
188
1f2c8b094908 axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 187
diff changeset
203 eqo∅ eq = subst (λ k → od→ord ps ≡ k) ord-od∅ ( cong (λ k → od→ord k ) (==→o≡ eq))
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
204 lemma : ps ∋ minimal ps (λ eq → ¬p (eqo∅ eq))
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
205 lemma = x∋minimal ps (λ eq → ¬p (eqo∅ eq))
188
1f2c8b094908 axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 187
diff changeset
206
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
207 decp : ( p : Set n ) → Dec p -- assuming axiom of choice
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
208 decp p with p∨¬p p
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
209 decp p | case1 x = yes x
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
210 decp p | case2 x = no x
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
211
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
212 double-neg-eilm : {A : Set n} → ¬ ¬ A → A -- we don't have this in intutionistic logic
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
213 double-neg-eilm {A} notnot with decp A -- assuming axiom of choice
189
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
214 ... | yes p = p
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
215 ... | no ¬p = ⊥-elim ( notnot ¬p )
540b845ea2de Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 188
diff changeset
216
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
217 OrdP : ( x : Ordinal ) ( y : OD ) → Dec ( Ord x ∋ y )
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
218 OrdP x y with trio< x (od→ord y)
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
219 OrdP x y | tri< a ¬b ¬c = no ¬c
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
220 OrdP x y | tri≈ ¬a refl ¬c = no ( o<¬≡ refl )
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
221 OrdP x y | tri> ¬a ¬b c = yes c
119
6e264c78e420 infinite
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 118
diff changeset
222
79
c07c548b2ac1 add some lemma
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 78
diff changeset
223 -- open import Relation.Binary.HeterogeneousEquality as HE using (_≅_ )
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
224 -- postulate f-extensionality : { n : Level} → Relation.Binary.PropositionalEquality.Extensionality n (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
225
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
226 in-codomain : (X : OD ) → ( ψ : OD → OD ) → OD
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
227 in-codomain X ψ = record { def = λ x → ¬ ( (y : Ordinal ) → ¬ ( def X y ∧ ( x ≡ od→ord (ψ (ord→od y ))))) }
141
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 140
diff changeset
228
96
f239ffc27fd0 Power Set and L
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 95
diff changeset
229 -- 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
230
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
231 ZFSubset : (A x : OD ) → OD
191
9eb6a8691f02 choice function cannot jump between ordinal level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 190
diff changeset
232 ZFSubset A x = record { def = λ y → def A y ∧ def x y } -- roughly x = A → Set
97
f2b579106770 power set using sup on Def
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 96
diff changeset
233
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
234 Def : (A : OD ) → OD
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
235 Def A = Ord ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) )
190
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
236
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
237 -- _⊆_ : ( A B : OD ) → ∀{ x : OD } → Set n
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
238 -- _⊆_ A B {x} = A ∋ x → B ∋ x
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
239
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
240 record _⊆_ ( A B : OD ) : Set (suc n) where
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
241 field
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
242 incl : { x : OD } → A ∋ x → B ∋ x
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
243
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
244 open _⊆_
190
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
245
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
246 infixr 220 _⊆_
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
247
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
248 subset-lemma : {A x : OD } → ( {y : OD } → x ∋ y → ZFSubset A x ∋ y ) ⇔ ( x ⊆ A )
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
249 subset-lemma {A} {x} = record {
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
250 proj1 = λ lt → record { incl = λ x∋z → proj1 (lt x∋z) }
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
251 ; proj2 = λ x⊆A lt → record { proj1 = incl x⊆A lt ; proj2 = lt }
190
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
252 }
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
253
261
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
254 open import Data.Unit
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
255
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
256 ε-induction : { ψ : OD → Set (suc n)}
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
257 → ( {x : OD } → ({ y : OD } → x ∋ y → ψ y ) → ψ x )
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
258 → (x : OD ) → ψ x
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
259 ε-induction {ψ} ind x = subst (λ k → ψ k ) oiso (ε-induction-ord (osuc (od→ord x)) <-osuc ) where
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
260 induction : (ox : Ordinal) → ((oy : Ordinal) → oy o< ox → ψ (ord→od oy)) → ψ (ord→od ox)
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
261 induction ox prev = ind ( λ {y} lt → subst (λ k → ψ k ) oiso (prev (od→ord y) (o<-subst (c<→o< lt) refl diso )))
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
262 ε-induction-ord : (ox : Ordinal) { oy : Ordinal } → oy o< ox → ψ (ord→od oy)
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
263 ε-induction-ord ox {oy} lt = TransFinite {λ oy → ψ (ord→od oy)} induction oy
d9d178d1457c ε-induction from TransFinite induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 260
diff changeset
264
262
53744836020b CH trying ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 261
diff changeset
265 -- minimal-2 : (x : OD ) → ( ne : ¬ (x == od∅ ) ) → (y : OD ) → ¬ ( def (minimal x ne) (od→ord y)) ∧ (def x (od→ord y) )
53744836020b CH trying ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 261
diff changeset
266 -- minimal-2 x ne y = contra-position ( ε-induction (λ {z} ind → {!!} ) x ) ( λ p → {!!} )
53744836020b CH trying ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 261
diff changeset
267
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
268 OD→ZF : ZF
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
269 OD→ZF = record {
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
270 ZFSet = OD
43
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
271 ; _∋_ = _∋_
0d9b9db14361 equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 42
diff changeset
272 ; _≈_ = _==_
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
273 ; ∅ = od∅
28
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
274 ; _,_ = _,_
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
275 ; Union = Union
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
276 ; Power = Power
28
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
277 ; Select = Select
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
278 ; Replace = Replace
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
279 ; infinite = infinite
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
280 ; isZF = isZF
28
f36e40d5d2c3 OD continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 27
diff changeset
281 } where
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
282 ZFSet = OD
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
283 Select : (X : OD ) → ((x : OD ) → Set n ) → OD
156
3e7475fb28db differeent Union approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 155
diff changeset
284 Select X ψ = record { def = λ x → ( def X x ∧ ψ ( ord→od x )) }
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
285 Replace : OD → (OD → OD ) → OD
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
286 Replace X ψ = record { def = λ x → (x o< sup-o ( λ x → od→ord (ψ (ord→od x )))) ∧ def (in-codomain X ψ) x }
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
287 _∩_ : ( A B : ZFSet ) → ZFSet
145
f0fa9a755513 all done but ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 144
diff changeset
288 A ∩ B = record { def = λ x → def A x ∧ def B x }
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
289 Union : OD → OD
156
3e7475fb28db differeent Union approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 155
diff changeset
290 Union U = record { def = λ x → ¬ (∀ (u : Ordinal ) → ¬ ((def U u) ∧ (def (ord→od u) x))) }
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
291 _∈_ : ( A B : ZFSet ) → Set n
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
292 A ∈ B = B ∋ A
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
293 Power : OD → OD
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
294 Power A = Replace (Def (Ord (od→ord A))) ( λ x → A ∩ x )
103
c8b79d303867 starting over HOD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 100
diff changeset
295 ｛_｝ : ZFSet → ZFSet
c8b79d303867 starting over HOD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 100
diff changeset
296 ｛ 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
297
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
298 data infinite-d : ( x : Ordinal ) → Set n where
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
299 iφ : infinite-d o∅
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
300 isuc : {x : Ordinal } → infinite-d x →
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
301 infinite-d (od→ord ( Union (ord→od x , (ord→od x , ord→od x ) ) ))
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
302
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
303 infinite : OD
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
304 infinite = record { def = λ x → infinite-d x }
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
305
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
306 infixr 200 _∈_
96
f239ffc27fd0 Power Set and L
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 95
diff changeset
307 -- infixr 230 _∩_ _∪_
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
308 isZF : IsZF (OD ) _∋_ _==_ 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
309 isZF = record {
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
310 isEquivalence = record { refl = ==-refl ; sym = ==-sym; trans = ==-trans }
247
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
311 ; pair→ = pair→
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
312 ; pair← = pair←
72
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 71
diff changeset
313 ; union→ = union→
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 71
diff changeset
314 ; union← = union←
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
315 ; empty = empty
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
316 ; power→ = power→
76
8e8f54e7a030 extensionality done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 74
diff changeset
317 ; power← = power←
186
914cc522c53a fix extensionality
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 185
diff changeset
318 ; extensionality = λ {A} {B} {w} → extensionality {A} {B} {w}
274
29a85a427ed2 ε-induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 272
diff changeset
319 ; ε-induction = ε-induction
78
9a7a64b2388c infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 77
diff changeset
320 ; infinity∅ = infinity∅
160
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 159
diff changeset
321 ; infinity = infinity
116
47541e86c6ac axiom of selection
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 115
diff changeset
322 ; selection = λ {X} {ψ} {y} → selection {X} {ψ} {y}
135
b60b6e8a57b0 otrans in repl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 134
diff changeset
323 ; replacement← = replacement←
b60b6e8a57b0 otrans in repl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 134
diff changeset
324 ; replacement→ = replacement→
274
29a85a427ed2 ε-induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 272
diff changeset
325 -- ; choice-func = choice-func
29a85a427ed2 ε-induction
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 272
diff changeset
326 -- ; choice = choice
29
fce60b99dc55 posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 28
diff changeset
327 } where
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
328
247
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
329 pair→ : ( x y t : ZFSet ) → (x , y) ∋ t → ( t == x ) ∨ ( t == y )
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
330 pair→ x y t (case1 t≡x ) = case1 (subst₂ (λ j k → j == k ) oiso oiso (o≡→== t≡x ))
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
331 pair→ x y t (case2 t≡y ) = case2 (subst₂ (λ j k → j == k ) oiso oiso (o≡→== t≡y ))
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
332
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
333 pair← : ( x y t : ZFSet ) → ( t == x ) ∨ ( t == y ) → (x , y) ∋ t
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
334 pair← x y t (case1 t==x) = case1 (cong (λ k → od→ord k ) (==→o≡ t==x))
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
335 pair← x y t (case2 t==y) = case2 (cong (λ k → od→ord k ) (==→o≡ t==y))
d09437fcfc7c fix pair
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 235
diff changeset
336
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
337 empty : (x : OD ) → ¬ (od∅ ∋ x)
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
338 empty x = ¬x<0
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
339
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
340 o<→c< : {x y : Ordinal } → x o< y → (Ord x) ⊆ (Ord y)
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
341 o<→c< lt = record { incl = λ z → ordtrans z lt }
155
53371f91ce63 union continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 154
diff changeset
342
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
343 ⊆→o< : {x y : Ordinal } → (Ord x) ⊆ (Ord y) → x o< osuc y
155
53371f91ce63 union continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 154
diff changeset
344 ⊆→o< {x} {y} lt with trio< x y
53371f91ce63 union continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 154
diff changeset
345 ⊆→o< {x} {y} lt | tri< a ¬b ¬c = ordtrans a <-osuc
53371f91ce63 union continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 154
diff changeset
346 ⊆→o< {x} {y} lt | tri≈ ¬a b ¬c = subst ( λ k → k o< osuc y) (sym b) <-osuc
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
347 ⊆→o< {x} {y} lt | tri> ¬a ¬b c with (incl lt) (o<-subst c (sym diso) refl )
155
53371f91ce63 union continue
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 154
diff changeset
348 ... | ttt = ⊥-elim ( o<¬≡ refl (o<-subst ttt diso refl ))
151
b5a337fb7a6d recovering...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 150
diff changeset
349
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
350 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
351 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
352 ; proj2 = subst ( λ k → def k (od→ord z)) (sym oiso) (proj2 xx) } ))
159
3675bd617ac8 infinite continue...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 158
diff changeset
353 union← : (X z : OD) (X∋z : Union X ∋ z) → ¬ ( (u : OD ) → ¬ ((X ∋ u) ∧ (u ∋ z )))
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
354 union← X z UX∋z = FExists _ lemma UX∋z where
165
d16b8bf29f4f minor fix
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 162
diff changeset
355 lemma : {y : Ordinal} → def X y ∧ def (ord→od y) (od→ord z) → ¬ ((u : OD) → ¬ (X ∋ u) ∧ (u ∋ z))
d16b8bf29f4f minor fix
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 162
diff changeset
356 lemma {y} xx not = not (ord→od y) record { proj1 = subst ( λ k → def X k ) (sym diso) (proj1 xx ) ; proj2 = proj2 xx }
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
357
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
358 ψiso : {ψ : OD → Set n} {x y : OD } → ψ x → x ≡ y → ψ y
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
359 ψiso {ψ} t refl = t
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
360 selection : {ψ : OD → Set n} {X y : OD} → ((X ∋ y) ∧ ψ y) ⇔ (Select X ψ ∋ y)
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
361 selection {ψ} {X} {y} = record {
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
362 proj1 = λ cond → record { proj1 = proj1 cond ; proj2 = ψiso {ψ} (proj2 cond) (sym oiso) }
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
363 ; proj2 = λ select → record { proj1 = proj1 select ; proj2 = ψiso {ψ} (proj2 select) oiso }
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
364 }
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
365 replacement← : {ψ : OD → OD} (X x : OD) → X ∋ x → Replace X ψ ∋ ψ x
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
366 replacement← {ψ} X x lt = record { proj1 = sup-c< ψ {x} ; proj2 = lemma } where
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
367 lemma : def (in-codomain X ψ) (od→ord (ψ x))
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
368 lemma not = ⊥-elim ( not ( od→ord x ) (record { proj1 = lt ; proj2 = cong (λ k → od→ord (ψ k)) (sym oiso)} ))
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
369 replacement→ : {ψ : OD → OD} (X x : OD) → (lt : Replace X ψ ∋ x) → ¬ ( (y : OD) → ¬ (x == ψ y))
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
370 replacement→ {ψ} X x lt = contra-position lemma (lemma2 (proj2 lt)) where
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
371 lemma2 : ¬ ((y : Ordinal) → ¬ def X y ∧ ((od→ord x) ≡ od→ord (ψ (ord→od y))))
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
372 → ¬ ((y : Ordinal) → ¬ def X y ∧ (ord→od (od→ord x) == ψ (ord→od y)))
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
373 lemma2 not not2 = not ( λ y d → not2 y (record { proj1 = proj1 d ; proj2 = lemma3 (proj2 d)})) where
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
374 lemma3 : {y : Ordinal } → (od→ord x ≡ od→ord (ψ (ord→od y))) → (ord→od (od→ord x) == ψ (ord→od y))
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
375 lemma3 {y} eq = subst (λ k → ord→od (od→ord x) == k ) oiso (o≡→== eq )
150
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
376 lemma : ( (y : OD) → ¬ (x == ψ y)) → ( (y : Ordinal) → ¬ def X y ∧ (ord→od (od→ord x) == ψ (ord→od y)) )
ebcbfd9d9c8e fix some
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 148
diff changeset
377 lemma not y not2 = not (ord→od y) (subst (λ k → k == ψ (ord→od y)) oiso ( proj2 not2 ))
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
378
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
379 ---
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
380 --- Power Set
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
381 ---
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
382 --- First consider ordinals in OD
100
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
383 ---
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
384 --- ZFSubset A x = record { def = λ y → def A y ∧ def x y } subset of A
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
385 --
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
386 --
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
387 ∩-≡ : { a b : OD } → ({x : OD } → (a ∋ x → b ∋ x)) → a == ( b ∩ a )
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
388 ∩-≡ {a} {b} inc = record {
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
389 eq→ = λ {x} x<a → record { proj2 = x<a ;
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
390 proj1 = def-subst {_} {_} {b} {x} (inc (def-subst {_} {_} {a} {_} x<a refl (sym diso) )) refl diso } ;
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
391 eq← = λ {x} x<a∩b → proj2 x<a∩b }
100
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
392 --
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
393 -- Transitive Set case
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
394 -- we have t ∋ x → Ord a ∋ x means t is a subset of Ord a, that is ZFSubset (Ord a) t == t
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
395 -- Def (Ord a) is a sup of ZFSubset (Ord a) t, so Def (Ord a) ∋ t
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
396 -- Def A = Ord ( sup-o ( λ x → od→ord ( ZFSubset A (ord→od x )) ) )
100
a402881cc341 add comment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 99
diff changeset
397 --
141
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 140
diff changeset
398 ord-power← : (a : Ordinal ) (t : OD) → ({x : OD} → (t ∋ x → (Ord a) ∋ x)) → Def (Ord a) ∋ t
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
399 ord-power← a t t→A = def-subst {_} {_} {Def (Ord a)} {od→ord t}
127
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 126
diff changeset
400 lemma refl (lemma1 lemma-eq )where
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
401 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
402 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
403 eq← lemma-eq {z} w = record { proj2 = w ;
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
404 proj1 = def-subst {_} {_} {(Ord a)} {z}
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
405 ( t→A (def-subst {_} {_} {t} {od→ord (ord→od z)} w refl (sym diso) )) refl diso }
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
406 lemma1 : {a : Ordinal } { t : OD }
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
407 → (eq : ZFSubset (Ord a) t == t) → od→ord (ZFSubset (Ord a) (ord→od (od→ord t))) ≡ od→ord t
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
408 lemma1 {a} {t} eq = subst (λ k → od→ord (ZFSubset (Ord a) k) ≡ od→ord t ) (sym oiso) (cong (λ k → od→ord k ) (==→o≡ eq ))
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
409 lemma : od→ord (ZFSubset (Ord a) (ord→od (od→ord t)) ) o< sup-o (λ x → od→ord (ZFSubset (Ord a) (ord→od x)))
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
410 lemma = sup-o<
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
411
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
412 --
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
413 -- Every set in OD is a subset of Ordinals, so make Def (Ord (od→ord A)) first
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
414 -- then replace of all elements of the Power set by A ∩ y
144
3ba37037faf4 Union again
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 143
diff changeset
415 --
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
416 -- Power A = Replace (Def (Ord (od→ord A))) ( λ y → A ∩ y )
166
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
417
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
418 -- we have oly double negation form because of the replacement axiom
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
419 --
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
420 power→ : ( A t : OD) → Power A ∋ t → {x : OD} → t ∋ x → ¬ ¬ (A ∋ x)
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
421 power→ A t P∋t {x} t∋x = FExists _ lemma5 lemma4 where
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
422 a = od→ord A
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
423 lemma2 : ¬ ( (y : OD) → ¬ (t == (A ∩ y)))
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
424 lemma2 = replacement→ (Def (Ord (od→ord A))) t P∋t
166
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
425 lemma3 : (y : OD) → t == ( A ∩ y ) → ¬ ¬ (A ∋ x)
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
426 lemma3 y eq not = not (proj1 (eq→ eq t∋x))
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
427 lemma4 : ¬ ((y : Ordinal) → ¬ (t == (A ∩ ord→od y)))
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
428 lemma4 not = lemma2 ( λ y not1 → not (od→ord y) (subst (λ k → t == ( A ∩ k )) (sym oiso) not1 ))
166
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
429 lemma5 : {y : Ordinal} → t == (A ∩ ord→od y) → ¬ ¬ (def A (od→ord x))
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
430 lemma5 {y} eq not = (lemma3 (ord→od y) eq) not
ea0e7927637a use double negation
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 165
diff changeset
431
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
432 power← : (A t : OD) → ({x : OD} → (t ∋ x → A ∋ x)) → Power A ∋ t
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
433 power← A t t→A = record { proj1 = lemma1 ; proj2 = lemma2 } where
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
434 a = od→ord A
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
435 lemma0 : {x : OD} → t ∋ x → Ord a ∋ x
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
436 lemma0 {x} t∋x = c<→o< (t→A t∋x)
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
437 lemma3 : Def (Ord a) ∋ t
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
438 lemma3 = ord-power← a t lemma0
152
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
439 lemma4 : (A ∩ ord→od (od→ord t)) ≡ t
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
440 lemma4 = let open ≡-Reasoning in begin
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
441 A ∩ ord→od (od→ord t)
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
442 ≡⟨ cong (λ k → A ∩ k) oiso ⟩
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
443 A ∩ t
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
444 ≡⟨ sym (==→o≡ ( ∩-≡ t→A )) ⟩
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
445 t
996a67042f50 power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 151
diff changeset
446 ∎
260
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
447 lemma1 : od→ord t o< sup-o (λ x → od→ord (A ∩ ord→od x))
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
448 lemma1 = subst (λ k → od→ord k o< sup-o (λ x → od→ord (A ∩ ord→od x)))
8b85949bde00 sup with limit give up
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 259
diff changeset
449 lemma4 (sup-o< {λ x → od→ord (A ∩ ord→od x)} {od→ord t} )
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
450 lemma2 : def (in-codomain (Def (Ord (od→ord A))) (_∩_ A)) (od→ord t)
151
b5a337fb7a6d recovering...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 150
diff changeset
451 lemma2 not = ⊥-elim ( not (od→ord t) (record { proj1 = lemma3 ; proj2 = lemma6 }) ) where
b5a337fb7a6d recovering...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 150
diff changeset
452 lemma6 : od→ord t ≡ od→ord (A ∩ ord→od (od→ord t))
b5a337fb7a6d recovering...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 150
diff changeset
453 lemma6 = cong ( λ k → od→ord k ) (==→o≡ (subst (λ k → t == (A ∩ k)) (sym oiso) ( ∩-≡ t→A )))
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
454
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
455 ord⊆power : (a : Ordinal) → (Ord (osuc a)) ⊆ (Power (Ord a))
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
456 ord⊆power a = record { incl = λ {x} lt → power← (Ord a) x (lemma lt) } where
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
457 lemma : {x y : OD} → od→ord x o< osuc a → x ∋ y → Ord a ∋ y
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
458 lemma lt y<x with osuc-≡< lt
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
459 lemma lt y<x | case1 refl = c<→o< y<x
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
460 lemma lt y<x | case2 x<a = ordtrans (c<→o< y<x) x<a
262
53744836020b CH trying ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 261
diff changeset
461
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
462 -- continuum-hyphotheis : (a : Ordinal) → Power (Ord a) ⊆ Ord (osuc a)
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
463 -- continuum-hyphotheis a = ?
262
53744836020b CH trying ...
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 261
diff changeset
464
190
6e778b0a7202 add filter
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 189
diff changeset
465 -- assuming axiom of choice
141
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 140
diff changeset
466 regularity : (x : OD) (not : ¬ (x == od∅)) →
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
467 (x ∋ minimal x not) ∧ (Select (minimal x not) (λ x₁ → (minimal x not ∋ x₁) ∧ (x ∋ x₁)) == od∅)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
468 proj1 (regularity x not ) = x∋minimal x not
117
a4c97390d312 minimum assuption
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 116
diff changeset
469 proj2 (regularity x not ) = record { eq→ = lemma1 ; eq← = λ {y} d → lemma2 {y} d } where
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
470 lemma1 : {x₁ : Ordinal} → def (Select (minimal x not) (λ x₂ → (minimal x not ∋ x₂) ∧ (x ∋ x₂))) x₁ → def od∅ x₁
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
471 lemma1 {x₁} s = ⊥-elim ( minimal-1 x not (ord→od x₁) lemma3 ) where
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
472 lemma3 : def (minimal x not) (od→ord (ord→od x₁)) ∧ def x (od→ord (ord→od x₁))
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
473 lemma3 = record { proj1 = def-subst {_} {_} {minimal x not} {_} (proj1 s) refl (sym diso)
142
c30bc9f5bd0d Power Set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 141
diff changeset
474 ; proj2 = proj2 (proj2 s) }
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
475 lemma2 : {x₁ : Ordinal} → def od∅ x₁ → def (Select (minimal x not) (λ x₂ → (minimal x not ∋ x₂) ∧ (x ∋ x₂))) x₁
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
476 lemma2 {y} d = ⊥-elim (empty (ord→od y) (def-subst {_} {_} {od∅} {od→ord (ord→od y)} d refl (sym diso) ))
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
477
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
478 extensionality0 : {A B : OD } → ((z : OD) → (A ∋ z) ⇔ (B ∋ z)) → A == B
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
479 eq→ (extensionality0 {A} {B} eq ) {x} d = def-iso {A} {B} (sym diso) (proj1 (eq (ord→od x))) d
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
480 eq← (extensionality0 {A} {B} eq ) {x} d = def-iso {B} {A} (sym diso) (proj2 (eq (ord→od x))) d
186
914cc522c53a fix extensionality
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 185
diff changeset
481
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
482 extensionality : {A B w : OD } → ((z : OD ) → (A ∋ z) ⇔ (B ∋ z)) → (w ∋ A) ⇔ (w ∋ B)
186
914cc522c53a fix extensionality
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 185
diff changeset
483 proj1 (extensionality {A} {B} {w} eq ) d = subst (λ k → w ∋ k) ( ==→o≡ (extensionality0 {A} {B} eq) ) d
914cc522c53a fix extensionality
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 185
diff changeset
484 proj2 (extensionality {A} {B} {w} eq ) d = subst (λ k → w ∋ k) (sym ( ==→o≡ (extensionality0 {A} {B} eq) )) d
129
2a5519dcc167 ord power set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 128
diff changeset
485
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
486 infinity∅ : infinite ∋ od∅
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
487 infinity∅ = def-subst {_} {_} {infinite} {od→ord (od∅ )} iφ refl lemma where
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
488 lemma : o∅ ≡ od→ord od∅
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
489 lemma = let open ≡-Reasoning in begin
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
490 o∅
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
491 ≡⟨ sym diso ⟩
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
492 od→ord ( ord→od o∅ )
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
493 ≡⟨ cong ( λ k → od→ord k ) o∅≡od∅ ⟩
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
494 od→ord od∅
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
495 ∎
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
496 infinity : (x : OD) → infinite ∋ x → infinite ∋ Union (x , (x , x ))
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
497 infinity x lt = def-subst {_} {_} {infinite} {od→ord (Union (x , (x , x )))} ( isuc {od→ord x} lt ) refl lemma where
161
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
498 lemma : od→ord (Union (ord→od (od→ord x) , (ord→od (od→ord x) , ord→od (od→ord x))))
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
499 ≡ od→ord (Union (x , (x , x)))
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
500 lemma = cong (λ k → od→ord (Union ( k , ( k , k ) ))) oiso
4c704b7a62e4 ininite done
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 160
diff changeset
501
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
502 -- Axiom of choice ( is equivalent to the existence of minimal in our case )
162
b06f5d2f34b1 Axiom of choice
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 161
diff changeset
503 -- ∀ X [ ∅ ∉ X → (∃ f : X → ⋃ X ) → ∀ A ∈ X ( f ( A ) ∈ A ) ]
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
504 choice-func : (X : OD ) → {x : OD } → ¬ ( x == od∅ ) → ( X ∋ x ) → OD
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
505 choice-func X {x} not X∋x = minimal x not
223
2e1f19c949dc sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 219
diff changeset
506 choice : (X : OD ) → {A : OD } → ( X∋A : X ∋ A ) → (not : ¬ ( A == od∅ )) → A ∋ choice-func X not X∋A
258
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 257
diff changeset
507 choice X {A} X∋A not = x∋minimal A not
78
9a7a64b2388c infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 77
diff changeset
508
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
509 ---
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
510 --- With assuption of OD is ordered, p ∨ ( ¬ p ) <=> axiom of choice
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
511 ---
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
512 record choiced ( X : OD) : Set (suc n) where
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
513 field
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
514 a-choice : OD
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
515 is-in : X ∋ a-choice
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
516
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
517 choice-func' : (X : OD ) → (p∨¬p : ( p : Set (suc n)) → p ∨ ( ¬ p )) → ¬ ( X == od∅ ) → choiced X
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
518 choice-func' X p∨¬p not = have_to_find where
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
519 ψ : ( ox : Ordinal ) → Set (suc n)
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
520 ψ ox = (( x : Ordinal ) → x o< ox → ( ¬ def X x )) ∨ choiced X
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
521 lemma-ord : ( ox : Ordinal ) → ψ ox
235
846e0926bb89 fix cardinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 234
diff changeset
522 lemma-ord ox = TransFinite {ψ} induction ox where
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
523 ∋-p : (A x : OD ) → Dec ( A ∋ x )
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
524 ∋-p A x with p∨¬p (Lift (suc n) ( A ∋ x )) -- LEM
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
525 ∋-p A x | case1 (lift t) = yes t
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
526 ∋-p A x | case2 t = no (λ x → t (lift x ))
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
527 ∀-imply-or : {A : Ordinal → Set n } {B : Set (suc n) }
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
528 → ((x : Ordinal ) → A x ∨ B) → ((x : Ordinal ) → A x) ∨ B
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
529 ∀-imply-or {A} {B} ∀AB with p∨¬p (Lift ( suc n ) ((x : Ordinal ) → A x)) -- LEM
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
530 ∀-imply-or {A} {B} ∀AB | case1 (lift t) = case1 t
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
531 ∀-imply-or {A} {B} ∀AB | case2 x = case2 (lemma (λ not → x (lift not ))) where
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
532 lemma : ¬ ((x : Ordinal ) → A x) → B
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
533 lemma not with p∨¬p B
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
534 lemma not | case1 b = b
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
535 lemma not | case2 ¬b = ⊥-elim (not (λ x → dont-orb (∀AB x) ¬b ))
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
536 induction : (x : Ordinal) → ((y : Ordinal) → y o< x → ψ y) → ψ x
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
537 induction x prev with ∋-p X ( ord→od x)
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
538 ... | yes p = case2 ( record { a-choice = ord→od x ; is-in = p } )
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
539 ... | no ¬p = lemma where
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
540 lemma1 : (y : Ordinal) → (y o< x → def X y → ⊥) ∨ choiced X
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
541 lemma1 y with ∋-p X (ord→od y)
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
542 lemma1 y | yes y<X = case2 ( record { a-choice = ord→od y ; is-in = y<X } )
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
543 lemma1 y | no ¬y<X = case1 ( λ lt y<X → ¬y<X (subst (λ k → def X k ) (sym diso) y<X ) )
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
544 lemma : ((y : Ordinals.ord O) → (O Ordinals.o< y) x → def X y → ⊥) ∨ choiced X
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
545 lemma = ∀-imply-or lemma1
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
546 have_to_find : choiced X
271
2169d948159b fix incl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 262
diff changeset
547 have_to_find = dont-or (lemma-ord (od→ord X )) ¬¬X∋x where
234
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
548 ¬¬X∋x : ¬ ((x : Ordinal) → x o< (od→ord X) → def X x → ⊥)
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
549 ¬¬X∋x nn = not record {
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
550 eq→ = λ {x} lt → ⊥-elim (nn x (def→o< lt) lt)
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
551 ; eq← = λ {x} lt → ⊥-elim ( ¬x<0 lt )
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
552 }
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
553
e06b76e5b682 ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 228
diff changeset
554
226
176ff97547b4 set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 223
diff changeset
555 Union = ZF.Union OD→ZF
176ff97547b4 set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 223
diff changeset
556 Power = ZF.Power OD→ZF
176ff97547b4 set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 223
diff changeset
557 Select = ZF.Select OD→ZF
176ff97547b4 set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 223
diff changeset
558 Replace = ZF.Replace OD→ZF
176ff97547b4 set theortic function definition using sup
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 223
diff changeset
559 isZF = ZF.isZF OD→ZF