-
Notifications
You must be signed in to change notification settings - Fork 51
/
Copy pathMonoid_kernel.v
57 lines (52 loc) · 2.26 KB
/
Monoid_kernel.v
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
(* This program is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1 *)
(* of the License, or (at your option) any later version. *)
(* *)
(* This program is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *)
(* GNU General Public License for more details. *)
(* *)
(* You should have received a copy of the GNU Lesser General Public *)
(* License along with this program; if not, write to the Free *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA *)
Set Implicit Arguments.
Unset Strict Implicit.
Require Export Monoid_util.
Require Export Parts2.
Section Image_hom.
Variable M M' : MONOID.
Variable f : Hom M M'.
Definition image_monoid_hom : submonoid M'.
apply (BUILD_SUB_MONOID (G:=M') (H:=image_map f)).
simpl in |- *.
intros x y H' H'0; try assumption.
elim H'0; intros x0 E; elim E; intros H'1 H'2; try exact H'1; clear E H'0.
elim H'; intros x1 E; elim E; intros H'0 H'3; try exact H'0; clear E H'.
exists (sgroup_law M x1 x0); split; [ try assumption | idtac ].
apply
Trans
with
(sgroup_law M' (Ap (sgroup_map (monoid_sgroup_hom f)) x1)
(Ap (sgroup_map (monoid_sgroup_hom f)) x0));
auto with algebra.
simpl in |- *.
exists (monoid_unit M); split; [ try assumption | idtac ].
auto with algebra.
auto with algebra.
Defined.
Lemma image_monoid_prop : forall x : M, in_part (f x) image_monoid_hom.
simpl in |- *.
intros x; exists x; split; [ try assumption | idtac ]; auto with algebra.
Qed.
Lemma image_monoid_prop_rev :
forall y : M', in_part y image_monoid_hom -> exists x : M, Equal y (f x).
simpl in |- *.
intros y H'; try assumption.
elim H'; intros x E; elim E; intros H'0 H'1; try exact H'0; clear E H'.
exists x; try assumption.
Qed.
End Image_hom.
Hint Resolve image_monoid_prop image_monoid_prop: algebra.