\documentclass{article}
\newtheorem{axiom}{Axiom}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{proposition}{Proposition}
\newtheorem{definition}{Definition}
\newtheorem{example}{Example}
\newtheorem{conjecture}{Conjecture}
\newcommand\unicdcdgdad{\not=}
\newcommand\unicdcdcdbg{\cup}
\newcommand\unicdcdbdgd{\setminus}
\newcommand\unicdcdcdjd{\cap}
\newcommand\unicdcdadad{\forall}
\newcommand\unicdbdjdcd{\Rightarrow}
\newcommand\unicdcdadjd{\notin}
\newcommand\unicdbdjded{\Leftrightarrow}
\newcommand\unicdcdcdid{\lor}
\newcommand\unicdcdcdhd{\land}
\newcommand\uniddcgcg{\lambda}
\newcommand\unicdcdaddd{\exists}
\newcommand\unicdcdidid{\not\subseteq}
\newcommand\preoh[1]{\lnot #1}
\newcommand\mname[1]{{\mathsf{#1}}}
\begin{document}
\title{l8\_matrix\_7 (TMdoen4vFY6jPUdWSdz4rRewrVwNCsY1Ftb)}
\maketitle
Let $ k10\_finseq\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ np\_\_1 : {\iota}$ be given.
Let $ np\_\_2 : {\iota}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  {\unicdcdadad} X2 .  {\unicdcdadad} X3 .  (k10\_finseq\_1~X0~\\
X1=k10\_finseq\_1~X2~X3){\unicdbdjdcd}((X0=X2){\unicdcdcdhd}(X1=X3))\end{array}
\label{hyp:ehhdhdpfggjgogdhfgbhpfbd}
\end{equation}
\begin{theorem}\label{thm:mgidpfngbgehchjgihpfhd}
${{{{k10\_finseq\_1}~{np\_\_1}}~{np\_\_2}}{\unicdcdgdad}{{{k10\_finseq\_1}~{np\_\_2}}~{np\_\_1}}}$.
\end{theorem}
\end{document}
