chore(*): minimize dependencies on tests

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

tests/lean/have1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using bool eq_ops tactic
 
 variables a b c : bool

tests/lean/interactive/simple.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace tst
 definition foo {A B : Type} (a : A) (b : B) := a

tests/lean/run/algebra1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 
 abbreviation Type1 := Type.{1}

tests/lean/run/booltst.lean

@@ -1,4 +1,4 @@
-import standard
+import data.bool
 using bool
 
 check ff

tests/lean/run/bug5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 theorem symm2 {A : Type} {a b : A} (H : a = b) : b = a
 := subst H (refl a)

tests/lean/run/bug6.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 section
   parameter {A : Type}
   theorem T {a b : A} (H : a = b) : b = a

tests/lean/run/calc.lean

@@ -1,4 +1,4 @@
-import standard
+import data.num
 using num
 
 namespace foo

tests/lean/run/class1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using num prod inhabited
 
 definition H : inhabited (Prop × num × (num → num)) := _

tests/lean/run/class2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using num prod nonempty inhabited
 
 theorem H {A B : Type} (H1 : inhabited A) : inhabited (Prop × A × (B → num))

tests/lean/run/class3.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using num prod inhabited
 
 section

tests/lean/run/class4.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 inductive nat : Type :=
 zero : nat,

tests/lean/run/class5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace algebra
   inductive mul_struct (A : Type) : Type :=

tests/lean/run/class6.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using prod
 
 inductive t1 : Type :=

tests/lean/run/class7.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num tactic
 
 inductive inh (A : Type) : Type :=

tests/lean/run/class8.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using num tactic prod
 
 inductive inh (A : Type) : Prop :=

tests/lean/run/coe2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace setoid
   inductive setoid : Type :=

tests/lean/run/coe3.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace setoid
   inductive setoid : Type :=

tests/lean/run/coe4.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace setoid
   inductive setoid : Type :=

tests/lean/run/coe5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace setoid
   inductive setoid : Type :=

tests/lean/run/decidable.lean

@@ -1,4 +1,4 @@
-import standard data.unit
+import logic data.unit
 using bool unit decidable
 
 variables a b c : bool

tests/lean/run/elab_bug1.lean

@@ -4,7 +4,7 @@
 --- Author: Jeremy Avigad
 ----------------------------------------------------------------------------------------------------
 
-import standard struc.function
+import logic struc.function
 
 using function
 

tests/lean/run/elim.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 variable p : num → num → num → Prop
 axiom H1 : ∃ x y z, p x y z

tests/lean/run/elim2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num tactic
 variable p : num → num → num → Prop
 axiom H1 : ∃ x y z, p x y z

tests/lean/run/full.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 namespace foo
   variable x : num.num
   check x

tests/lean/run/fun.lean

@@ -1,4 +1,4 @@
-import standard struc.function
+import logic struc.function
 using function num bool
 
 

tests/lean/run/goal.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem T {a b c d : Prop} (H : a) (H : b) (H : c) (H : d) : a

tests/lean/run/group.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 
 section

tests/lean/run/group2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 
 section

tests/lean/run/have5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 variables a b c d : Prop
 axiom Ha : a

tests/lean/run/id.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 definition id {A : Type} (a : A) := a
 check id id
 set_option pp.universes true

tests/lean/run/implicit.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 definition f {A : Type} {B : Type} (f : A → B → Prop) ⦃C : Type⦄ {R : C → C → Prop} {c : C} (H : R c c) : R c c
 := H
@@ -7,4 +7,3 @@ variable g : Prop → Prop → Prop
 variable H : true ∧ true
 
 check f g H
-

tests/lean/run/is_nil.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 inductive list (A : Type) : Type :=

tests/lean/run/let1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 check
   let f x y := x ∧ y,

tests/lean/run/nat_bug2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num eq_ops
 
 inductive nat : Type :=

tests/lean/run/nat_bug3.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num eq_ops
 
 inductive nat : Type :=

tests/lean/run/nat_bug4.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num eq_ops
 
 inductive nat : Type :=

tests/lean/run/nat_bug5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num eq_ops
 
 inductive nat : Type :=

tests/lean/run/nat_bug6.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using eq_ops
 
 inductive nat : Type :=

tests/lean/run/not_bug1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using bool
 
 variable list : Type.{1}
@@ -19,4 +19,3 @@ check a :: b :: nil
 check [a, b]
 check [a, b, c]
 check []
-

tests/lean/run/ns1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace foo
 namespace boo

tests/lean/run/num.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 check 14
 check 0
 check 3

tests/lean/run/ptst.lean

@@ -1,4 +1,4 @@
-import standard
+import logic data.prod
 using prod
 
 -- Test tuple notation

tests/lean/run/root.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 
 variable foo : Prop
@@ -15,6 +15,3 @@ namespace N1
     print raw _root_.foo
   end N2
 end N1
-
-
-

tests/lean/run/section1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 section

tests/lean/run/set.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using bool
 
 definition set {{T : Type}} := T → bool

tests/lean/run/set2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using bool
 
 namespace set

tests/lean/run/t8.lean

