Theorems · Theorem · order theory
Set.pi_subset_pi_iff
∀ {ι : Type u_1} {α : ι → Type u_2} {s : Set ι} {t₁ t₂ : (i : ι) → Set (α i)},
s.pi t₁ ⊆ s.pi t₂ ↔ (∀ i ∈ s, t₁ i ⊆ t₂ i) ∨ s.pi t₁ = ∅- Defined in
- Mathlib.Data.Set.Prod
- Cited by
- 4 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.
Cites9
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
- Set.pistatement and proof · cited by 405
- Set.image_monoproof · cited by 197
- Set.nonempty_iff_ne_emptyproof · cited by 96
- Set.Nonempty.monoproof · cited by 88
- Set.empty_subsetproof · cited by 70
- Set.pi_monoproof · cited by 8
- Set.eval_image_piproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- Subgroup.closure_piproof · cited by 0
- AddSubmonoid.closure_piproof · cited by 0
- AddSubgroup.closure_piproof · cited by 0
- Submonoid.closure_piproof · cited by 0