Lots of refactoring towards partially-ordered ring R (#109)

This commit is contained in:
Patrick Stevens
2020-04-10 19:00:57 +01:00
committed by GitHub
parent 1cff95c652
commit 412edaf4c7
19 changed files with 1015 additions and 778 deletions

View File

@@ -1,4 +1,4 @@
{-# OPTIONS --safe --warning=error --without-K #-}
{-# OPTIONS --safe --warning=error --without-K --guardedness #-}
open import Functions
open import LogicalFormulae
@@ -8,6 +8,11 @@ open import Sets.FinSet.Definition
open import Sets.FinSet.Lemmas
open import Sets.Cardinality.Infinite.Definition
open import Sets.Cardinality.Finite.Lemmas
open import Numbers.Reals.Definition
open import Numbers.Rationals.Definition
open import Numbers.Integers.Definition
open import Sets.Cardinality.Infinite.Lemmas
open import Setoids.Setoids
module Sets.Cardinality.Infinite.Examples where
@@ -28,3 +33,7 @@ module Sets.Cardinality.Infinite.Examples where
bad a = (inv (toNat a))
badInj : Injection bad
badInj = injComp nextInj invInj
IsInfinite : DedekindInfiniteSet
DedekindInfiniteSet.inj IsInfinite n = injectionR (injectionQ (nonneg n))
DedekindInfiniteSet.isInjection IsInfinite {x} {y} pr = nonnegInjective (injectionQInjective (injectionRInjective pr))