Loogle!

Result

Found 199 declarations mentioning Sym2.mk.

• Sym2.mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_4} (a b : α) : Sym2 α
• Sym2.eq_swap 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b : α} : s(a, b) = s(b, a)
• Sym2.mk_isDiag_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x y : α} : s(x, y).IsDiag ↔ x = y
• Sym2.mk_surjective 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} : Function.Surjective (Function.uncurry Sym2.mk)
• Sym2.ind 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {f : Sym2 α → Prop} (h : ∀ (x y : α), f s(x, y)) (i : Sym2 α) : f i
• Sym2.inductionOn 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {f : Sym2 α → Prop} (i : Sym2 α) (hf : ∀ (x y : α), f s(x, y)) : f i
• Sym2.forall 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_4} {f : Sym2 α → Prop} : (∀ (x : Sym2 α), f x) ↔ ∀ (x y : α), f s(x, y)
• Sym2.fst_out_mk_self 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x : α} : (Quot.out s(x, x)).1 = x
• Sym2.mem_mk_left 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (x y : α) : x ∈ s(x, y)
• Sym2.mem_mk_right 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (x y : α) : y ∈ s(x, y)
• Sym2.snd_out_mk_self 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x : α} : (Quot.out s(x, x)).2 = x
• Sym2.diagElem_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b : α} (h : s(a, b).IsDiag) : s(a, b).diagElem h = a
• Sym2.congr_left 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c : α} : s(b, a) = s(c, a) ↔ b = c
• Sym2.congr_right 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c : α} : s(a, b) = s(a, c) ↔ b = c
• Sym2.mem_iff' 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c : α} : Sym2.Mem a s(b, c) ↔ a = b ∨ a = c
• Sym2.exists 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_4} {f : Sym2 α → Prop} : (∃ x, f x) ↔ ∃ x y, f s(x, y)
• Sym2.map_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} (f : α → β) (a b : α) : Sym2.map f s(a, b) = s(f a, f b)
• Sym2.recOnSubsingleton 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {motive : Sym2 α → Sort u_4} [∀ (a b : α), Subsingleton (motive s(a, b))] (z : Sym2 α) (f : (a b : α) → motive s(a, b)) : motive z
• Sym2.add_mk 📋 Mathlib.Data.Sym.Sym2
  {M : Type u_4} [AddCommMagma M] (a b : M) : s(a, b).add = a + b
• Sym2.mul_mk 📋 Mathlib.Data.Sym.Sym2
  {M : Type u_4} [CommMagma M] (a b : M) : s(a, b).mul = a * b
