(* CSC: multiple interpretations in the same file are not considered in the
right order
-interpretation "Finite_enumerable representation" 'repr C i = (repr C _ i).*)
+interpretation "Finite_enumerable representation" 'repr C i = (repr C ? i).*)
-interpretation "Finite_enumerable order" 'card C = (order C _).
+interpretation "Finite_enumerable order" 'card C = (order C ?).
record finite_enumerable_SemiGroup : Type≝
{ semigroup:> SemiGroup;
interpretation "Index_of_finite_enumerable representation"
'index_of_finite_enumerable_semigroup e
=
- (index_of _ (is_finite_enumerable _) e).
+ (index_of ? (is_finite_enumerable ?) e).
(* several definitions/theorems to be moved somewhere else *)
∀G:finite_enumerable_SemiGroup.
left_cancellable ? (op G) →
right_cancellable ? (op G) →
- ∃e:G. isMonoid (mk_PreMonoid G e).
+ ∃e:G. IsMonoid (mk_PreMonoid G e).
intros;
letin f ≝(λn.ι(G \sub O · G \sub n));
cut (∀n.n ≤ order ? (is_finite_enumerable G) → ∃m.f m = n);
clearbody GOGO;
rewrite < HH in GOGO;
rewrite < HH in GOGO:(? ? % ?);
- rewrite > (op_associative ? G) in GOGO;
+ rewrite > (op_is_associative ? G) in GOGO;
letin GaGa ≝(H ? ? ? GOGO);
clearbody GaGa;
clear GOGO;
constructor 1;
[ simplify;
- apply (semigroup_properties G)
+ apply (is_semi_group G)
| unfold is_left_unit; intro;
letin GaxGax ≝(refl_eq ? (G \sub a ·x));
clearbody GaxGax; (* demo *)
rewrite < GaGa in GaxGax:(? ? % ?);
- rewrite > (op_associative ? (semigroup_properties G)) in GaxGax;
+ rewrite > (op_is_associative ? G) in GaxGax;
apply (H ? ? ? GaxGax)
| unfold is_right_unit; intro;
letin GaxGax ≝(refl_eq ? (x·G \sub a));
clearbody GaxGax;
rewrite < GaGa in GaxGax:(? ? % ?);
- rewrite < (op_associative ? (semigroup_properties G)) in GaxGax;
+ rewrite < (op_is_associative ? G) in GaxGax;
apply (H1 ? ? ? GaxGax)
]
]