Theorems · Definition · logic and foundations
Turing.TM2to1.StAct.casesOn
{K : Type u_1} →
{Γ : K → Type u_2} →
{σ : Type u_4} →
{k : K} →
{motive : Turing.TM2to1.StAct K Γ σ k → Sort u} →
(t : Turing.TM2to1.StAct K Γ σ k) →
((a : σ → Γ k) → motive (Turing.TM2to1.StAct.push a)) →
((a : σ → Option (Γ k) → σ) → motive (Turing.TM2to1.StAct.peek a)) →
((a : σ → Option (Γ k) → σ) → motive (Turing.TM2to1.StAct.pop a)) → motive t- Cited by
- 5 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.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Turing.TM2to1.StActstatement and proof · cited by 21
Cited by9
Results whose statement or proof uses this declaration.
- Turing.TM2to1.trNormal_runproof · cited by 2
- Turing.TM2to1.trStmts₁_runproof · cited by 1
- Turing.TM2to1.tr_respects_aux₂proof · cited by 1
- Turing.TM2to1.supports_runproof · cited by 1
- Turing.TM2to1.StAct.ctorElimproof · cited by 0
- Turing.TM2to1.StAct.ctorIdxproof · cited by 0
- Turing.TM2to1.tr_supportsproof · cited by 0
- Turing.TM2to1.StAct.noConfusionproof · cited by 0
- Turing.TM2to1.StAct.noConfusionTypeproof · cited by 0