• Sym2.toRel_prop 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (s : Set (Sym2 α)) (x y : α) : Sym2.ToRel s x y ↔ s(x, y) ∈ s
• Sym2.inductionOn₂ 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {f : Sym2 α → Sym2 β → Prop} (i : Sym2 α) (j : Sym2 β) (hf : ∀ (a₁ a₂ : α) (b₁ b₂ : β), f s(a₁, a₂) s(b₁, b₂)) : f i j
• Sym2.mkEmbedding_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (a b : α) : (Sym2.mkEmbedding a) b = s(a, b)
• Set.sym2_singleton 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (a : α) : {a}.sym2 = {s(a, a)}
• Sym2.exact 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c d : α} (h : s(a, b) = s(c, d)) : Sym2.Rel α (a, b) (c, d)
• Sym2.mem_iff_exists 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x : α} {z : Sym2 α} : x ∈ z ↔ ∃ y, z = s(x, y)
• Sym2.other_spec 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a : α} {z : Sym2 α} (h : a ∈ z) : s(a, Sym2.Mem.other h) = z
• Sym2.sound 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c d : α} (h : Sym2.Rel α (a, b) (c, d)) : s(a, b) = s(c, d)
• Sym2.ball 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {p : α → Prop} {a b : α} : (∀ c ∈ s(a, b), p c) ↔ p a ∧ p b
• Sym2.eq 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c d : α} : s(a, b) = s(c, d) ↔ Sym2.Rel α (a, b) (c, d)
• Sym2.forall_mem_pair 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {P : α → Prop} {a b : α} : (∀ x ∈ s(a, b), P x) ↔ P a ∧ P b
• Sym2.mem_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {a b c : α} : a ∈ s(b, c) ↔ a = b ∨ a = c
• Sym2.coe_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x y : α} : ↑s(x, y) = {x, y}
• Sym2.fromRel_prop 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {r : α → α → Prop} {sym : Std.Symm r} {a b : α} : s(a, b) ∈ Sym2.fromRel sym ↔ r a b
• Sym2.toFinset_mk_eq 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} [DecidableEq α] {x y : α} : s(x, y).toFinset = {x, y}
• Sym2.other_spec' 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} [DecidableEq α] {a : α} {z : Sym2 α} (h : a ∈ z) : s(a, Sym2.Mem.other' h) = z
• Sym2.hrec 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {motive : Sym2 α → Sort u_4} (f : (a b : α) → motive s(a, b)) (h : ∀ (a b : α), f a b ≍ f b a) (z : Sym2 α) : motive z
• Sym2.eq_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x y z w : α} : s(x, y) = s(z, w) ↔ x = z ∧ y = w ∨ x = w ∧ y = z
• Set.sym2_eq_mk_image 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {s : Set α} : s.sym2 = Function.uncurry Sym2.mk '' s ×ˢ s
• Set.mk_preimage_sym2 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {s : Set α} : Function.uncurry Sym2.mk ⁻¹' s.sym2 = s ×ˢ s
• Set.mk_mem_sym2_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {s : Set α} {x y : α} : s(x, y) ∈ s.sym2 ↔ x ∈ s ∧ y ∈ s
• Sym2.mem_and_mem_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {x y : α} {z : Sym2 α} (hne : x ≠ y) : x ∈ z ∧ y ∈ z ↔ z = s(x, y)
• Set.sym2_insert 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} (a : α) (s : Set α) : (insert a s).sym2 = (fun b => s(a, b)) '' insert a s ∪ s.sym2
• Sym2.mk_eq_mk_iff 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {p q : α × α} : s(p.1, p.2) = s(q.1, q.2) ↔ p = q ∨ p = q.swap
• Sym2.fromRelNdrec_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {r : α → α → Prop} {motive : Sort u_4} {sym : Std.Symm r} {a b : α} (hz : r a b) (f : (a b : α) → r a b → motive) (h : ∀ (a b : α) (h : r a b), f a b h = f b a ⋯) : Sym2.fromRelNdrec s(a, b) hz f h = f a b hz
• Sym2.pmap_pair 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {P : α → Prop} (f : (a : α) → P a → β) (a b : α) (h : ∀ x ∈ s(a, b), P x) : Sym2.pmap f s(a, b) h = s(f a ⋯, f b ⋯)
• Sym2.rec 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {motive : Sym2 α → Sort u_4} (f : (a b : α) → motive s(a, b)) (h : ∀ (a b c d : α) (h : Sym2.Rel α (a, b) (c, d)), ⋯ ▸ f a b = f c d) (z : Sym2 α) : motive z
• Sym2.recOn 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {motive : Sym2 α → Sort u_4} (z : Sym2 α) (f : (a b : α) → motive s(a, b)) (h : ∀ (a b c d : α) (h : Sym2.Rel α (a, b) (c, d)), ⋯ ▸ f a b = f c d) : motive z
• Sym2.pair_eq_pmap 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {P : α → Prop} (f : (a : α) → P a → β) (a b : α) (h : P a) (h' : P b) : s(f a h, f b h') = Sym2.pmap f s(a, b) ⋯
• Sym2.filter_image_mk_isDiag 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} [DecidableEq α] (s : Finset α) : {x ∈ Finset.image (Function.uncurry Sym2.mk) (s ×ˢ s) | x.IsDiag} = Finset.image (Function.uncurry Sym2.mk) s.diag
• Sym2.filter_image_mk_not_isDiag 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} [DecidableEq α] (s : Finset α) : {x ∈ Finset.image (Function.uncurry Sym2.mk) (s ×ˢ s) | ¬x.IsDiag} = Finset.image (Function.uncurry Sym2.mk) s.offDiag
• Sym2.coe_lift_symm_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} (F : Sym2 α → β) (a₁ a₂ : α) : ↑(Sym2.lift.symm F) a₁ a₂ = F s(a₁, a₂)
• Sym2.lift_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} (f : { f // ∀ (a₁ a₂ : α), f a₁ a₂ = f a₂ a₁ }) (a b : α) : Sym2.lift f s(a, b) = ↑f a b
• Sym2.coe_lift₂_symm_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} (F : Sym2 α → Sym2 β → γ) (a₁ a₂ : α) (b₁ b₂ : β) : ↑(Sym2.lift₂.symm F) a₁ a₂ b₁ b₂ = F s(a₁, a₂) s(b₁, b₂)
• Sym2.lift₂_mk 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : { f // ∀ (a₁ a₂ : α) (b₁ b₂ : β), f a₁ a₂ b₁ b₂ = f a₂ a₁ b₁ b₂ ∧ f a₁ a₂ b₁ b₂ = f a₁ a₂ b₂ b₁ }) (a₁ a₂ : α) (b₁ b₂ : β) : Sym2.lift₂ f s(a₁, a₂) s(b₁, b₂) = ↑f a₁ a₂ b₁ b₂
• Equiv.sigmaFiberFromRel_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} (sym : Std.Symm r) {f : α → β} (hf : r ≤ ⇑(Setoid.ker f)) (z : ↑(Sym2.fromRel sym)) : (Equiv.sigmaFiberFromRel sym hf) z = Sym2.fromRelNdrec ↑z ⋯ (fun a₁ a₂ h => ⟨f a₁, ⟨s(⟨a₁, ⋯⟩, ⟨a₂, ⋯⟩), h⟩⟩) ⋯
• Equiv.sigmaQuotFromRel_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} (sym : Std.Symm r) {r' : β → β → Prop} (f : r →r r') (z : ↑(Sym2.fromRel sym)) : (Equiv.sigmaQuotFromRel sym f) z = Sym2.fromRelNdrec ↑z ⋯ (fun a₁ a₂ h => ⟨Quot.mk r' (f a₁), ⟨s(⟨a₁, ⋯⟩, ⟨a₂, ⋯⟩), h⟩⟩) ⋯
• Equiv.sigmaQuotientFromRel_apply 📋 Mathlib.Data.Sym.Sym2
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} (sym : Std.Symm r) {r' : Setoid β} (f : r →r ⇑r') (z : ↑(Sym2.fromRel sym)) : (Equiv.sigmaQuotientFromRel sym f) z = Sym2.fromRelNdrec ↑z ⋯ (fun a₁ a₂ h => ⟨⟦f a₁⟧, ⟨s(⟨a₁, ⋯⟩, ⟨a₂, ⋯⟩), h⟩⟩) ⋯
• List.map_mk_sublist_sym2 📋 Mathlib.Data.List.Sym
  {α : Type u_1} (x : α) (xs : List α) (h : x ∈ xs) : (List.map (fun y => s(x, y)) xs).Sublist xs.sym2
• List.left_mem_of_mk_mem_sym2 📋 Mathlib.Data.List.Sym
  {α : Type u_1} {xs : List α} {a b : α} (h : s(a, b) ∈ xs.sym2) : a ∈ xs
• List.map_mk_disjoint_sym2 📋 Mathlib.Data.List.Sym
  {α : Type u_1} (x : α) (xs : List α) (h : x ∉ xs) : (List.map (fun y => s(x, y)) xs).Disjoint xs.sym2
• List.right_mem_of_mk_mem_sym2 📋 Mathlib.Data.List.Sym
  {α : Type u_1} {xs : List α} {a b : α} (h : s(a, b) ∈ xs.sym2) : b ∈ xs
