Theorems · Theorem · order theory
Sigma.subtype_ext
∀ {α : Type u_1} {β : Type u_7} {p : α → β → Prop} {x₀ x₁ : (a : α) × Subtype (p a)},
x₀.fst = x₁.fst → ↑x₀.snd = ↑x₁.snd → x₀ = x₁A specialized ext lemma for equality of sigma types over an indexed subtype.
- Defined in
- Mathlib.Data.Sigma.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 6 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 by8
Results whose statement or proof uses this declaration.
- AddMonoidAlgebra.decomposeAux_singleproof · cited by 3
- CliffordAlgebra.GradedAlgebra.ι_sq_scalarproof · cited by 1
- Sym.sigma_sub_extproof · cited by 1
- Configuration.ProjectivePlane.card_pointsproof · cited by 1
- CliffordAlgebra.GradedAlgebra.lift_ι_eqproof · cited by 0
- Sigma.subtype_ext_iffproof · cited by 0
- ExteriorAlgebra.GradedAlgebra.liftι_eqproof · cited by 0
- TopologicalSpace.Fiber.sigmaIsoHom_injproof · cited by 0