Quellcode-Bibliothek
© Kompilation durch diese Firma
[Weder Korrektheit noch Funktionsfähigkeit der Software werden zugesichert.]
Datei:
Transitive_Closure.v
Sprache: Unknown
|
(************************************************************************)
(* * The Coq Proof Assistant / The Coq Development Team *)
(* v * INRIA, CNRS and contributors - Copyright 1999-2018 *)
(* <O___,, * (see CREDITS file for the list of authors) *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(* * (see LICENSE file for the text of the license) *)
(************************************************************************)
(** Author: Bruno Barras *)
Require Import Relation_Definitions.
Require Import Relation_Operators.
Section Wf_Transitive_Closure.
Variable A : Type.
Variable R : relation A.
Notation trans_clos := (clos_trans A R).
Lemma incl_clos_trans : inclusion A R trans_clos.
red; auto with sets.
Qed.
Lemma Acc_clos_trans : forall x:A, Acc R x -> Acc trans_clos x.
induction 1 as [x0 _ H1].
apply Acc_intro.
intros y H2.
induction H2; auto with sets.
apply Acc_inv with y; auto with sets.
Defined.
Hint Resolve Acc_clos_trans : core.
Lemma Acc_inv_trans : forall x y:A, trans_clos y x -> Acc R x -> Acc R y.
Proof.
induction 1 as [| x y]; auto with sets.
intro; apply Acc_inv with y; assumption.
Qed.
Theorem wf_clos_trans : well_founded R -> well_founded trans_clos.
Proof.
unfold well_founded; auto with sets.
Defined.
End Wf_Transitive_Closure.
[ Dauer der Verarbeitung: 0.1 Sekunden
(vorverarbeitet)
]
|
|