• List.mk_mem_sym2 📋 Mathlib.Data.List.Sym
  {α : Type u_1} {xs : List α} {a b : α} (ha : a ∈ xs) (hb : b ∈ xs) : s(a, b) ∈ xs.sym2
• List.mk_mem_sym2_iff 📋 Mathlib.Data.List.Sym
  {α : Type u_1} {xs : List α} {a b : α} : s(a, b) ∈ xs.sym2 ↔ a ∈ xs ∧ b ∈ xs
• List.mem_sym2_cons_iff 📋 Mathlib.Data.List.Sym
  {α : Type u_1} {x : α} {xs : List α} {z : Sym2 α} : z ∈ (x :: xs).sym2 ↔ z = s(x, x) ∨ (∃ y ∈ xs, z = s(x, y)) ∨ z ∈ xs.sym2
• Multiset.mk_mem_sym2_iff 📋 Mathlib.Data.Multiset.Sym
  {α : Type u_1} {m : Multiset α} {a b : α} : s(a, b) ∈ m.sym2 ↔ a ∈ m ∧ b ∈ m
• Multiset.sym2_cons 📋 Mathlib.Data.Multiset.Sym
  {α : Type u_1} (a : α) (m : Multiset α) : (a ::ₘ m).sym2 = Multiset.map (fun b => s(a, b)) (a ::ₘ m) + m.sym2
• Finset.isDiag_mk_of_mem_diag 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} {s : Finset α} {a b : α} (h : (a, b) ∈ s.diag) : s(a, b).IsDiag
• Finset.not_isDiag_mk_of_mem_offDiag 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} {s : Finset α} {a b : α} (h : (a, b) ∈ s.offDiag) : ¬s(a, b).IsDiag
• Finset.sym2_eq_image 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} {s : Finset α} [DecidableEq α] : s.sym2 = Finset.image (Function.uncurry Sym2.mk) (s ×ˢ s)
• Finset.mk_mem_sym2_iff 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} {s : Finset α} {a b : α} : s(a, b) ∈ s.sym2 ↔ a ∈ s ∧ b ∈ s
• Finset.sym2_insert 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} [DecidableEq α] (a : α) (s : Finset α) : (insert a s).sym2 = Finset.image (fun b => s(a, b)) (insert a s) ∪ s.sym2
• Finset.image_diag_union_image_offDiag 📋 Mathlib.Data.Finset.Sym
  {α : Type u_1} {s : Finset α} [DecidableEq α] : Finset.image (Function.uncurry Sym2.mk) s.diag ∪ Finset.image (Function.uncurry Sym2.mk) s.offDiag = s.sym2
• Sym2.inf_mk 📋 Mathlib.Data.Sym.Sym2.Order
  {α : Type u_1} [SemilatticeInf α] (a b : α) : s(a, b).inf = a ⊓ b
• Sym2.sup_mk 📋 Mathlib.Data.Sym.Sym2.Order
  {α : Type u_1} [SemilatticeSup α] (a b : α) : s(a, b).sup = a ⊔ b
• Sym2.sortEquiv_symm_apply 📋 Mathlib.Data.Sym.Sym2.Order
  {α : Type u_1} [LinearOrder α] (p : { p // p.1 ≤ p.2 }) : Sym2.sortEquiv.symm p = s((↑p).1, (↑p).2)
• Finset.sum_sym2_filter_not_isDiag 📋 Mathlib.Algebra.BigOperators.Sym
  {ι : Type u_1} {M : Type u_2} [LinearOrder ι] [AddCommMonoid M] (s : Finset ι) (p : Sym2 ι → M) : ∑ i ∈ s.sym2 with ¬i.IsDiag, p i = ∑ i ∈ s.offDiag with i.1 < i.2, p s(i.1, i.2)
• QuadraticMap.polarSym2_sym2Mk 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
  {M : Type u_4} {N : Type u_5} [AddCommGroup M] [AddCommGroup N] (f : M → N) (x y : M) : QuadraticMap.polarSym2 f s(x, y) = QuadraticMap.polar f x y
• Sym2.GameAdd.fst 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a₁ a₂ b : α} (h : rα a₁ a₂) : Sym2.GameAdd rα s(a₁, b) s(a₂, b)
• Sym2.GameAdd.fst_snd 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a₁ a₂ b : α} (h : rα a₁ a₂) : Sym2.GameAdd rα s(a₁, b) s(b, a₂)
• Sym2.GameAdd.snd 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a b₁ b₂ : α} (h : rα b₁ b₂) : Sym2.GameAdd rα s(a, b₁) s(a, b₂)
• Sym2.GameAdd.snd_fst 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a₁ a₂ b : α} (h : rα a₁ a₂) : Sym2.GameAdd rα s(b, a₁) s(a₂, b)
• Acc.sym2_gameAdd 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a b : α} (ha : Acc rα a) (hb : Acc rα b) : Acc (Sym2.GameAdd rα) s(a, b)
• Prod.GameAdd.to_sym2 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a₁ a₂ b₁ b₂ : α} (h : Prod.GameAdd rα rα (a₁, b₁) (a₂, b₂)) : Sym2.GameAdd rα s(a₁, b₁) s(a₂, b₂)
• Sym2.GameAdd.fix 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {C : α → α → Sort u_3} (hr : WellFounded rα) (IH : (a₁ b₁ : α) → ((a₂ b₂ : α) → Sym2.GameAdd rα s(a₂, b₂) s(a₁, b₁) → C a₂ b₂) → C a₁ b₁) (a b : α) : C a b
• Sym2.GameAdd.induction 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα C : α → α → Prop} : WellFounded rα → (∀ (a₁ b₁ : α), (∀ (a₂ b₂ : α), Sym2.GameAdd rα s(a₂, b₂) s(a₁, b₁) → C a₂ b₂) → C a₁ b₁) → ∀ (a b : α), C a b
• Sym2.GameAdd.recursion 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {C : α → α → Sort u_3} (hr : WellFounded rα) (IH : (a₁ b₁ : α) → ((a₂ b₂ : α) → Sym2.GameAdd rα s(a₂, b₂) s(a₁, b₁) → C a₂ b₂) → C a₁ b₁) (a b : α) : C a b
• Sym2.gameAdd_mk'_iff 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {a₁ a₂ b₁ b₂ : α} : Sym2.GameAdd rα s(a₁, b₁) s(a₂, b₂) ↔ Prod.GameAdd rα rα (a₁, b₁) (a₂, b₂) ∨ Prod.GameAdd rα rα (b₁, a₁) (a₂, b₂)
• Sym2.gameAdd_iff 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {x y : α × α} : Sym2.GameAdd rα s(x.1, x.2) s(y.1, y.2) ↔ Prod.GameAdd rα rα x y ∨ Prod.GameAdd rα rα x.swap y
• Sym2.GameAdd.fix_eq 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {C : α → α → Sort u_3} (hr : WellFounded rα) (IH : (a₁ b₁ : α) → ((a₂ b₂ : α) → Sym2.GameAdd rα s(a₂, b₂) s(a₁, b₁) → C a₂ b₂) → C a₁ b₁) (a b : α) : Sym2.GameAdd.recursion hr IH a b = IH a b fun a' b' x => Sym2.GameAdd.recursion hr IH a' b'
• Sym2.GameAdd.recursion_eq 📋 Mathlib.Order.GameAdd
  {α : Type u_1} {rα : α → α → Prop} {C : α → α → Sort u_3} (hr : WellFounded rα) (IH : (a₁ b₁ : α) → ((a₂ b₂ : α) → Sym2.GameAdd rα s(a₂, b₂) s(a₁, b₁) → C a₂ b₂) → C a₁ b₁) (a b : α) : Sym2.GameAdd.recursion hr IH a b = IH a b fun a' b' x => Sym2.GameAdd.recursion hr IH a' b'
