Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate ODC.agda @ 339:feb0fcc430a9
...
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Sun, 12 Jul 2020 19:55:37 +0900 |
| parents | 12071f79f3cf |
| children | 7f919d6b045b |
| rev | line source |
|---|---|
| 16 | 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 |
| 276 | 3 module ODC {n : Level } (O : Ordinals {n} ) where |
| 3 | 4 |
|
14
e11e95d5ddee
separete constructible set
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
11
diff
changeset
|
5 open import zf |
| 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 | |
|
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 |
| 276 | 16 import OD |
|
213
22d435172d1a
separate logic and nat
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
210
diff
changeset
|
17 |
|
223
2e1f19c949dc
sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
219
diff
changeset
|
18 open inOrdinal O |
| 276 | 19 open OD O |
| 20 open OD.OD | |
| 21 open OD._==_ | |
|
277
d9d3654baee1
seperate choice from LEM
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
276
diff
changeset
|
22 open ODAxiom odAxiom |
| 258 | 23 |
| 329 | 24 open HOD |
| 25 | |
| 331 | 26 open _∧_ |
| 27 | |
| 329 | 28 _=h=_ : (x y : HOD) → Set n |
| 29 x =h= y = od x == od y | |
| 30 | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
31 postulate |
| 258 | 32 -- mimimul and x∋minimal is an Axiom of choice |
| 329 | 33 minimal : (x : HOD ) → ¬ (x =h= od∅ )→ HOD |
| 34 -- this should be ¬ (x =h= od∅ )→ ∃ ox → x ∋ Ord ox ( minimum of x ) | |
| 35 x∋minimal : (x : HOD ) → ( ne : ¬ (x =h= od∅ ) ) → odef x ( od→ord ( minimal x ne ) ) | |
| 330 | 36 -- minimality (may proved by ε-induction with LEM) |
| 329 | 37 minimal-1 : (x : HOD ) → ( ne : ¬ (x =h= od∅ ) ) → (y : HOD ) → ¬ ( odef (minimal x ne) (od→ord y)) ∧ (odef x (od→ord y) ) |
| 258 | 38 |
|
188
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
187
diff
changeset
|
39 |
|
189
540b845ea2de
Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
188
diff
changeset
|
40 -- |
|
540b845ea2de
Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
188
diff
changeset
|
41 -- 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
|
42 -- 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
|
43 -- |
| 257 | 44 |
| 331 | 45 pred-od : ( p : Set n ) → HOD |
| 46 pred-od p = record { od = record { def = λ x → (x ≡ o∅) ∧ p } ; | |
| 47 odmax = osuc o∅; <odmax = λ x → subst (λ k → k o< osuc o∅) (sym (proj1 x)) <-osuc } | |
| 48 | |
| 49 ppp : { p : Set n } { a : HOD } → pred-od p ∋ a → p | |
| 50 ppp {p} {a} d = proj2 d | |
| 257 | 51 |
| 331 | 52 p∨¬p : ( p : Set n ) → p ∨ ( ¬ p ) -- assuming axiom of choice |
| 53 p∨¬p p with is-o∅ ( od→ord (pred-od p )) | |
| 54 p∨¬p p | yes eq = case2 (¬p eq) where | |
| 55 ps = pred-od p | |
| 56 eqo∅ : ps =h= od∅ → od→ord ps ≡ o∅ | |
| 57 eqo∅ eq = subst (λ k → od→ord ps ≡ k) ord-od∅ ( cong (λ k → od→ord k ) (==→o≡ eq)) | |
| 58 lemma : ps =h= od∅ → p → ⊥ | |
| 59 lemma eq p0 = ¬x<0 {od→ord ps} (eq→ eq record { proj1 = eqo∅ eq ; proj2 = p0 } ) | |
| 60 ¬p : (od→ord ps ≡ o∅) → p → ⊥ | |
| 61 ¬p eq = lemma ( subst₂ (λ j k → j =h= k ) oiso o∅≡od∅ ( o≡→== eq )) | |
| 62 p∨¬p p | no ¬p = case1 (ppp {p} {minimal ps (λ eq → ¬p (eqo∅ eq))} lemma) where | |
| 63 ps = pred-od p | |
| 64 eqo∅ : ps =h= od∅ → od→ord ps ≡ o∅ | |
| 65 eqo∅ eq = subst (λ k → od→ord ps ≡ k) ord-od∅ ( cong (λ k → od→ord k ) (==→o≡ eq)) | |
| 66 lemma : ps ∋ minimal ps (λ eq → ¬p (eqo∅ eq)) | |
| 67 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
|
68 |
|
234
e06b76e5b682
ac from LEM in abstract ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
228
diff
changeset
|
69 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
|
70 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
|
71 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
|
72 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
|
73 |
|
223
2e1f19c949dc
sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
219
diff
changeset
|
74 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
|
75 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
|
76 ... | yes p = p |
|
540b845ea2de
Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
188
diff
changeset
|
77 ... | no ¬p = ⊥-elim ( notnot ¬p ) |
|
540b845ea2de
Axiom of choies implies p ∨ ( ¬ p )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
188
diff
changeset
|
78 |
| 329 | 79 OrdP : ( x : Ordinal ) ( y : HOD ) → Dec ( Ord x ∋ y ) |
|
223
2e1f19c949dc
sepration of ordinal from OD
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
219
diff
changeset
|
80 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
|
81 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
|
82 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
|
83 OrdP x y | tri> ¬a ¬b c = yes c |
| 119 | 84 |
| 276 | 85 open import zfc |
| 190 | 86 |
| 329 | 87 HOD→ZFC : ZFC |
| 88 HOD→ZFC = record { | |
| 89 ZFSet = HOD | |
|
43
0d9b9db14361
equalitu and internal parametorisity
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
42
diff
changeset
|
90 ; _∋_ = _∋_ |
| 329 | 91 ; _≈_ = _=h=_ |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
92 ; ∅ = od∅ |
| 28 | 93 ; Select = Select |
| 276 | 94 ; isZFC = isZFC |
| 28 | 95 } where |
| 276 | 96 -- infixr 200 _∈_ |
| 96 | 97 -- infixr 230 _∩_ _∪_ |
| 329 | 98 isZFC : IsZFC (HOD ) _∋_ _=h=_ od∅ Select |
| 276 | 99 isZFC = record { |
| 100 choice-func = choice-func ; | |
| 101 choice = choice | |
|
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
28
diff
changeset
|
102 } where |
| 258 | 103 -- Axiom of choice ( is equivalent to the existence of minimal in our case ) |
| 162 | 104 -- ∀ X [ ∅ ∉ X → (∃ f : X → ⋃ X ) → ∀ A ∈ X ( f ( A ) ∈ A ) ] |
| 329 | 105 choice-func : (X : HOD ) → {x : HOD } → ¬ ( x =h= od∅ ) → ( X ∋ x ) → HOD |
| 258 | 106 choice-func X {x} not X∋x = minimal x not |
| 329 | 107 choice : (X : HOD ) → {A : HOD } → ( X∋A : X ∋ A ) → (not : ¬ ( A =h= od∅ )) → A ∋ choice-func X not X∋A |
| 258 | 108 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
|
109 |