coercion Leibniz.
*)
-interpretation "setoid1 eq" 'eq x y = (eq_rel1 _ (eq1 _) x y).
-interpretation "setoid eq" 'eq x y = (eq_rel _ (eq _) x y).
-interpretation "setoid1 symmetry" 'invert r = (sym1 ____ r).
-interpretation "setoid symmetry" 'invert r = (sym ____ r).
+interpretation "setoid1 eq" 'eq t x y = (eq_rel1 ? (eq1 t) x y).
+interpretation "setoid eq" 'eq t x y = (eq_rel ? (eq t) x y).
+interpretation "setoid1 symmetry" 'invert r = (sym1 ???? r).
+interpretation "setoid symmetry" 'invert r = (sym ???? r).
notation ".= r" with precedence 50 for @{'trans $r}.
-interpretation "trans1" 'trans r = (trans1 _____ r).
-interpretation "trans" 'trans r = (trans _____ r).
+interpretation "trans1" 'trans r = (trans1 ????? r).
+interpretation "trans" 'trans r = (trans ????? r).
record unary_morphism (A,B: setoid1) : Type0 ≝
{ fun_1:1> A → B;
notation "† c" with precedence 90 for @{'prop1 $c }.
notation "l ‡ r" with precedence 90 for @{'prop $l $r }.
notation "#" with precedence 90 for @{'refl}.
-interpretation "prop_1" 'prop1 c = (prop_1 _____ c).
-interpretation "prop1" 'prop l r = (prop1 ________ l r).
-interpretation "prop" 'prop l r = (prop ________ l r).
-interpretation "refl1" 'refl = (refl1 ___).
-interpretation "refl" 'refl = (refl ___).
+interpretation "prop_1" 'prop1 c = (prop_1 ????? c).
+interpretation "prop1" 'prop l r = (prop1 ???????? l r).
+interpretation "prop" 'prop l r = (prop ???????? l r).
+interpretation "refl1" 'refl = (refl1 ???).
+interpretation "refl" 'refl = (refl ???).
definition CPROP: setoid1.
constructor 1;
qed.
notation ". r" with precedence 50 for @{'if $r}.
-interpretation "if" 'if r = (if' __ r).
+interpretation "if" 'if r = (if' ?? r).
definition and_morphism: binary_morphism1 CPROP CPROP CPROP.
constructor 1;
| apply (fi ?? H1 b1)]]
qed.
-interpretation "and_morphism" 'and a b = (fun1 ___ and_morphism a b).
+interpretation "and_morphism" 'and a b = (fun1 ??? and_morphism a b).
definition or_morphism: binary_morphism1 CPROP CPROP CPROP.
constructor 1;
| apply (fi ?? H1 b1)]]
qed.
-interpretation "or_morphism" 'or a b = (fun1 ___ or_morphism a b).
+interpretation "or_morphism" 'or a b = (fun1 ??? or_morphism a b).
definition if_morphism: binary_morphism1 CPROP CPROP CPROP.
constructor 1;
notation "'ASSOC'" with precedence 90 for @{'assoc}.
notation "'ASSOC1'" with precedence 90 for @{'assoc1}.
-interpretation "category1 composition" 'compose x y = (fun1 ___ (comp1 ____) y x).
-interpretation "category1 assoc" 'assoc1 = (comp_assoc1 ________).
-interpretation "category composition" 'compose x y = (fun ___ (comp ____) y x).
-interpretation "category assoc" 'assoc = (comp_assoc ________).
+interpretation "category1 composition" 'compose x y = (fun1 ??? (comp1 ????) y x).
+interpretation "category1 assoc" 'assoc1 = (comp_assoc1 ????????).
+interpretation "category composition" 'compose x y = (fun ??? (comp ????) y x).
+interpretation "category assoc" 'assoc = (comp_assoc ????????).
definition unary_morphism_setoid: setoid → setoid → setoid.
intros;
intros; apply (prop_1 A B w a b H);
qed.
-interpretation "SET dagger" 'prop1 h = (prop_1_SET _ _ _ _ _ h).
+interpretation "SET dagger" 'prop1 h = (prop_1_SET ? ? ? ? ? h).