fix(library): remove "-[notations]" hack at "open -[notations] algebra"

library/data/bag.lean

@@ -8,7 +8,7 @@ Finite bags.
 import data.nat data.list.perm algebra.binary
 open nat quot list subtype binary function eq.ops
 open [declarations] perm
-open - [notations] algebra
+open algebra
 
 variable {A : Type}
 

library/data/finset/card.lean

@@ -7,7 +7,7 @@ Cardinality calculations for finite sets.
 -/
 import .to_set .bigops data.set.function data.nat.power data.nat.bigops
 open nat nat.finset eq.ops
-open - [notations] algebra
+open algebra
 
 namespace finset
 

library/data/finset/equiv.lean

@@ -5,7 +5,7 @@ Author: Leonardo de Moura
 -/
 import data.finset.card
 open nat nat.finset decidable
-open - [notations] algebra
+open algebra
 
 namespace finset
 variable {A : Type}

library/data/fintype/function.lean

@@ -7,7 +7,7 @@ Author : Haitao Zhang
 import data
 
 open nat function eq.ops
-open - [notations] algebra
+open algebra
 
 namespace list
 -- this is in preparation for counting the number of finite functions

library/data/hf.lean

@@ -10,9 +10,8 @@ we implement this module using a bijection from (finset nat) to nat, and
 this bijection is implemeted using the Ackermann coding.
 -/
 import data.nat data.finset.equiv data.list
-open nat binary
+open nat binary algebra
 open - [notations] finset
-open - [notations] algebra
 
 definition hf := nat
 

library/data/int/div.lean

@@ -10,7 +10,7 @@ Following SSReflect and the SMTlib standard, we define a mod b so that 0 ≤ a m
 import data.int.order data.nat.div
 open [coercions] [reduce_hints] nat
 open [declarations] [classes] nat (succ)
-open - [notations] algebra
+open algebra
 open eq.ops
 
 namespace int

library/data/int/order.lean

@@ -8,7 +8,7 @@ and transfer the results.
 -/
 import .basic algebra.ordered_ring
 open nat
-open - [notations] algebra
+open algebra
 open decidable
 open int eq.ops
 

library/data/int/power.lean

@@ -8,7 +8,7 @@ The power function on the integers.
 import data.int.basic data.int.order data.int.div algebra.group_power data.nat.power
 
 namespace int
-open - [notations] algebra
+open algebra
 
 definition int_has_pow_nat [reducible] [instance] [priority int.prio] : has_pow_nat int :=
 has_pow_nat.mk has_pow_nat.pow_nat

library/data/list/basic.lean

@@ -7,7 +7,7 @@ Basic properties of lists.
 -/
 import logic tools.helper_tactics data.nat.order
 open eq.ops helper_tactics nat prod function option
-open - [notations] algebra
+open algebra
 
 inductive list (T : Type) : Type :=
 | nil {} : list T

library/data/nat/basic.lean

@@ -289,7 +289,7 @@ nat.cases_on n
              ... = succ (succ n' * m' + n') : add_succ)⁻¹
           !succ_ne_zero))
 
-open - [notations] algebra
+open algebra
 protected definition comm_semiring [reducible] [trans_instance] : algebra.comm_semiring nat :=
 ⦃algebra.comm_semiring,
  add            := nat.add,

library/data/nat/div.lean

@@ -7,7 +7,7 @@ Definitions and properties of div and mod. Much of the development follows Isabe
 -/
 import data.nat.sub
 open eq.ops well_founded decidable prod
-open - [notations] algebra
+open algebra
 
 namespace nat
 

library/data/nat/fact.lean

@@ -6,7 +6,7 @@ Authors: Leonardo de Moura
 Factorial
 -/
 import data.nat.div
-open - [notations] algebra
+open algebra
 
 namespace nat
 definition fact : nat → nat

library/data/nat/gcd.lean

@@ -7,7 +7,7 @@ Definitions and properties of gcd, lcm, and coprime.
 -/
 import .div
 open eq.ops well_founded decidable prod
-open - [notations] algebra
+open algebra
 
 namespace nat
 

library/data/nat/order.lean

@@ -134,7 +134,7 @@ else (eq_max_left h) ▸ !le.refl
 
 /- nat is an instance of a linearly ordered semiring and a lattice -/
 
-open - [notations] algebra
+open algebra
 
 protected definition decidable_linear_ordered_semiring [reducible] [trans_instance] :
 algebra.decidable_linear_ordered_semiring nat :=

