Theorems · Theorem · logic and foundations
ComputablePred.not
∀ {α : Type u_1} [inst : Primcodable α] {p : α → Prop}, ComputablePred p → ComputablePred fun a => ¬p a- Defined in
- Mathlib.Computability.RE
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Primcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Computableproof · cited by 80
- Primrec.to_compproof · cited by 40
- Computable.compproof · cited by 31
- ComputablePredstatement and proof · cited by 17
- Computable.of_eqproof · cited by 9
- Primrec.notproof · cited by 4
- Computable.computablePredproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- ComputablePred.computable_iff_re_compl_reproof · cited by 1