Mercurial > hg > Members > kono > Proof > ZF-in-agda
annotate zf.agda @ 201:a1a7caa8b305
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 30 Jul 2019 01:12:24 +0900 |
parents | 1f2c8b094908 |
children | 64ef1db53c49 |
rev | line source |
---|---|
3 | 1 module zf where |
2 | |
3 open import Level | |
4 | |
23 | 5 data Bool : Set where |
6 true : Bool | |
7 false : Bool | |
3 | 8 |
9 record _∧_ {n m : Level} (A : Set n) ( B : Set m ) : Set (n ⊔ m) where | |
10 field | |
11 proj1 : A | |
12 proj2 : B | |
13 | |
14 data _∨_ {n m : Level} (A : Set n) ( B : Set m ) : Set (n ⊔ m) where | |
15 case1 : A → A ∨ B | |
16 case2 : B → A ∨ B | |
17 | |
116 | 18 _⇔_ : {n m : Level } → ( A : Set n ) ( B : Set m ) → Set (n ⊔ m) |
77 | 19 _⇔_ A B = ( A → B ) ∧ ( B → A ) |
3 | 20 |
123 | 21 |
6 | 22 open import Relation.Nullary |
23 open import Relation.Binary | |
188
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
24 open import Data.Empty |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
25 |
6 | 26 |
138 | 27 contra-position : {n m : Level } {A : Set n} {B : Set m} → (A → B) → ¬ B → ¬ A |
28 contra-position {n} {m} {A} {B} f ¬b a = ¬b ( f a ) | |
103 | 29 |
166 | 30 double-neg : {n : Level } {A : Set n} → A → ¬ ¬ A |
31 double-neg A notnot = notnot A | |
32 | |
188
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
33 double-neg2 : {n : Level } {A : Set n} → ¬ ¬ ¬ A → ¬ A |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
34 double-neg2 notnot A = notnot ( double-neg A ) |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
35 |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
36 de-morgan : {n : Level } {A B : Set n} → A ∧ B → ¬ ( (¬ A ) ∨ (¬ B ) ) |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
37 de-morgan {n} {A} {B} and (case1 ¬A) = ⊥-elim ( ¬A ( _∧_.proj1 and )) |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
38 de-morgan {n} {A} {B} and (case2 ¬B) = ⊥-elim ( ¬B ( _∧_.proj2 and )) |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
39 |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
40 -- mid-ex-neg : {n : Level } {A : Set n} → ( ¬ ¬ A ) ∨ (¬ A) |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
41 -- mid-ex-neg {n} {A} = {!!} |
1f2c8b094908
axiom of choice → p ∨ ¬ p
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
186
diff
changeset
|
42 |
3 | 43 infixr 130 _∧_ |
44 infixr 140 _∨_ | |
45 infixr 150 _⇔_ | |
46 | |
6 | 47 record IsZF {n m : Level } |
48 (ZFSet : Set n) | |
49 (_∋_ : ( A x : ZFSet ) → Set m) | |
9
5ed16e2d8eb7
try to fix axiom of replacement
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
8
diff
changeset
|
50 (_≈_ : Rel ZFSet m) |
6 | 51 (∅ : ZFSet) |
18 | 52 (_,_ : ( A B : ZFSet ) → ZFSet) |
6 | 53 (Union : ( A : ZFSet ) → ZFSet) |
54 (Power : ( A : ZFSet ) → ZFSet) | |
115 | 55 (Select : (X : ZFSet ) → ( ψ : (x : ZFSet ) → Set m ) → ZFSet ) |
18 | 56 (Replace : ZFSet → ( ZFSet → ZFSet ) → ZFSet ) |
6 | 57 (infinite : ZFSet) |
58 : Set (suc (n ⊔ m)) where | |
3 | 59 field |
29
fce60b99dc55
posturate OD is isomorphic to Ordinal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
23
diff
changeset
|
60 isEquivalence : IsEquivalence {n} {m} {ZFSet} _≈_ |
3 | 61 -- ∀ x ∀ y ∃ z(x ∈ z ∧ y ∈ z) |
18 | 62 pair : ( A B : ZFSet ) → ( (A , B) ∋ A ) ∧ ( (A , B) ∋ B ) |
69 | 63 -- ∀ x ∃ y ∀ z (z ∈ y ⇔ ∃ u ∈ x ∧ (z ∈ u)) |
73 | 64 union→ : ( X z u : ZFSet ) → ( X ∋ u ) ∧ (u ∋ z ) → Union X ∋ z |
159 | 65 union← : ( X z : ZFSet ) → (X∋z : Union X ∋ z ) → ¬ ( (u : ZFSet ) → ¬ ((X ∋ u) ∧ (u ∋ z ))) |
3 | 66 _∈_ : ( A B : ZFSet ) → Set m |
67 A ∈ B = B ∋ A | |
23 | 68 _⊆_ : ( A B : ZFSet ) → ∀{ x : ZFSet } → Set m |
69 _⊆_ A B {x} = A ∋ x → B ∋ x | |
3 | 70 _∩_ : ( A B : ZFSet ) → ZFSet |
115 | 71 A ∩ B = Select A ( λ x → ( A ∋ x ) ∧ ( B ∋ x ) ) |
3 | 72 _∪_ : ( A B : ZFSet ) → ZFSet |
103 | 73 A ∪ B = Union (A , B) -- Select A ( λ x → ( A ∋ x ) ∨ ( B ∋ x ) ) is easer |
78
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
74 {_} : ZFSet → ZFSet |
9a7a64b2388c
infinite and replacement begin
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
77
diff
changeset
|
75 { x } = ( x , x ) |
3 | 76 infixr 200 _∈_ |
77 infixr 230 _∩_ _∪_ | |
78 infixr 220 _⊆_ | |
79 field | |
4 | 80 empty : ∀( x : ZFSet ) → ¬ ( ∅ ∋ x ) |
3 | 81 -- power : ∀ X ∃ A ∀ t ( t ∈ A ↔ t ⊆ X ) ) |
166 | 82 power→ : ∀( A t : ZFSet ) → Power A ∋ t → ∀ {x} → t ∋ x → ¬ ¬ ( A ∋ x ) -- _⊆_ t A {x} |
77 | 83 power← : ∀( A t : ZFSet ) → ( ∀ {x} → _⊆_ t A {x}) → Power A ∋ t |
65
164ad5a703d8
¬∅=→∅∈ : {n : Level} → { x : OD {suc n} } → ¬ ( x == od∅ {suc n} ) → x ∋ od∅ {suc n}
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
54
diff
changeset
|
84 -- extensionality : ∀ z ( z ∈ x ⇔ z ∈ y ) ⇒ ∀ w ( x ∈ w ⇔ y ∈ w ) |
186 | 85 extensionality : { A B w : ZFSet } → ( (z : ZFSet) → ( A ∋ z ) ⇔ (B ∋ z) ) → ( A ∈ w ⇔ B ∈ w ) |
183 | 86 -- This form of regurality forces choice function |
3 | 87 -- regularity : ∀ x ( x ≠ ∅ → ∃ y ∈ x ( y ∩ x = ∅ ) ) |
183 | 88 -- minimul : (x : ZFSet ) → ¬ (x ≈ ∅) → ZFSet |
89 -- regularity : ∀( x : ZFSet ) → (not : ¬ (x ≈ ∅)) → ( minimul x not ∈ x ∧ ( minimul x not ∩ x ≈ ∅ ) ) | |
90 -- another form of regularity | |
91 ε-induction : { ψ : ZFSet → Set m} | |
92 → ( {x : ZFSet } → ({ y : ZFSet } → x ∋ y → ψ y ) → ψ x ) | |
93 → (x : ZFSet ) → ψ x | |
3 | 94 -- infinity : ∃ A ( ∅ ∈ A ∧ ∀ x ∈ A ( x ∪ { x } ∈ A ) ) |
95 infinity∅ : ∅ ∈ infinite | |
160 | 96 infinity : ∀( x : ZFSet ) → x ∈ infinite → ( x ∪ { x }) ∈ infinite |
140
312e27aa3cb5
remove otrans again. start over
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
138
diff
changeset
|
97 selection : { ψ : ZFSet → Set m } → ∀ { X y : ZFSet } → ( ( y ∈ X ) ∧ ψ y ) ⇔ (y ∈ Select X ψ ) |
3 | 98 -- replacement : ∀ x ∀ y ∀ z ( ( ψ ( x , y ) ∧ ψ ( x , z ) ) → y = z ) → ∀ X ∃ A ∀ y ( y ∈ A ↔ ∃ x ∈ X ψ ( x , y ) ) |
130 | 99 replacement← : {ψ : ZFSet → ZFSet} → ∀ ( X x : ZFSet ) → x ∈ X → ψ x ∈ Replace X ψ |
138 | 100 replacement→ : {ψ : ZFSet → ZFSet} → ∀ ( X x : ZFSet ) → ( lt : x ∈ Replace X ψ ) → ¬ ( ∀ (y : ZFSet) → ¬ ( x ≈ ψ y ) ) |
183 | 101 -- ∀ X [ ∅ ∉ X → (∃ f : X → ⋃ X ) → ∀ A ∈ X ( f ( A ) ∈ A ) ] |
102 choice-func : (X : ZFSet ) → {x : ZFSet } → ¬ ( x ≈ ∅ ) → ( X ∋ x ) → ZFSet | |
103 choice : (X : ZFSet ) → {A : ZFSet } → ( X∋A : X ∋ A ) → (not : ¬ ( A ≈ ∅ )) → A ∋ choice-func X not X∋A | |
3 | 104 |
6 | 105 record ZF {n m : Level } : Set (suc (n ⊔ m)) where |
18 | 106 infixr 210 _,_ |
6 | 107 infixl 200 _∋_ |
108 infixr 220 _≈_ | |
109 field | |
110 ZFSet : Set n | |
111 _∋_ : ( A x : ZFSet ) → Set m | |
112 _≈_ : ( A B : ZFSet ) → Set m | |
113 -- ZF Set constructor | |
114 ∅ : ZFSet | |
18 | 115 _,_ : ( A B : ZFSet ) → ZFSet |
6 | 116 Union : ( A : ZFSet ) → ZFSet |
117 Power : ( A : ZFSet ) → ZFSet | |
115 | 118 Select : (X : ZFSet ) → ( ψ : (x : ZFSet ) → Set m ) → ZFSet |
18 | 119 Replace : ZFSet → ( ZFSet → ZFSet ) → ZFSet |
6 | 120 infinite : ZFSet |
18 | 121 isZF : IsZF ZFSet _∋_ _≈_ ∅ _,_ Union Power Select Replace infinite |
6 | 122 |