Theorems · Definition · order theory
Booleanisation
Type u_2 → Type u_2
Boolean algebra containing a given generalised Boolean algebra α as a sublattice.
This should be thought of as made of a copy of α (representing elements of α) living under
another copy of α (representing complements of elements of α).
- Defined in
- Mathlib.Order.Booleanisation
- Cited by
- 26 results in Mathlib
- Foundations
- Depth 1 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 by35
Results whose statement or proof uses this declaration.
- Booleanisation.liftstatement · cited by 21
- Booleanisation.compstatement · cited by 20
- Booleanisation.LE.casesOnstatement and proof · cited by 3
- Booleanisation.LT.casesOnstatement and proof · cited by 3
- Booleanisation.liftLatticeHomstatement · cited by 2
- Finset.le_card_diffs_mul_card_diffsproof · cited by 1
- Booleanisation.liftLatticeHom_injectivestatement · cited by 1
- Booleanisation.not_comp_lt_liftstatement · cited by 0
- Booleanisation.LE.recOnstatement and proof · cited by 0
- Booleanisation.LT.recOnstatement and proof · cited by 0
- Booleanisation.LEstatement · cited by 0
- Booleanisation.LTstatement · cited by 0