Theorems · Definition · logic and foundations
Relator.LiftFun
{α : Sort u₁} →
{β : Sort u₂} → {γ : Sort v₁} → {δ : Sort v₂} → (α → β → Prop) → (γ → δ → Prop) → (α → γ) → (β → δ) → PropThe binary relations R : α → β → Prop and S : γ → δ → Prop induce a binary
relation on functions LiftFun : (α → γ) → (β → δ) → Prop.
- Defined in
- Mathlib.Logic.Relator
- Cited by
- 47 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by49
Results whose statement or proof uses this declaration.
- IsMaxFilter.bicomp_monostatement and proof · cited by 8
- IsMinFilter.bicomp_monostatement and proof · cited by 8
- Fin.liftFun_iff_succstatement and proof · cited by 6
- liftFun_vecConsstatement · cited by 4
- liftFun_antisymmRelstatement · cited by 3
- List.rel_appendstatement · cited by 2
- List.rel_foldrstatement and proof · cited by 2
- List.rel_mapstatement and proof · cited by 2
- AddSubgroup.prod_monostatement · cited by 2
- AddConstMapClass.rel_map_of_Iccstatement · cited by 2
- Subgroup.prod_monostatement · cited by 2
- Relator.rel_andstatement · cited by 1