Theorems · Theorem · combinatorics

List.rel_mem

∀ {α : Type u_1} {β : Type u_2} {R : α → β → Prop},
  Relator.BiUnique R →
    Relator.LiftFun R (Relator.LiftFun (List.Forall₂ R) Iff) (fun x1 x2 => x1 ∈ x2) fun x1 x2 => x1 ∈ x2

Defined in: Mathlib.Data.List.Forall2
Cited by: 1 results in Mathlib
Foundations: Depth 13 from the axioms · uses propext

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Relator.LiftFunstatement · cited by 47
Relator.BiUniquestatement and proof · cited by 5
Relator.rel_orproof · cited by 1
Relator.rel_eqproof · cited by 1

Cited by1

Results whose statement or proof uses this declaration.

List.rel_nodupproof · cited by 0