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

changeset 291:ef93c56ad311

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
...
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Fri, 12 Jun 2020 19:21:14 +0900
parents 359402cc6c3d (current diff) 5de8905a5a2b (diff)
children 773e03dfd6ed
files OD.agda filter.agda
diffstat 2 files changed, 2 insertions(+), 8 deletions(-) [+]
line wrap: on
line diff
--- a/LEMC.agda	Fri Jun 12 19:19:16 2020 +0900
+++ b/LEMC.agda	Fri Jun 12 19:21:14 2020 +0900
@@ -32,12 +32,6 @@
 
 open choiced
 
-double-neg-eilm : {A : Set (suc n)} → ¬ ¬ A → A      -- we don't have this in intutionistic logic
-double-neg-eilm  {A} notnot with p∨¬p A                         -- assuming axiom of choice
-... | case1 p = p
-... | case2 ¬p = ⊥-elim ( notnot ¬p )
-
-
 OD→ZFC : ZFC
 OD→ZFC   = record { 
     ZFSet = OD 
--- a/OD.agda	Fri Jun 12 19:19:16 2020 +0900
+++ b/OD.agda	Fri Jun 12 19:21:14 2020 +0900
@@ -256,7 +256,7 @@
     ; infinite = infinite
     ; isZF = isZF 
  } where
-    ZFSet = OD 
+    ZFSet = OD             -- is less than Ords because of maxod
     Select : (X : OD  ) → ((x : OD  ) → Set n ) → OD 
     Select X ψ = record { def = λ x →  ( def X x ∧ ψ ( ord→od x )) }
     Replace : OD  → (OD  → OD  ) → OD 
@@ -270,7 +270,7 @@
     Power : OD  → OD 
     Power A = Replace (Def (Ord (od→ord A))) ( λ x → A ∩ x )
     -- ｛_｝ : ZFSet → ZFSet
-    -- ｛ x ｝ = ( x ,  x )
+    -- ｛ x ｝ = ( x ,  x )     -- it works but we don't use 
 
     data infinite-d  : ( x : Ordinal  ) → Set n where
         iφ :  infinite-d o∅