Theorems · Theorem · order theory
Set.iUnion_congr_Prop
∀ {α : Type u_1} {p q : Prop} {f₁ : p → Set α} {f₂ : q → Set α} (pq : p ↔ q),
(∀ (x : q), f₁ ⋯ = f₂ x) → Set.iUnion f₁ = Set.iUnion f₂- Defined in
- Mathlib.Data.Set.Lattice
- Cited by
- 374 results in Mathlib
- Foundations
- Depth 6 from the axioms, rests on 21 definitions · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.iUnionstatement · cited by 2,483
- iSup_congr_Propproof · cited by 247
Cited by374
Results whose statement or proof uses this declaration.
- TopologicalSpace.Opens.coe_iSupproof · cited by 24
- CategoryTheory.Subfunctor.iSup_objproof · cited by 23
- Set.iUnion_iUnion_eq'proof · cited by 21
- Set.iUnion_image_leftproof · cited by 15
- Set.biUnion_insertproof · cited by 13
- MeasureTheory.measure_biUnion_null_iffproof · cited by 11
- IsLindelof.elim_countable_subcoverproof · cited by 10
- SSet.horn_eq_iSupproof · cited by 9
- UpperSet.coe_iInfproof · cited by 6
- borel_eq_generateFrom_Iioproof · cited by 6
- AlgebraicGeometry.isCompact_iff_finite_and_eq_biUnion_affineOpensproof · cited by 6
- convexJoin_commproof · cited by 6
Showing the 200 most cited of 374.