Theorems · Theorem · order theory
Set.prod_subset_prod_iff
∀ {α : Type u_1} {β : Type u_2} {s s₁ : Set α} {t t₁ : Set β}, s ×ˢ t ⊆ s₁ ×ˢ t₁ ↔ s ⊆ s₁ ∧ t ⊆ t₁ ∨ s = ∅ ∨ t = ∅A product set is included in a product set if and only factors are included, or a factor of the first set is empty.
- Defined in
- Mathlib.Data.Set.Prod
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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.imageproof · cited by 5,609
- Set.Nonemptyproof · cited by 2,627
- SProd.sprodstatement and proof · cited by 1,750
- Set.eq_empty_or_nonemptyproof · cited by 248
- Set.image_monoproof · cited by 197
- Set.Nonempty.monoproof · cited by 88
- Set.Nonempty.ne_emptyproof · cited by 65
- Set.prod_monoproof · cited by 52
- Set.prod_eq_empty_iffproof · cited by 8
- Set.fst_image_prodproof · cited by 8
- Set.snd_image_prodproof · cited by 7
Cited by15
Results whose statement or proof uses this declaration.
- Filter.prod_mem_prod_iffproof · cited by 2
- ProbabilityTheory.setLIntegral_toKernel_univproof · cited by 2
- AddSubmonoid.closure_zero_prodproof · cited by 1
- ProbabilityTheory.setLIntegral_toKernel_prodproof · cited by 1
- Submonoid.closure_one_prodproof · cited by 1
- Submonoid.closure_prod_oneproof · cited by 1
- AddSubmonoid.closure_prod_zeroproof · cited by 1
- Complex.reProdIm_subset_iff'proof · cited by 0
- UpperSet.prod_le_prod_iffproof · cited by 0
- AddSubgroup.closure_prodproof · cited by 0
- Subgroup.closure_prodproof · cited by 0
- Set.prod_subset_prod_iff'proof · cited by 0