diff options
| -rw-r--r-- | theories/Logic/ClassicalDescription.v | 2 | ||||
| -rw-r--r-- | theories/Logic/ClassicalFacts.v | 6 | ||||
| -rw-r--r-- | theories7/Logic/ClassicalDescription.v | 2 | ||||
| -rw-r--r-- | theories7/Logic/ClassicalFacts.v | 4 |
4 files changed, 7 insertions, 7 deletions
diff --git a/theories/Logic/ClassicalDescription.v b/theories/Logic/ClassicalDescription.v index d76d896585..b4d5aedfe5 100644 --- a/theories/Logic/ClassicalDescription.v +++ b/theories/Logic/ClassicalDescription.v @@ -29,7 +29,7 @@ Axiom exists y : B x, R x y /\ (forall y':B x, R x y' -> y = y')) -> exists f : forall x:A, B x, (forall x:A, R x (f x)). -(** Principle of definite description (aka axiom of unique choice) *) +(** Principle of definite descriptions (aka axiom of unique choice) *) Theorem description : forall (A B:Type) (R:A -> B -> Prop), diff --git a/theories/Logic/ClassicalFacts.v b/theories/Logic/ClassicalFacts.v index aa4960a35b..8e1696f872 100644 --- a/theories/Logic/ClassicalFacts.v +++ b/theories/Logic/ClassicalFacts.v @@ -10,8 +10,8 @@ (** Some facts and definitions about classical logic *) -(** [prop_degeneracy] asserts (up to consistency) that there are only *) -(* two distinct formulas *) +(** [prop_degeneracy] (also referred as propositional completeness) *) +(* asserts (up to consistency) that there are only two distinct formulas *) Definition prop_degeneracy := forall A:Prop, A = True \/ A = False. (** [prop_extensionality] asserts equivalent formulas are equal *) @@ -216,4 +216,4 @@ End Proof_irrelevance_CIC. satisfy propositional degeneracy without satisfying proof-irrelevance (nor dependent case analysis). This would imply that the previous results cannot be refined. -*)
\ No newline at end of file +*) diff --git a/theories7/Logic/ClassicalDescription.v b/theories7/Logic/ClassicalDescription.v index ea2f4f727d..37611923af 100644 --- a/theories7/Logic/ClassicalDescription.v +++ b/theories7/Logic/ClassicalDescription.v @@ -27,7 +27,7 @@ Axiom dependent_description : ((x:A)(EX y:(B x)|(R x y)/\ ((y':(B x))(R x y') -> y=y'))) -> (EX f:(x:A)(B x) | (x:A)(R x (f x))). -(** Principle of definite description (aka axiom of unique choice) *) +(** Principle of definite descriptions (aka axiom of unique choice) *) Theorem description : (A:Type;B:Type;R: A->B->Prop) diff --git a/theories7/Logic/ClassicalFacts.v b/theories7/Logic/ClassicalFacts.v index 622e6959d9..f70d886b3b 100644 --- a/theories7/Logic/ClassicalFacts.v +++ b/theories7/Logic/ClassicalFacts.v @@ -10,8 +10,8 @@ (** Some facts and definitions about classical logic *) -(** [prop_degeneracy] asserts (up to consistency) that there are only *) -(* two distinct formulas *) +(** [prop_degeneracy] (also referred as propositional completeness) *) +(* asserts (up to consistency) that there are only two distinct formulas *) Definition prop_degeneracy := (A:Prop) A==True \/ A==False. (** [prop_extensionality] asserts equivalent formulas are equal *) |