Theorems · Theorem · order theory
sdiff_eq_bot_iff
∀ {α : Type u_2} [inst : GeneralizedCoheytingAlgebra α] {a b : α}, b \ a = ⊥ ↔ b ≤ a- Defined in
- Mathlib.Order.Heyting.Basic
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext
- Assumes
- GeneralizedCoheytingAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement · cited by 4,720
- le_bot_iffproof · cited by 116
- GeneralizedCoheytingAlgebrastatement and proof · cited by 95
- bot_sup_eqproof · cited by 32
- sdiff_le_iff'proof · cited by 20
Cited by10
Results whose statement or proof uses this declaration.
- Set.sdiff_eq_emptyproof · cited by 24
- Finset.sdiff_eq_empty_iff_subsetproof · cited by 5
- bot_sdiffproof · cited by 5
- sdiff_topproof · cited by 4
- symmDiff_of_leproof · cited by 4
- inf_sdiff_distrib_leftproof · cited by 3
- Finpartition.parts_subset_extendOfLEproof · cited by 3
- symmDiff_of_geproof · cited by 2
- Finpartition.parts_extendOfLE_of_ltproof · cited by 1
- Finpartition.mem_avoidproof · cited by 1