@@ -1,3 +1,3 @@
-import standard
+import logic
 using tactic
 print raw (by assumption)

tests/lean/run/tactic1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : A

tests/lean/run/tactic10.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a

tests/lean/run/tactic11.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a

tests/lean/run/tactic12.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b
@@ -9,8 +9,3 @@ theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b
           (assume Hna, absurd Ha Hna)
           (assume Hnb, absurd Hb Hnb));
       assumption
-
-
-
-
-

tests/lean/run/tactic13.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst (a b : Prop) (H : ¬ a ∨ ¬ b) (Hb : b) : ¬ a ∧ b :=

tests/lean/run/tactic14.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 definition basic_tac : tactic

tests/lean/run/tactic15.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 variable A : Type.{1}

tests/lean/run/tactic16.lean

@@ -1,4 +1,4 @@
-import standard data.string
+import logic data.string
 using tactic
 
 variable A : Type.{1}

tests/lean/run/tactic17.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 variable A : Type.{1}
@@ -8,5 +8,3 @@ theorem tst {a b c : A} (H1 : a = b) (H2 : b = c) : f a b = f b c
 := by apply (@congr A A (f a) (f b));
       apply (congr_arg f);
       !assumption
-
-

tests/lean/run/tactic18.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 variable A : Type.{1}
@@ -9,4 +9,3 @@ theorem tst {a b c : A} (H1 : a = b) (H2 : b = c) : f a b = f b c
       apply (subst H2);
       apply refl;
       assumption
-

tests/lean/run/tactic19.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A : Type} {f : A → A → A} {a b c : A} (H1 : a = b) (H2 : b = c) : f a b = f b c
@@ -6,4 +6,3 @@ theorem tst {A : Type} {f : A → A → A} {a b c : A} (H1 : a = b) (H2 : b = c)
       apply (subst H2);
       apply refl;
       assumption
-

tests/lean/run/tactic2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : A

tests/lean/run/tactic20.lean

@@ -1,12 +1,7 @@
-import standard
+import logic
 using tactic
 
 definition assump := eassumption
 
 theorem tst {A : Type} {a b c : A} (H1 : a = b) (H2 : b = c) : a = c
 := by apply trans; assump; assump
-
-
-
-
-

tests/lean/run/tactic21.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 definition assump := eassumption
@@ -12,6 +12,3 @@ theorem tst2 {A : Type} {a b c d : A} {p : A → A → Prop} (Ha : p a c) (H1 :
 (*
 print(get_env():find("tst2"):value())
 *)
-
-
-

tests/lean/run/tactic22.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem T (a b c d : Prop) (Ha : a) (Hb : b) (Hc : c) (Hd : d) : a ∧ b ∧ c ∧ d

tests/lean/run/tactic23.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num (num pos_num num_rec pos_num_rec)
 using tactic
 

tests/lean/run/tactic24.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 definition my_tac1 := apply @refl

tests/lean/run/tactic25.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 definition my_tac1 := apply @refl

tests/lean/run/tactic26.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic inhabited
 
 inductive sum (A : Type) (B : Type) : Type :=

tests/lean/run/tactic27.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 definition my_tac := repeat ([ apply @and_intro

tests/lean/run/tactic28.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic inhabited
 
 inductive sum (A : Type) (B : Type) : Type :=

tests/lean/run/tactic29.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 section

tests/lean/run/tactic3.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : A

tests/lean/run/tactic30.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 section

tests/lean/run/tactic4.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic (renaming id->id_tac)
 
 definition id {A : Type} (a : A) := a

tests/lean/run/tactic5.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic (renaming id->id_tac)
 
 definition id {A : Type} (a : A) := a

tests/lean/run/tactic6.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic (renaming id->id_tac)
 
 definition id {A : Type} (a : A) := a

tests/lean/run/tactic7.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A

tests/lean/run/tactic8.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : A ∧ B ∧ A

tests/lean/run/tactic9.lean

@@ -1,6 +1,5 @@
-import standard
+import logic
 using tactic
 
 theorem tst {A B : Prop} (H1 : A) (H2 : B) : ((fun x : Prop, x) A) ∧ B ∧ A
 := by apply and_intro; beta; assumption; apply and_intro; !assumption
-

tests/lean/run/trick.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using num
 
 definition proj1 (x : num) (y : num) := x

tests/lean/run/uni_issue1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 inductive nat : Type :=
 zero : nat,

tests/lean/run/unicode.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 variable N : Type
 variable α : N

tests/lean/run/univ1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 namespace S1
 hypothesis I : Type

tests/lean/run/univ2.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 
 hypothesis I : Type
 definition F (X : Type) : Type := (X → Prop) → Prop

tests/lean/show1.lean

@@ -1,4 +1,4 @@
-import standard
+import logic
 using bool eq_ops tactic
 
 variables a b c : bool

tests/lean/slow/nat_wo_hints.lean

@@ -3,7 +3,7 @@
 -- Released under Apache 2.0 license as described in the file LICENSE.
 -- Author: Floris van Doorn
 ----------------------------------------------------------------------------------------------------
-import standard struc.binary
+import logic struc.binary
 using tactic num binary eq_ops
 using decidable