Mathlib Map

Theorems · Inductive type · category theory

PFunctor.M.IsBisimulation

{F : PFunctor.{uA, uB}} → (F.M → F.M → Prop) → Prop

Bisimulation is the standard proof technique for equality between infinite tree-like structures

Defined in
Mathlib.Data.PFunctor.Univariate.M
Cited by
4 results in Mathlib
Foundations
Depth 3 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

PFunctor.M.nth_of_bisim · cited by 1M.nth_of_bisimPFunctor.M.IsBisimulation.head · cited by 1IsBisimulation.headPFunctor.M.eq_of_bisim · cited by 1M.eq_of_bisimPFunctor.M.IsBisimulation.tail · cited by 1IsBisimulation.tailPFunctor.M.IsBisimulation.casesOn · cited by 0IsBisimulation.casesOnPFunctor.M.IsBisimulation.recOn · cited by 0IsBisimulation.recOnPFunctor · cited by 75PFunctorPFunctor.M · cited by 52PFunctor.MM.IsBisimulationCITED BYCITES

Cites2

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

Cited by6

Results whose statement or proof uses this declaration.