right associative with precedence 55
for @{ 'arrow $s $t }.
-interpretation "universal type" 'forall S T = (cic:/matita/test/Typ.ind#xpointer(1/1/5) S T).
+interpretation "universal type" 'forall S T = (cic:/matita/Fsub/defn/Typ.ind#xpointer(1/1/5) S T).
-interpretation "bound var" 'var x = (cic:/matita/test/Typ.ind#xpointer(1/1/1) x).
+interpretation "bound var" 'var x = (cic:/matita/Fsub/defn/Typ.ind#xpointer(1/1/1) x).
-interpretation "bound tvar" 'tvar x = (cic:/matita/test/Typ.ind#xpointer(1/1/3) x).
+interpretation "bound tvar" 'tvar x = (cic:/matita/Fsub/defn/Typ.ind#xpointer(1/1/3) x).
-interpretation "bound tname" 'tname x = (cic:/matita/test/Typ.ind#xpointer(1/1/2) x).
+interpretation "bound tname" 'tname x = (cic:/matita/Fsub/defn/Typ.ind#xpointer(1/1/2) x).
-interpretation "arrow type" 'arrow S T = (cic:/matita/test/Typ.ind#xpointer(1/1/4) S T).
+interpretation "arrow type" 'arrow S T = (cic:/matita/Fsub/defn/Typ.ind#xpointer(1/1/4) S T).
(*** Various kinds of substitution, not all will be used probably ***)
rewrite < Hletin2 in H12;rewrite < H14 in H12;lapply (H5 H12);
elim Hletin3]
|rewrite > subst_O_nat;apply in_FV_subst;assumption]]]
-qed.
\ No newline at end of file
+qed.
(**************************************************************************)
set "baseuri" "cic:/matita/Fsub/part1a/".
-include "library/logic/equality.ma".
-include "library/nat/nat.ma".
-include "library/datatypes/bool.ma".
-include "library/nat/compare.ma".
+include "logic/equality.ma".
+include "nat/nat.ma".
+include "datatypes/bool.ma".
+include "nat/compare.ma".
include "Fsub/defn.ma".
theorem JS_Refl : \forall T,G.(WFType G T) \to (WFEnv G) \to (JSubtype G T T).
(JSubtype (G2 @ (mk_bound true X P :: G1)) T U).
intros;elim (JS_trans_narrow (t_len Q));apply (H3 ? ? ? ? ? ? ? ? H H1);
constructor 1;
-qed.
\ No newline at end of file
+qed.
(**************************************************************************)
-(* ___ *)
+(* ___ *)
(* ||M|| *)
(* ||A|| A project by Andrea Asperti *)
(* ||T|| *)
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/apply2".
+set "baseuri" "cic:/matita/tests/apply2".
include "nat/nat.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/applys".
+set "baseuri" "cic:/matita/tests/applys".
include "nat/div_and_mod.ma".
include "nat/factorial.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/continuationals/".
+set "baseuri" "cic:/matita/tests/continuationals".
include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/decl".
+set "baseuri" "cic:/matita/tests/decl".
include "nat/times.ma".
include "nat/orders.ma".
destruct absurd.
by final
done.
-qed.
\ No newline at end of file
+qed.
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/dependent_injection/".
+set "baseuri" "cic:/matita/tests/dependent_injection".
include "legacy/coq.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/injection/".
+set "baseuri" "cic:/matita/tests/injection".
include "legacy/coq.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/".
+set "baseuri" "cic:/matita/tests/naiveparamod".
include "logic/equality.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/paramodulation/group".
+set "baseuri" "cic:/matita/tests/paramodulation/group".
include "legacy/coq.ma".
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/".
+set "baseuri" "cic:/matita/tests/pullback".
inductive T : Type \def t : T.
inductive L : Type \def l : L.
definition P2_to_R : P2 \to R \def \lambda x.r.
definition P1_to_P1 : P1 \to P1 \def \lambda x.p1.
-coercion cic:/matita/test/L_to_T.con.
-coercion cic:/matita/test/R_to_T.con.
-coercion cic:/matita/test/P1_to_L.con.
-coercion cic:/matita/test/P1_to_R1.con.
-coercion cic:/matita/test/R1_to_R.con.
-coercion cic:/matita/test/R1_to_P2.con.
-coercion cic:/matita/test/P2_to_L.con.
-coercion cic:/matita/test/P2_to_R.con.
-coercion cic:/matita/test/P1_to_P1.con.
+coercion cic:/matita/tests/pullback/L_to_T.con.
+coercion cic:/matita/tests/pullback/R_to_T.con.
+coercion cic:/matita/tests/pullback/P1_to_L.con.
+coercion cic:/matita/tests/pullback/P1_to_R1.con.
+coercion cic:/matita/tests/pullback/R1_to_R.con.
+coercion cic:/matita/tests/pullback/R1_to_P2.con.
+coercion cic:/matita/tests/pullback/P2_to_L.con.
+coercion cic:/matita/tests/pullback/P2_to_R.con.
+coercion cic:/matita/tests/pullback/P1_to_P1.con.
(* *)
(**************************************************************************)
-set "baseuri" "cic:/matita/test/tinycals".
+set "baseuri" "cic:/matita/tests/tinycals".
theorem prova:
\forall A,B,C:Prop.