• Sym2.card_image_diag 📋 Mathlib.Data.Sym.Card
  {α : Type u_1} [DecidableEq α] (s : Finset α) : (Finset.image (Function.uncurry Sym2.mk) s.diag).card = s.card
• Sym2.card_image_offDiag 📋 Mathlib.Data.Sym.Card
  {α : Type u_1} [DecidableEq α] (s : Finset α) : (Finset.image (Function.uncurry Sym2.mk) s.offDiag).card = s.card.choose 2
• Sym2.two_mul_card_image_offDiag 📋 Mathlib.Data.Sym.Card
  {α : Type u_1} [DecidableEq α] (s : Finset α) : 2 * (Finset.image (Function.uncurry Sym2.mk) s.offDiag).card = s.offDiag.card
• SimpleGraph.mem_edgeSet 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {v w : V} : s(v, w) ∈ G.edgeSet ↔ G.Adj v w
• SimpleGraph.mem_incidenceSet 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) (v w : V) : s(v, w) ∈ G.incidenceSet v ↔ G.Adj v w
• SimpleGraph.mk'_mem_incidenceSet_left_iff 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {a b : V} : s(a, b) ∈ G.incidenceSet a ↔ G.Adj a b
• SimpleGraph.mk'_mem_incidenceSet_right_iff 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {a b : V} : s(a, b) ∈ G.incidenceSet b ↔ G.Adj a b
• SimpleGraph.adj_congr_of_sym2 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {u v w x : V} (h : s(u, v) = s(w, x)) : G.Adj u v ↔ G.Adj w x
• SimpleGraph.fromEdgeSet_adj 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} {v w : V} (s : Set (Sym2 V)) : (SimpleGraph.fromEdgeSet s).Adj v w ↔ s(v, w) ∈ s ∧ v ≠ w
• SimpleGraph.mem_incidence_iff_neighbor 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {v w : V} : s(v, w) ∈ G.incidenceSet v ↔ w ∈ G.neighborSet v
• SimpleGraph.mk'_mem_incidenceSet_iff 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {a b c : V} : s(b, c) ∈ G.incidenceSet a ↔ G.Adj b c ∧ (a = b ∨ a = c)
• SimpleGraph.incidenceSet_inter_incidenceSet_of_adj 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {a b : V} (h : G.Adj a b) : G.incidenceSet a ∩ G.incidenceSet b = {s(a, b)}
• SimpleGraph.incidenceSet_inter_incidenceSet_subset 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) {a b : V} (h : a ≠ b) : G.incidenceSet a ∩ G.incidenceSet b ⊆ {s(a, b)}
• SimpleGraph.adj_iff_exists_edge_coe 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} {G : SimpleGraph V} {a b : V} : G.Adj a b ↔ ∃ e, ↑e = s(a, b)
• SimpleGraph.incidence_other_neighbor_edge 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) [DecidableEq V] {v w : V} (h : w ∈ G.neighborSet v) : G.otherVertexOfIncident ⋯ = w
• SimpleGraph.incidenceSetEquivNeighborSet_symm_apply_coe 📋 Mathlib.Combinatorics.SimpleGraph.Basic
  {V : Type u} (G : SimpleGraph V) [DecidableEq V] (v : V) (w : ↑(G.neighborSet v)) : ↑((G.incidenceSetEquivNeighborSet v).symm w) = s(v, ↑w)
• SimpleGraph.Dart.edge_mk 📋 Mathlib.Combinatorics.SimpleGraph.Dart
  {V : Type u_1} {G : SimpleGraph V} {p : V × V} (h : G.Adj p.1 p.2) : { toProd := p, adj := h }.edge = s(p.1, p.2)
• SimpleGraph.dart_edge_eq_mk'_iff 📋 Mathlib.Combinatorics.SimpleGraph.Dart
  {V : Type u_1} {G : SimpleGraph V} {d : G.Dart} {u v : V} : d.edge = s(u, v) ↔ d.toProd = (u, v) ∨ d.toProd = (v, u)
• SimpleGraph.dart_edge_eq_mk'_iff' 📋 Mathlib.Combinatorics.SimpleGraph.Dart
  {V : Type u_1} {G : SimpleGraph V} {d : G.Dart} {u v : V} : d.edge = s(u, v) ↔ d.toProd.1 = u ∧ d.toProd.2 = v ∨ d.toProd.1 = v ∧ d.toProd.2 = u
