diff options
| author | coqbot-app[bot] | 2020-11-16 10:45:16 +0000 |
|---|---|---|
| committer | GitHub | 2020-11-16 10:45:16 +0000 |
| commit | 4775fd7724840205b345420507bdd1c7065059b0 (patch) | |
| tree | c4e270fbefd16817d3f10ea0a54ebf1395a56f4e /theories/Program | |
| parent | 779d2b915a970cdfc87d3d1b69e10bab04094f33 (diff) | |
| parent | dafb535f5f07591ed2b04aa34d40a5187b3c7f84 (diff) | |
Merge PR #13365: Fix proof of Coq.Program.Wf.Fix_F_inv to be axiom-free
Reviewed-by: anton-trunov
Reviewed-by: Blaisorblade
Diffstat (limited to 'theories/Program')
| -rw-r--r-- | theories/Program/Wf.v | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/theories/Program/Wf.v b/theories/Program/Wf.v index 50351d6a14..688db8b812 100644 --- a/theories/Program/Wf.v +++ b/theories/Program/Wf.v @@ -12,8 +12,6 @@ Require Import Coq.Init.Wf. Require Import Coq.Program.Utils. -Require Import ProofIrrelevance. -Require Import FunctionalExtensionality. Local Open Scope program_scope. @@ -51,7 +49,7 @@ Section Well_founded. Lemma Fix_F_inv : forall (x:A) (r s:Acc R x), Fix_F_sub x r = Fix_F_sub x s. Proof. intro x; induction (Rwf x); intros. - rewrite (proof_irrelevance (Acc R x) r s) ; auto. + rewrite <- 2 Fix_F_eq; intros. apply F_ext; intros []; auto. Qed. Lemma Fix_eq : forall x:A, Fix_sub x = F_sub x (fun y:{ y:A | R y x} => Fix_sub (proj1_sig y)). @@ -226,6 +224,7 @@ Ltac fold_sub f := (** This module provides the fixpoint equation provided one assumes functional extensionality. *) +Require Import FunctionalExtensionality. Module WfExtensionality. |