\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{t93\_finseq\_3 (TMcpbgGu7QjHfzWR6476mUsUcxYvgJJTZ72)}
\maketitle
Let $ v2\_funct\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k9\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k2\_finseq\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ np\_\_1 : {\iota}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ np\_\_2 : {\iota}$ be given.
Let $ k2\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Let $ v1\_relat\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_funct\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k9\_xtuple\_0 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_funct\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}(k2\_finseq\_1~np\_\_1=k1\_tarski~np\_\_1){\unicdcdcdhd}(k2\_finseq\_1~np\_\_2=k2\_tarski~\\
np\_\_1~np\_\_2)\end{array}
\label{hyp:ehcdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  (v1\_relat\_1~(k9\_finseq\_1~X0)){\unicdcdcdhd}(v1\_funct\_1~(k9\_finseq\_1~\\
X0))\end{array}
\label{hyp:egehpflgjdpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  ((v1\_relat\_1~X1){\unicdcdcdhd}(v1\_funct\_1~X1)){\unicdbdjdcd}((X1=\\
k9\_finseq\_1~X0){\unicdbdjded}((k9\_xtuple\_0~X1=k2\_finseq\_1~np\_\_1){\unicdcdcdhd}(k1\_funct\_1~\\
X1~np\_\_1=X0)))\end{array}
\label{hyp:egidpfggjgogdhfgbhpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  ((v1\_relat\_1~X0){\unicdcdcdhd}(v1\_funct\_1~X0)){\unicdbdjdcd}((v2\_funct\_1~X0){\unicdbdjded}\\
({\unicdcdadad} X1 .  {\unicdcdadad} X2 .  ((X1 \in k9\_xtuple\_0~X0){\unicdcdcdhd}((X2 \in k9\_xtuple\_0~\\
X0){\unicdcdcdhd}(k1\_funct\_1~X0~X1=k1\_funct\_1~X0~X2))){\unicdbdjdcd}(X1=X2)))\end{array}
\label{hyp:egedpfggfhogdgehpfbd}
\end{equation}
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (X1=k1\_tarski~X0){\unicdbdjded}({\unicdcdadad} X2 .  (X2 \in X1){\unicdbdjded}\\
(X2=X0))\end{array}
\label{hyp:egbdpfehbgchdhlgjg}
\end{equation}
\begin{theorem}\label{thm:ehjdddpfggjgogdhfgbhpfdd}
${{\unicdcdadad} X0 .  {{v2\_funct\_1}~{({{k9\_finseq\_1}~{X0}})}}}$.
\end{theorem}
\end{document}
