The Coq Proof Assistant

# Library Coq.Classes.Morphisms_Prop

# Proper instances for propositional connectives.

Author: Matthieu Sozeau Institution: LRI, CNRS UMR 8623 - University Paris Sud
Require Import Coq.Classes.Morphisms.
Require Import Coq.Program.Basics.
Require Import Coq.Program.Tactics.
Local Obligation Tactic := try solve [simpl_relation | firstorder auto].
Standard instances for not, iff and impl.
Logical negation.
#[global]
Program Instance not_impl_morphism :
Proper (impl --> impl) not | 1.
#[global]
Program Instance not_iff_morphism :
Proper (iff ++> iff) not.
Logical conjunction.
#[global]
Program Instance and_impl_morphism :
Proper (impl ==> impl ==> impl) and | 1.
#[global]
Program Instance and_iff_morphism :
Proper (iff ==> iff ==> iff) and.
Logical disjunction.
#[global]
Program Instance or_impl_morphism :
Proper (impl ==> impl ==> impl) or | 1.
#[global]
Program Instance or_iff_morphism :
Proper (iff ==> iff ==> iff) or.
Logical implication impl is a morphism for logical equivalence.
#[global]
Program Instance iff_iff_iff_impl_morphism : Proper (iff ==> iff ==> iff) impl.
Morphisms for quantifiers
#[global]
Program Instance ex_iff_morphism {A : Type} : Proper (pointwise_relation A iff ==> iff) (@ex A).
#[global]
Program Instance ex_impl_morphism {A : Type} :
Proper (pointwise_relation A impl ==> impl) (@ex A) | 1.
#[global]
Program Instance ex_flip_impl_morphism {A : Type} :
Proper (pointwise_relation A (flip impl) ==> flip impl) (@ex A) | 1.
#[global]
Program Instance all_iff_morphism {A : Type} :
Proper (pointwise_relation A iff ==> iff) (@all A).
#[global]
Program Instance all_impl_morphism {A : Type} :
Proper (pointwise_relation A impl ==> impl) (@all A) | 1.
#[global]
Program Instance all_flip_impl_morphism {A : Type} :
Proper (pointwise_relation A (flip impl) ==> flip impl) (@all A) | 1.
Equivalent points are simultaneously accessible or not
#[global]
Instance Acc_pt_morphism {A:Type}(E R : A->A->Prop)
`(Equivalence _ E) `(Proper _ (E==>E==>iff) R) :
Proper (E==>iff) (Acc R).
Equivalent relations have the same accessible points
#[global]
Instance Acc_rel_morphism {A:Type} :
Proper (relation_equivalence ==> Logic.eq ==> iff) (@Acc A).
Equivalent relations are simultaneously well-founded or not
#[global]
Instance well_founded_morphism {A : Type} :
Proper (relation_equivalence ==> iff) (@well_founded A).