Theorems · Theorem · logic and foundations
not_forall_not
∀ {α : Sort u_1} {p : α → Prop}, (¬∀ (x : α), ¬p x) ↔ ∃ x, p x- Defined in
- Mathlib.Logic.Basic
- Cited by
- 11 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.
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 by11
Results whose statement or proof uses this declaration.
- csSup_mem_of_not_isSuccLimitproof · cited by 3
- csInf_mem_of_not_isPredLimitproof · cited by 3
- Function.exists_update_iffproof · cited by 2
- sSup_mem_of_not_isSuccPrelimitproof · cited by 1
- forall_imp_iff_exists_impproof · cited by 1
- crossProduct_ne_zero_iff_linearIndependentproof · cited by 1
- SimpleGraph.exists_of_maximal_cliqueFree_not_adjproof · cited by 1
- sInf_mem_of_not_isPredPrelimitproof · cited by 1
- SimpleGraph.exists_maximal_isMatchingFreeproof · cited by 1
- Polynomial.resultant_eq_prod_roots_subproof · cited by 1
- Sum.exists_sumproof · cited by 0