• SimpleGraph.deleteEdges_adj 📋 Mathlib.Combinatorics.SimpleGraph.DeleteEdges
  {V : Type u_1} {v w : V} {G : SimpleGraph V} {s : Set (Sym2 V)} : (G.deleteEdges s).Adj v w ↔ G.Adj v w ∧ s(v, w) ∉ s
• SimpleGraph.Subgraph.mem_edgeSet 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {v w : V} : s(v, w) ∈ G'.edgeSet ↔ G'.Adj v w
• SimpleGraph.Subgraph.adj_congr_of_sym2 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v w x : V} (h2 : s(u, v) = s(w, x)) : H.Adj u v ↔ H.Adj w x
• SimpleGraph.edgeSet_subgraphOfAdj 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} {G : SimpleGraph V} {v w : V} (hvw : G.Adj v w) : (G.subgraphOfAdj hvw).edgeSet = {s(v, w)}
• SimpleGraph.subgraphOfAdj_adj 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} (G : SimpleGraph V) {v w : V} (hvw : G.Adj v w) (a b : V) : (G.subgraphOfAdj hvw).Adj a b = (s(v, w) = s(a, b))
• SimpleGraph.Subgraph.spanningCoe_subgraphOfAdj 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} {G : SimpleGraph V} {v w : V} (hadj : G.Adj v w) : (G.subgraphOfAdj hadj).spanningCoe = SimpleGraph.fromEdgeSet {s(v, w)}
• SimpleGraph.Subgraph.deleteEdges_adj 📋 Mathlib.Combinatorics.SimpleGraph.Subgraph
  {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s : Set (Sym2 V)) (v w : V) : (G'.deleteEdges s).Adj v w ↔ G'.Adj v w ∧ s(v, w) ∉ s
• SimpleGraph.edgeSet_edge_subset 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} {v w : V} : (SimpleGraph.edge v w).edgeSet ⊆ {s(v, w)}
• SimpleGraph.adj_edge 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (s t : V) {v w : V} : (SimpleGraph.edge s t).Adj v w ↔ s(s, t) = s(v, w) ∧ v ≠ w
• SimpleGraph.edgeSet_edge_of_ne 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} {s t : V} (h : s ≠ t) : (SimpleGraph.edge s t).edgeSet = {s(s, t)}
• SimpleGraph.edge_edgeSet_of_ne 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} {s t : V} (h : s ≠ t) : (SimpleGraph.edge s t).edgeSet = {s(s, t)}
• SimpleGraph.edgeSet_edge 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (v w : V) : (SimpleGraph.edge v w).edgeSet = {s(v, w)} \ Sym2.diagSet
• SimpleGraph.deleteEdges_edge 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} {u v : V} {s : Set (Sym2 V)} (h : s(u, v) ∈ s) : (SimpleGraph.edge u v).deleteEdges s = ⊥
• SimpleGraph.edge_le 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) (s t : V) : SimpleGraph.edge s t ≤ G ↔ {s(s, t)} \ Sym2.diagSet ⊆ G.edgeSet
• SimpleGraph.edgeSet_replaceVertex_of_not_adj 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] (hn : ¬G.Adj s t) : (G.replaceVertex s t).edgeSet = G.edgeSet \ G.incidenceSet t ∪ (fun x => s(x, t)) '' G.neighborSet s
• SimpleGraph.edgeSet_replaceVertex_of_adj 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] (ha : G.Adj s t) : (G.replaceVertex s t).edgeSet = (G.edgeSet \ G.incidenceSet t ∪ (fun x => s(x, t)) '' G.neighborSet s) \ {s(t, t)}
• SimpleGraph.edgeFinset_sup_edge 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [Fintype V] [DecidableRel G.Adj] [Fintype ↑(G ⊔ SimpleGraph.edge s t).edgeSet] (hn : ¬G.Adj s t) (h : s ≠ t) : (G ⊔ SimpleGraph.edge s t).edgeFinset = Finset.cons s(s, t) G.edgeFinset ⋯
• SimpleGraph.disjoint_sdiff_neighborFinset_image 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] : Disjoint (G.edgeFinset \ G.incidenceFinset t) (Finset.image (fun x => s(x, t)) (G.neighborFinset s))
• SimpleGraph.edgeFinset_replaceVertex_of_not_adj 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (hn : ¬G.Adj s t) : (G.replaceVertex s t).edgeFinset = G.edgeFinset \ G.incidenceFinset t ∪ Finset.image (fun x => s(x, t)) (G.neighborFinset s)
• SimpleGraph.edgeFinset_replaceVertex_of_adj 📋 Mathlib.Combinatorics.SimpleGraph.Operations
  {V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (ha : G.Adj s t) : (G.replaceVertex s t).edgeFinset = (G.edgeFinset \ G.incidenceFinset t ∪ Finset.image (fun x => s(x, t)) (G.neighborFinset s)) \ {s(t, t)}
• SimpleGraph.Adj.edges_toWalk 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Basic
  {V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : h.toWalk.edges = [s(u, v)]
• SimpleGraph.Walk.adj_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Basic
  {V : Type u} {G : SimpleGraph V} {u v x y : V} (p : G.Walk u v) (h : s(x, y) ∈ p.edges) : G.Adj x y
• SimpleGraph.Walk.edges_eq_zipWith_support 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Basic
  {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} : p.edges = List.zipWith (fun x1 x2 => s(x1, x2)) p.support p.support.tail
• SimpleGraph.Walk.edges_cons 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Basic
  {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p : G.Walk v w) : (SimpleGraph.Walk.cons h p).edges = s(u, v) :: p.edges
• SimpleGraph.Walk.edgeSet_cons 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Basic
  {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p : G.Walk v w) : (SimpleGraph.Walk.cons h p).edgeSet = insert s(u, v) p.edgeSet
• SimpleGraph.Walk.edge_firstDart 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} (p : G.Walk v w) (hp : ¬p.Nil) : (p.firstDart hp).edge = s(v, p.snd)
• SimpleGraph.Walk.edge_lastDart 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} (p : G.Walk v w) (hp : ¬p.Nil) : (p.lastDart hp).edge = s(p.penultimate, w)
• SimpleGraph.Walk.mk_penultimate_end_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hnil : ¬p.Nil) : s(p.penultimate, w) ∈ p.edges
• SimpleGraph.Walk.mk_start_snd_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hnil : ¬p.Nil) : s(v, p.snd) ∈ p.edges
• SimpleGraph.Walk.getLast_edges_eq_mk_penultimate_end 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hp : p.edges ≠ []) : p.edges.getLast hp = s(p.penultimate, w)
• SimpleGraph.Walk.head_edges_eq_mk_start_snd 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hp : p.edges ≠ []) : p.edges.head hp = s(v, p.snd)
• SimpleGraph.Walk.mk_mem_edges_iff_exists 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {u v u' v' : V} (p : G.Walk u v) : s(u', v') ∈ p.edges ↔ ∃ i < p.length, s(p.getVert i, p.getVert (i + 1)) = s(u', v')
• SimpleGraph.Walk.getElem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} {i : ℕ} (h : i < p.edges.length) : p.edges[i] = s(p.getVert i, p.getVert (i + 1))
• SimpleGraph.Walk.mk_penultimate_end_eq_getLast_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hnil : ¬p.Nil) : s(p.penultimate, w) = p.edges.getLast ⋯
• SimpleGraph.Walk.mk_start_snd_eq_head_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Traversal
  {V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v w} (hnil : ¬p.Nil) : s(v, p.snd) = p.edges.head ⋯