library/data/nat/pairing.lean

@@ -7,7 +7,7 @@ Elegant pairing function.
 -/
 import data.nat.sqrt data.nat.div
 open prod decidable
-open - [notations] algebra
+open algebra
 
 namespace nat
 definition mkpair (a b : nat) : nat :=

library/data/nat/power.lean

@@ -6,7 +6,7 @@ Authors: Leonardo de Moura, Jeremy Avigad
 The power function on the natural numbers.
 -/
 import data.nat.basic data.nat.order data.nat.div data.nat.gcd algebra.ring_power
-open - [notations] algebra
+open algebra
 
 namespace nat
 

library/data/nat/sqrt.lean

@@ -10,7 +10,7 @@ import data.nat.order data.nat.sub
 
 namespace nat
 open decidable
-open - [notations] algebra
+open algebra
 
 -- This is the simplest possible function that just performs a linear search
 definition sqrt_aux : nat → nat → nat

library/data/nat/sub.lean

@@ -289,7 +289,7 @@ sub.cases
                ... = k - n + n    : sub_add_cancel H3,
     le.intro (add.cancel_right H4))
 
-open - [notations] algebra
+open algebra
 
 theorem sub_pos_of_lt {m n : ℕ} (H : m < n) : n - m > 0 :=
 assert H1 : n = n - m + m, from (sub_add_cancel (le_of_lt H))⁻¹,

library/data/pnat.lean

@@ -10,7 +10,7 @@ are those needed for that construction.
 -/
 import data.rat.order data.nat
 open nat rat subtype eq.ops
-open - [notations] algebra
+open algebra
 
 namespace pnat
 

library/data/rat/basic.lean

@@ -7,7 +7,7 @@ The rational numbers as a field generated by the integers, defined as the usual
 -/
 import data.int algebra.field
 open int quot eq.ops
-open - [notations] algebra
+open algebra
 
 record prerat : Type :=
 (num : ℤ) (denom : ℤ) (denom_pos : denom > 0)

library/data/rat/order.lean

@@ -7,7 +7,7 @@ Adds the ordering, and instantiates the rationals as an ordered field.
 -/
 import data.int algebra.ordered_field algebra.group_power data.rat.basic
 open quot eq.ops
-open - [notations] algebra
+open algebra
 
 /- the ordering on representations -/
 

library/data/real/basic.lean

@@ -22,8 +22,8 @@ The construction of the reals is arranged in four files.
 -/
 import data.nat data.rat.order data.pnat
 open nat eq pnat
+open algebra
 open - [coercions] rat
-open - [notations] algebra
 
 local postfix `⁻¹` := pnat.inv
 local notation 0 := rat.of_num 0

library/theories/number_theory/bezout.lean

@@ -13,7 +13,7 @@ section Bezout
 
 open nat int
 open eq.ops well_founded decidable prod
-open - [notations] algebra
+open algebra
 
 private definition pair_nat.lt : ℕ × ℕ → ℕ × ℕ → Prop := measure pr₂
 private definition pair_nat.lt.wf : well_founded pair_nat.lt := intro_k (measure.wf pr₂) 20
@@ -92,8 +92,7 @@ implies prime (dvd_or_dvd_of_prime_of_dvd_mul).
 -/
 
 namespace nat
-open int
-open - [notations] algebra
+open int algebra
 
 example {p x y : ℕ} (pp : prime p) (H : p ∣ x * y) : p ∣ x ∨ p ∣ y :=
 decidable.by_cases

library/theories/number_theory/irrational_roots.lean

@@ -7,7 +7,7 @@ A proof that if n > 1 and a > 0, then the nth root of a is irrational, unless a
 -/
 import data.rat .prime_factorization
 open eq.ops
-open - [notations] algebra
+open algebra
 
 /- First, a textbook proof that sqrt 2 is irrational. -/
 

library/theories/number_theory/prime_factorization.lean

@@ -11,7 +11,7 @@ Multiplicity and prime factors. We have:
 -/
 import data.nat data.finset .primes
 open eq.ops finset well_founded decidable nat.finset
-open - [notations] algebra
+open algebra
 
 namespace nat
 

library/theories/number_theory/primes.lean

@@ -6,8 +6,7 @@ Authors: Leonardo de Moura, Jeremy Avigad
 Prime numbers.
 -/
 import data.nat logic.identities
-open bool
-open - [notations] algebra
+open bool algebra
 
 namespace nat
 open decidable