Theorems · Definition · logic and foundations
Turing.TM1.Stmt.below
{Γ : Type u_1} →
{Λ : Type u_2} →
{σ : Type u_3} →
{motive : Turing.TM1.Stmt Γ Λ σ → Sort u} →
Turing.TM1.Stmt Γ Λ σ → Sort (max (max (max (u_1 + 1) (u_2 + 1)) (u_3 + 1)) u)- Cited by
- 7 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
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.TM1.Stmtstatement and proof · cited by 49
- Turing.Dirproof · cited by 30
Cited by9
Results whose statement or proof uses this declaration.
- Turing.TM1.Stmt.brecOn.gostatement and proof · cited by 7
- Turing.TM1.Stmt.brecOn.eqstatement and proof · cited by 6
- Turing.TM1.stepAux.eq_defproof · cited by 3
- Turing.TM1.stmts₁.eq_defproof · cited by 2
- Turing.TM1.SupportsStmt.eq_defproof · cited by 1
- Turing.TM1.Stmt.brecOnstatement and proof · cited by 1
- Turing.TM1to1.writes.eq_defproof · cited by 1
- Turing.TM1to1.trNormal.eq_defproof · cited by 0
- Turing.TM1to0.trAux.eq_defproof · cited by 0