Theorems · Definition · logic and foundations
Turing.BlankRel.above
{Γ : Type u_1} →
[inst : Inhabited Γ] →
{l₁ l₂ : List Γ} → Turing.BlankRel l₁ l₂ → { l // Turing.BlankExtends l₁ l ∧ Turing.BlankExtends l₂ l }Given two BlankRel lists, there exists (constructively) a common join.
- Defined in
- Mathlib.Computability.TuringMachine.Tape
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 39 from the axioms · uses propext, Quot.sound
- Assumes
- Inhabited
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Turing.BlankRelstatement and proof · cited by 5
- Turing.BlankExtendsstatement · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.