Theorems · Theorem · logic and foundations
ComputablePred.computable_iff_re_compl_re
∀ {α : Type u_1} [inst : Primcodable α] {p : α → Prop} [DecidablePred p],
ComputablePred p ↔ REPred p ∧ REPred fun a => ¬p a- Defined in
- Mathlib.Computability.RE
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PrimcodableDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- PFunproof · cited by 207
- Part.someproof · cited by 111
- Part.mapproof · cited by 65
- Partrecproof · cited by 48
- Partrec.of_eqproof · cited by 19
- ComputablePredstatement and proof · cited by 17
- Part.eq_some_iffproof · cited by 17
- Computable.to₂proof · cited by 17
- Computable.constproof · cited by 16
- Part.assertproof · cited by 10
- Partrec.mapproof · cited by 8
Cited by1
Results whose statement or proof uses this declaration.
- ComputablePred.computable_iff_re_compl_re'proof · cited by 1