• SimpleGraph.Walk.fst_mem_support_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Operations
  {V : Type u} {G : SimpleGraph V} {t u v w : V} (p : G.Walk v w) (he : s(t, u) ∈ p.edges) : t ∈ p.support
• SimpleGraph.Walk.snd_mem_support_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Operations
  {V : Type u} {G : SimpleGraph V} {t u v w : V} (p : G.Walk v w) (he : s(t, u) ∈ p.edges) : u ∈ p.support
• SimpleGraph.Walk.edges_concat 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Operations
  {V : Type u} {G : SimpleGraph V} {u v w : V} (p : G.Walk u v) (h : G.Adj v w) : (p.concat h).edges = p.edges.concat s(v, w)
• SimpleGraph.Walk.edgeSet_concat 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Operations
  {V : Type u} {G : SimpleGraph V} {u v w : V} (p : G.Walk u v) (h : G.Adj v w) : (p.concat h).edgeSet = insert s(v, w) p.edgeSet
• SimpleGraph.Walk.toDeleteEdges_cons 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Maps
  {V : Type u} {G : SimpleGraph V} (s : Set (Sym2 V)) {u v w : V} (h : G.Adj u v) (p : G.Walk v w) (hp : ∀ e ∈ (SimpleGraph.Walk.cons h p).edges, e ∉ s) : SimpleGraph.Walk.toDeleteEdges s (SimpleGraph.Walk.cons h p) hp = SimpleGraph.Walk.cons ⋯ (SimpleGraph.Walk.toDeleteEdges s p ⋯)
• SimpleGraph.Walk.infix_support_iff_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Subwalks
  {V : Type u_1} {G : SimpleGraph V} {u v u' v' : V} {p : G.Walk u v} : [u', v'] <:+: p.support ∨ [v', u'] <:+: p.support ↔ s(u', v') ∈ p.edges
• SimpleGraph.Walk.isSubwalk_toWalk_iff_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Subwalks
  {V : Type u_1} {G : SimpleGraph V} {u v u' v' : V} {p : G.Walk u v} (h : G.Adj u' v') : h.toWalk.IsSubwalk p ∨ ⋯.toWalk.IsSubwalk p ↔ s(u', v') ∈ p.edges
• SimpleGraph.Walk.count_edges_takeUntil_le_one 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Decomp
  {V : Type u} {G : SimpleGraph V} [DecidableEq V] {u v w : V} (p : G.Walk v w) (h : u ∈ p.support) (x : V) : List.count s(u, x) (p.takeUntil u h).edges ≤ 1
• SimpleGraph.Walk.IsPath.eq_penultimate_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v w : V} {p : G.Walk u v} (hp : p.IsPath) (hmem : s(v, w) ∈ p.edges) : w = p.penultimate
• SimpleGraph.Walk.IsPath.eq_snd_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v w : V} {p : G.Walk u v} (hp : p.IsPath) (hmem : s(u, w) ∈ p.edges) : w = p.snd
• SimpleGraph.Walk.IsPath.length_eq_one_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} (hp : p.IsPath) (h : s(u, v) ∈ p.edges) : p.length = 1
• SimpleGraph.Path.mk'_mem_edges_singleton 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : s(u, v) ∈ (↑(SimpleGraph.Path.singleton h)).edges
• SimpleGraph.Walk.cons_isCycle_iff 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk v u) (h : G.Adj u v) : (SimpleGraph.Walk.cons h p).IsCycle ↔ p.IsPath ∧ s(u, v) ∉ p.edges
• SimpleGraph.Walk.IsTrail.concat 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v w : V} {p : G.Walk u v} (hp : p.IsTrail) (hadj : G.Adj v w) (hmem : s(v, w) ∉ p.edges) : (p.concat hadj).IsTrail
• SimpleGraph.Walk.IsTrail.cons 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u u' v : V} {w : G.Walk u' v} (hw : w.IsTrail) (hu : G.Adj u u') (hu' : s(u, u') ∉ w.edges) : (SimpleGraph.Walk.cons hu w).IsTrail
• SimpleGraph.Walk.IsPath.eq_adj_toWalk_of_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} (hp : p.IsPath) (h : s(u, v) ∈ p.edges) : p = ⋯.toWalk
• SimpleGraph.Walk.isTrail_concat 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v w : V} {p : G.Walk u v} (hadj : G.Adj v w) : (p.concat hadj).IsTrail ↔ p.IsTrail ∧ s(v, w) ∉ p.edges
• SimpleGraph.Walk.isTrail_cons 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p : G.Walk v w) : (SimpleGraph.Walk.cons h p).IsTrail ↔ p.IsTrail ∧ s(u, v) ∉ p.edges
• SimpleGraph.Path.cons_isCycle 📋 Mathlib.Combinatorics.SimpleGraph.Paths
  {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Path v u) (h : G.Adj u v) (he : s(u, v) ∉ (↑p).edges) : (SimpleGraph.Walk.cons h ↑p).IsCycle
