Skip to content

Commit a71d881

Browse files
committed
chore: simp(a) +contextual
1 parent 762b123 commit a71d881

File tree

4 files changed

+4
-4
lines changed

4 files changed

+4
-4
lines changed

Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -142,7 +142,7 @@ theorem mem_verts_toSubgraph (p : G.Walk u v) : w ∈ p.toSubgraph.verts ↔ w
142142
| cons h p' ih =>
143143
rename_i x y z
144144
have : w = y ∨ w ∈ p'.support ↔ w ∈ p'.support :=
145-
by rintro (rfl | h) <;> simp [*], by simp (config := { contextual := true })
145+
by rintro (rfl | h) <;> simp [*], by simp +contextual⟩
146146
simp [ih, or_assoc, this]
147147

148148
lemma not_nil_of_adj_toSubgraph {u v} {x : V} {p : G.Walk u v} (hadj : p.toSubgraph.Adj w x) :

Mathlib/Data/Multiset/Fintype.lean

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -118,7 +118,7 @@ theorem mem_of_mem_toEnumFinset {p : α × ℕ} (h : p ∈ m.toEnumFinset) : p.1
118118
obtain ⟨n, han, hn⟩ : ∃ n ≥ card (s.1.filter fun x ↦ a = x.1) - 1, (a, n) ∈ s := by
119119
by_contra! h
120120
replace h : {x ∈ s | x.1 = a} ⊆ {a} ×ˢ .range (card (s.1.filter fun x ↦ a = x.1) - 1) := by
121-
simpa (config := { contextual := true }) [forall_swap (β := _ = a), Finset.subset_iff,
121+
simpa +contextual [forall_swap (β := _ = a), Finset.subset_iff,
122122
imp_not_comm, not_le, Nat.lt_sub_iff_add_lt] using h
123123
have : card (s.1.filter fun x ↦ a = x.1) ≤ card (s.1.filter fun x ↦ a = x.1) - 1 := by
124124
simpa [Finset.card, eq_comm] using Finset.card_mono h

Mathlib/Order/Interval/Set/Image.lean

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -249,7 +249,7 @@ private lemma image_subtype_val_Ixx_Iix {p q r : α → α → Prop} {a b : α}
249249
(h : ∀ {x}, r x c → q x b) :
250250
Subtype.val '' {y : {x // p a x ∧ q x b} | r y.1 c.1} = {y : α | p a y ∧ r y c.1} :=
251251
(Subtype.image_preimage_val {x | p a x ∧ q x b} {y | r y c.1}).trans <| by
252-
ext; simp (config := { contextual := true}) [h]
252+
ext; simp +contextual [h]
253253

254254
variable [Preorder α] {p : α → Prop}
255255

Mathlib/Topology/Algebra/Field.lean

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -167,7 +167,7 @@ theorem IsPreconnected.eq_or_eq_neg_of_sq_eq [Field 𝕜] [HasContinuousInv₀
167167
EqOn f g S ∨ EqOn f (-g) S := by
168168
have hsq : EqOn ((f / g) ^ 2) 1 S := fun x hx => by
169169
simpa [div_eq_one_iff_eq (pow_ne_zero _ (hg_ne hx)), div_pow] using hsq hx
170-
simpa (config := { contextual := true }) [EqOn, div_eq_iff (hg_ne _)]
170+
simpa +contextual [EqOn, div_eq_iff (hg_ne _)]
171171
using hS.eq_one_or_eq_neg_one_of_sq_eq (hf.div hg fun z => hg_ne) hsq
172172

173173
/-- If `f, g` are functions `α → 𝕜`, both continuous on a preconnected set `S`, with

0 commit comments

Comments
 (0)