Theorems · Inductive type · order theory
GeneralizedCoheytingAlgebra
Type u_4 → Type u_4
A generalized co-Heyting algebra is a lattice with an additional binary
difference operation \ such that (· \ a) is left adjoint to (· ⊔ a).
This generalizes CoheytingAlgebra by not requiring a top element.
- Defined in
- Mathlib.Order.Heyting.Basic
- Cited by
- 95 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · 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 by113
Results whose statement or proof uses this declaration.
- sdiff_selfstatement and proof · cited by 38
- sdiff_lestatement and proof · cited by 36
- symmDiff_commstatement and proof · cited by 23
- sdiff_le_iff'statement and proof · cited by 20
- Disjoint.sdiff_eq_leftstatement and proof · cited by 19
- sdiff_le_sdiffstatement and proof · cited by 16
- sdiff_botstatement and proof · cited by 13
- sdiff_idemstatement and proof · cited by 12
- sdiff_le_sdiff_rightstatement and proof · cited by 11
- sdiff_eq_bot_iffstatement and proof · cited by 10
- sup_sdiff_selfstatement and proof · cited by 9
- sdiff_le_iffstatement and proof · cited by 9