Theorems · Theorem · order theory
Set.prod_eq_empty_iff
∀ {α : Type u_1} {β : Type u_2} {s : Set α} {t : Set β}, s ×ˢ t = ∅ ↔ s = ∅ ∨ t = ∅- Defined in
- Mathlib.Data.Set.Prod
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Set.Nonemptyproof · cited by 2,627
- SProd.sprodstatement and proof · cited by 1,750
- Set.not_nonempty_iff_eq_emptyproof · cited by 56
Cited by8
Results whose statement or proof uses this declaration.
- Set.prod_subset_prod_iffproof · cited by 15
- UpperSet.prod_eq_topproof · cited by 0
- Sublattice.prod_eq_botproof · cited by 0
- Set.prod_eq_prod_iffproof · cited by 0
- Set.prod_subset_prod_iff'proof · cited by 0
- measurableSet_prodproof · cited by 0
- LowerSet.prod_eq_botproof · cited by 0
- isOpen_prod_iff'proof · cited by 0