include "hints_declaration.ma".
alias symbol "hint_decl" = "hint_decl_Type2".
-unification hint 0 ≔ A : ? ⊢ carr1 (powerclass_setoid A) ≡ Ω^A.
+unification hint 0 ≔ A ⊢ carr1 (powerclass_setoid A) ≡ Ω^A.
(************ SETS OVER SETOIDS ********************)
| napply (qseteq A) ]
nqed.
-unification hint 0 ≔ A : ? ⊢
+unification hint 0 ≔ A ⊢
carr1 (qpowerclass_setoid A) ≡ qpowerclass A.
nlemma mem_ok: ∀A. binary_morphism1 (setoid1_of_setoid A) (qpowerclass_setoid A) CPROP.
nqed.
unification hint 0 ≔
- A : setoid, x : ?, S : ? ⊢ (mem_ok A) x S ≡ mem A S x.
+ A : setoid, x, S ⊢ (mem_ok A) x S ≡ mem A S x.
nlemma subseteq_ok: ∀A. binary_morphism1 (qpowerclass_setoid A) (qpowerclass_setoid A) CPROP.
#A; napply mk_binary_morphism1
(* unfold if intersect, exposing fun21 *)
alias symbol "hint_decl" = "hint_decl_Type1".
unification hint 0 ≔
- A : setoid, B : qpowerclass A, C : qpowerclass A ⊢
+ A : setoid, B,C : qpowerclass A ⊢
pc A (intersect_ok A B C) ≡ intersect ? (pc ? B) (pc ? C).
(* hints can pass under mem *) (* ??? XXX why is it needed? *)
-unification hint 0 ≔ A:?, B:?, x:?;
+unification hint 0 ≔ A,B,x ;
C ≟ B
(*---------------------*) ⊢
mem A B x ≡ mem A C x.