Mathlib Map

Theorems · Definition · logic and foundations

Turing.TM0.Cfg.mk.noConfusion

{Γ : Type u_1} →
  {Λ : Type u_2} →
    {inst : Inhabited Γ} →
      {P : Sort u} →
        {q : Λ} →
          {Tape : Turing.Tape Γ} →
            {q' : Λ} →
              {Tape' : Turing.Tape Γ} →
                { q := q, Tape := Tape } = { q := q', Tape := Tape' } → (q ≍ q' → Tape ≍ Tape' → P) → P
Defined in
Mathlib.Computability.TuringMachine.PostTuringMachine
Cited by
1 results in Mathlib
Foundations
Depth 7 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Turing.TM0.Cfg.mk.inj · cited by 1mk.injTuring.Tape · cited by 50Turing.TapeTuring.TM0.Cfg · cited by 10TM0.CfgTuring.TM0.Cfg.noConfusion · cited by 0Cfg.noConfusionmk.noConfusionCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.