blob: f2f0b5acb968b46febdfa1fcd4dfb10408fb95a9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
Require Import Coq.Classes.Morphisms.
Require Import Relation_Definitions.
Fixpoint tuple' n T : Type :=
match n with
| O => T
| S n' => (tuple' n' T * T)%type
end.
Definition tuple n T : Type :=
match n with
| O => unit
| S n' => tuple' n' T
end.
Fixpoint fieldwise' {A B} (n:nat) (R:A->B->Prop) (a:tuple' n A) (b:tuple' n B) {struct n} : Prop.
destruct n; simpl @tuple' in *.
{ exact (R a b). }
{ exact (R (snd a) (snd b) /\ fieldwise' _ _ n R (fst a) (fst b)). }
Defined.
Definition fieldwise {A B} (n:nat) (R:A->B->Prop) (a:tuple n A) (b:tuple n B) : Prop.
destruct n; simpl @tuple in *.
{ exact True. }
{ exact (fieldwise' _ R a b). }
Defined.
Global Instance Equivalence_fieldwise' {A} {R:relation A} {R_equiv:Equivalence R} {n:nat}:
Equivalence (fieldwise' n R).
Proof.
induction n; [solve [auto]|].
simpl; constructor; repeat intro; intuition eauto.
Qed.
Global Instance Equivalence_fieldwise {A} {R:relation A} {R_equiv:Equivalence R} {n:nat}:
Equivalence (fieldwise n R).
Proof.
destruct n; (repeat constructor || apply Equivalence_fieldwise').
Qed.
Arguments fieldwise' {A B n} _ _ _.
Arguments fieldwise {A B n} _ _ _.
|