\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{t15\_sgraph1 (TMH8jbhe1wtJCtbLxFyYZTaTdADouFCoPg3)}
\maketitle
Let $ k2\_sgraph1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_tarski : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k1\_xboole\_0 : {\iota}$ be given.
Let $ v1\_finset\_1 : {{\iota}{\unicdbdjdcd}{o}}$ be given.
Let $ m1\_subset\_1 : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{o}}}$ be given.
Let $ k1\_zfmisc\_1 : {{\iota}{\unicdbdjdcd}{\iota}}$ be given.
Let $ k2\_tarski : {{\iota}{\unicdbdjdcd}{{\iota}{\unicdbdjdcd}{\iota}}}$ be given.
Assume the following.
\begin{equation}
\begin{array}{c}{\unicdcdadad} X0 .  {\unicdcdadad} X1 .  (X1 \in k2\_sgraph1~X0){\unicdbdjded}(((v1\_finset\_1~X1){\unicdcdcdhd}\\
(m1\_subset\_1~X1~(k1\_zfmisc\_1~X0))){\unicdcdcdhd}({\unicdcdaddd} X2 .  {\unicdcdaddd} X3 .  (X2 \in \\
X0){\unicdcdcdhd}((X3 \in X0){\unicdcdcdhd}((X2{\unicdcdgdad}X3){\unicdcdcdhd}(X1=k2\_tarski~X2~X3)))))\end{array}
\label{hyp:ehidpfdhhgchbgahigbd}
\end{equation}
Assume the following.
\begin{equation}
{{\unicdcdadad} X0 .  {{\preoh{{({{X0}{\unicdcdgdad}{k1\_xboole\_0}})}}}{\unicdcdcdhd}{({{\unicdcdadad} X1 .  {\preoh{{{X1} \in {X0}}}}})}}}\label{hyp:ehhdpfihcgpgpgmgfgpfad}
\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:ehbdfdpfdhhgchbgahigbd}
${{\unicdcdadad} X0 .  {{{k2\_sgraph1}~{({{k1\_tarski}~{X0}})}}={k1\_xboole\_0}}}$.
\end{theorem}
\end{document}
