Theorems · Definition · category theory
PFunctor.M.isubtree
{F : PFunctor.{uA, uB}} → [DecidableEq F.A] → [Inhabited F.M] → PFunctor.Approx.Path F → F.M → F.Mfollow a path through a value of M F and return the subtree
found at the end of the path if it is a valid path for that value and
return a default tree
- Defined in
- Mathlib.Data.PFunctor.Univariate.M
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqInhabited
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.
- PFunctor.Astatement and proof · cited by 101
- PFunctorstatement and proof · cited by 75
- PFunctor.Mstatement and proof · cited by 52
- PFunctor.Approx.Pathstatement and proof · cited by 11
Cited by7
Results whose statement or proof uses this declaration.
- PFunctor.M.iselectproof · cited by 7
- PFunctor.M.isubtree_consstatement and proof · cited by 2
- PFunctor.M.nth_of_bisimstatement and proof · cited by 1
- PFunctor.M.eq_of_bisimproof · cited by 1
- PFunctor.M.iselect_consproof · cited by 1
- PFunctor.M.iselect_eq_defaultproof · cited by 1
- PFunctor.M.isubtree.eq_defstatement and proof · cited by 0