Theorems · Theorem · logic and foundations
PrimrecRel.not
∀ {α : Type u_1} {β : Type u_2} {R : α → β → Prop} [inst : Primcodable α] [inst_1 : Primcodable β],
PrimrecRel R → PrimrecRel fun a b => ¬R a b- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- PrimrecRelstatement and proof · cited by 22
- PrimrecPred.notproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- PrimrecRel.exists_mem_listproof · cited by 1