\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{t4\_bintree1 (TMM6G8nMHtaFqqSZdSZuzZi6CTENhXF6vRB)}
\maketitle
Let $ v1\_bintree1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ k2\_trees\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k6\_numbers : {\iota}$ be given.
Let $ v1\_xboole\_0 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ v1\_trees\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}(\preoh v1\_xboole\_0~(k2\_trees\_1~k6\_numbers)){\unicdcdcdhd}((v1\_trees\_1~(k2\_trees\_1~\\
k6\_numbers)){\unicdcdcdhd}(v1\_bintree1~(k2\_trees\_1~k6\_numbers)))\end{array}
\label{hyp:ggdgbdpfcgjgogehchfgfgbd}
\end{equation}
\begin{theorem}\label{thm:ehedpfcgjgogehchfgfgbd}
${{v1\_bintree1}~{({{k2\_trees\_1}~{k6\_numbers}})}}$.
\end{theorem}
\end{document}
