Theorems · Theorem · logic and foundations
and_forall_ne
∀ {α : Sort u_1} {p : α → Prop} (a : α), (p a ∧ ∀ (b : α), b ≠ a → p b) ↔ ∀ (b : α), p b- Defined in
- Mathlib.Logic.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Decidable.and_forall_neproof · cited by 2
Cited by6
Results whose statement or proof uses this declaration.
- Function.forall_update_iffproof · cited by 12
- BoxIntegral.Box.coe_splitLowerproof · cited by 4
- BoxIntegral.Box.coe_splitUpperproof · cited by 4
- WithZeroTopology.isOpen_iffproof · cited by 1
- continuousOn_update_iffproof · cited by 1
- AlgebraicGeometry.ProjIsoSpecTopComponent.FromSpec.carrier.asIdeal.primeproof · cited by 0