• Graph.banana_adj 📋 Mathlib.Combinatorics.Graph.Basic
  {α : Type u_1} {β : Type u_2} {x y u v : α} {edgeSet : Set β} : (Graph.banana u v edgeSet).Adj x y ↔ edgeSet.Nonempty ∧ s(x, y) = s(u, v)
• Graph.IsLink.isLink_iff_sym2_eq 📋 Mathlib.Combinatorics.Graph.Basic
  {α : Type u_1} {β : Type u_2} {x y : α} {e : β} {G : Graph α β} (h : G.IsLink e x y) {x' y' : α} : G.IsLink e x' y' ↔ s(x, y) = s(x', y')
• Graph.ofSimpleGraph_isLink 📋 Mathlib.Combinatorics.Graph.Simple
  {α : Type u_1} (G : SimpleGraph α) (e : Sym2 α) (x y : α) : (Graph.ofSimpleGraph G).IsLink e x y = (e = s(x, y) ∧ e ∈ G.edgeSet)
• SimpleGraph.IsBridge.of_not_reachable 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} (huv : ¬G.Reachable u v) : G.IsBridge s(u, v)
• SimpleGraph.IsBridge.reachable_iff_adj 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} (h : G.IsBridge s(u, v)) : G.Reachable u v ↔ G.Adj u v
• SimpleGraph.IsBridge.sup_edge_of_not_reachable 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} (h : ¬G.Reachable u v) : (G ⊔ SimpleGraph.edge u v).IsBridge s(u, v)
• SimpleGraph.IsBridge.sup_fromEdgeSet_of_not_reachable 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} (h : ¬G.Reachable u v) : (G ⊔ SimpleGraph.edge u v).IsBridge s(u, v)
• SimpleGraph.isBridge_sup_edge 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} : (G ⊔ SimpleGraph.edge u v).IsBridge s(u, v) ↔ G.IsBridge s(u, v)
• SimpleGraph.isBridge_iff 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v : V} : G.IsBridge s(u, v) ↔ ¬(G.deleteEdges {s(u, v)}).Reachable u v
• SimpleGraph.Connected.connected_delete_edge_of_not_isBridge 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} (hG : G.Connected) {x y : V} (h : ¬G.IsBridge s(x, y)) : (G.deleteEdges {s(x, y)}).Connected
• SimpleGraph.isBridge_iff_adj_and_forall_walk_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {v w : V} : G.IsBridge s(v, w) ↔ ∀ (p : G.Walk v w), s(v, w) ∈ p.edges
• SimpleGraph.isBridge_iff_forall_walk_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {v w : V} : G.IsBridge s(v, w) ↔ ∀ (p : G.Walk v w), s(v, w) ∈ p.edges
• SimpleGraph.reachable_deleteEdges_iff_exists_walk 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {v w v' w' : V} : (G.deleteEdges {s(v, w)}).Reachable v' w' ↔ ∃ p, s(v, w) ∉ p.edges
• SimpleGraph.reachable_delete_edges_iff_exists_walk 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {v w v' w' : V} : (G.deleteEdges {s(v, w)}).Reachable v' w' ↔ ∃ p, s(v, w) ∉ p.edges
• SimpleGraph.adj_and_reachable_delete_edges_iff_exists_cycle 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {v w : V} : G.Adj v w ∧ (G.deleteEdges {s(v, w)}).Reachable v w ↔ ∃ u p, p.IsCycle ∧ s(v, w) ∈ p.edges
• SimpleGraph.Walk.IsTrail.not_mem_support_of_not_reachable 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v x y : V} {w : G.Walk u v} (hw : w.IsTrail) (huy : ¬(G.deleteEdges {s(x, y)}).Reachable u y) (hvy : ¬(G.deleteEdges {s(x, y)}).Reachable v y) : y ∉ w.support
• SimpleGraph.Walk.IsTrail.not_mem_edges_of_not_reachable 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} {u v x y : V} {w : G.Walk u v} (hw : w.IsTrail) (huy : ¬(G.deleteEdges {s(x, y)}).Reachable u y) (hvy : ¬(G.deleteEdges {s(x, y)}).Reachable v y) : s(x, y) ∉ w.edges
• SimpleGraph.reachable_deleteEdges_iff_exists_cycle.aux 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
  {V : Type u} {G : SimpleGraph V} [DecidableEq V] {u v w : V} (hb : ∀ (p : G.Walk v w), s(v, w) ∈ p.edges) (c : G.Walk u u) (hc : c.IsTrail) (he : s(v, w) ∈ c.edges) (hw : w ∈ (c.takeUntil v ⋯).support) : False
• SimpleGraph.edgeSet_completeBipartiteGraph 📋 Mathlib.Combinatorics.SimpleGraph.Bipartite
  {W₁ : Type u_2} {W₂ : Type u_3} : (completeBipartiteGraph W₁ W₂).edgeSet = Set.range fun x => s(Sum.inl x.1, Sum.inr x.2)
• SimpleGraph.Walk.IsChordless.mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Chord
  {V : Type u_1} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} (h : p.IsChordless) {u' v' : V} (hu' : u' ∈ p.support) (hv' : v' ∈ p.support) (hadj : G.Adj u' v') : s(u', v') ∈ p.edges
• SimpleGraph.Walk.isChordless_iff_forall_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Chord
  {V : Type u_1} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} : p.IsChordless ↔ ∀ ⦃u' v' : V⦄, u' ∈ p.support → v' ∈ p.support → G.Adj u' v' → s(u', v') ∈ p.edges
• SimpleGraph.Walk.isChord_sym2Mk 📋 Mathlib.Combinatorics.SimpleGraph.Walk.Chord
  {V : Type u_1} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} {u' v' : V} : p.IsChord s(u', v') ↔ G.Adj u' v' ∧ s(u', v') ∉ p.edges ∧ u' ∈ p.support ∧ v' ∈ p.support
• SimpleGraph.Walk.adj_toSubgraph_iff_mem_edges 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
  {V : Type u} {G : SimpleGraph V} {u v u' v' : V} {p : G.Walk u v} : p.toSubgraph.Adj u' v' ↔ s(u', v') ∈ p.edges
• SimpleGraph.Walk.toSubgraph_adj_iff 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
  {V : Type u} {G : SimpleGraph V} {u v u' v' : V} (w : G.Walk u v) : w.toSubgraph.Adj u' v' ↔ ∃ i, s(w.getVert i, w.getVert (i + 1)) = s(u', v') ∧ i < w.length
• SimpleGraph.IsBridge.not_isEdgeReachable_two 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
  {V : Type u_1} {G : SimpleGraph V} {u v : V} (huv : G.IsBridge s(u, v)) : ¬G.IsEdgeReachable 2 u v
• SimpleGraph.isBridge_iff_adj_and_not_isEdgeConnected_two 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
  {V : Type u_1} {G : SimpleGraph V} {u v : V} (huv : G.Adj u v) : G.IsBridge s(u, v) ↔ ¬G.IsEdgeReachable 2 u v
• SimpleGraph.isBridge_iff_not_isEdgeReachable_two 📋 Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
  {V : Type u_1} {G : SimpleGraph V} {u v : V} (huv : G.Adj u v) : G.IsBridge s(u, v) ↔ ¬G.IsEdgeReachable 2 u v
• SimpleGraph.isAcyclic_iff_forall_adj_isBridge 📋 Mathlib.Combinatorics.SimpleGraph.Acyclic
  {V : Type u_1} {G : SimpleGraph V} : G.IsAcyclic ↔ ∀ ⦃v w : V⦄, G.Adj v w → G.IsBridge s(v, w)
• SimpleGraph.EdgeLabeling.get_eq 📋 Mathlib.Combinatorics.SimpleGraph.Coloring.EdgeLabeling
  {V : Type u_1} {G : SimpleGraph V} {K : Type u_3} (C : G.EdgeLabeling K) (x y : V) (h : G.Adj x y) : C.get x y h = C ⟨s(x, y), h⟩
• SimpleGraph.EdgeLabeling.labelGraph_adj 📋 Mathlib.Combinatorics.SimpleGraph.Coloring.EdgeLabeling
  {V : Type u_1} {G : SimpleGraph V} {K : Type u_3} {C : G.EdgeLabeling K} {k : K} (x y : V) : (C.labelGraph k).Adj x y ↔ ∃ (H : G.Adj x y), C ⟨s(x, y), H⟩ = k
• SimpleGraph.IsCycles.reachable_deleteEdges 📋 Mathlib.Combinatorics.SimpleGraph.Matching
  {V : Type u_1} {G : SimpleGraph V} {v w : V} [Finite V] (hadj : G.Adj v w) (hcyc : G.IsCycles) : (G.deleteEdges {s(v, w)}).Reachable v w
• SimpleGraph.Walk.IsPath.isCycles_spanningCoe_toSubgraph_sup_edge 📋 Mathlib.Combinatorics.SimpleGraph.Matching
  {V : Type u_1} {G : SimpleGraph V} {u v : V} {p : G.Walk u v} (hp : p.IsPath) (h : u ≠ v) (hs : s(v, u) ∉ p.edges) : (p.toSubgraph.spanningCoe ⊔ SimpleGraph.edge v u).IsCycles
• SimpleGraph.Subgraph.IsMatching.toEdge_eq_of_adj 📋 Mathlib.Combinatorics.SimpleGraph.Matching
  {V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {v w : V} (h : M.IsMatching) (hvw : M.Adj v w) : h.toEdge ⟨v, ⋯⟩ = ⟨s(v, w), hvw⟩
• SimpleGraph.Subgraph.IsMatching.toEdge_preimage_singleton 📋 Mathlib.Combinatorics.SimpleGraph.Matching
  {V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v : V} (h : M.IsMatching) (huv : M.Adj u v) : h.toEdge ⁻¹' {⟨s(u, v), huv⟩} = {⟨u, ⋯⟩, ⟨v, ⋯⟩}
• Finsupp.sym2Mul_apply_mk 📋 Mathlib.Data.Sym.Sym2.Finsupp
  {α : Type u_1} {M₀ : Type u_2} [CommMonoidWithZero M₀] {f : α →₀ M₀} (a b : α) : f.sym2Mul s(a, b) = f a * f b

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. By subexpression:
   🔍 _ * (_ ^ _)
   finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.

   The pattern can also be non-linear, as in
   🔍 Real.sqrt ?a * Real.sqrt ?a

   If the pattern has parameters, they are matched in any order. Both of these will find List.map:
   🔍 (?a -> ?b) -> List ?a -> List ?b
   🔍 List ?a -> (?a -> ?b) -> List ?b

4. By main conclusion:
   🔍 |- tsum _ = _ * tsum _
   finds all lemmas where the conclusion (the subexpression to the right of all → and ∀) has the given shape.

   As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
   🔍 |- _ < _ → tsum _ < tsum _
   will find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

5. You can filter for definitions vs theorems: Using ⊢ (_ : Type _) finds all definitions which provide data while ⊢ (_ : Prop) finds all theorems (and definitions of proofs).

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.

This is Loogle revision 9f11169 serving mathlib revision ce5dd8c