<?xml version="1.0" encoding="UTF-8"?>
<QEDEQ 
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:noNamespaceSchemaLocation="http://www.qedeq.org/0_04_07/xml/qedeq.xsd">
  <HEADER email="mime@qedeq.org">
    <SPECIFICATION name="MCEC052" ruleVersion="1.00.00">
      <LOCATIONS>
        <LOCATION value="file:///."/>
      </LOCATIONS>
    </SPECIFICATION>
    <TITLE>
      <LATEX language="en">
         Identity Definition
      </LATEX>
    </TITLE>
    <ABSTRACT>
      <LATEX language="en">
         We define the identity constant and have some atoms and a proposition.
      </LATEX>
    </ABSTRACT>
    <AUTHORS>
      <AUTHOR email="michael@meyling.com">
        <NAME>
          <LATEX language="de">
            Michael Meyling
          </LATEX>
        </NAME>
      </AUTHOR>
    </AUTHORS>
  </HEADER>
  <CHAPTER>
    <TITLE>
      <LATEX language="en">
        The Only One
      </LATEX>
    </TITLE>
    <INTRODUCTION>
      <LATEX language="en">
        <![CDATA[
          This module is for testing purposes only.
        ]]>
      </LATEX>
    </INTRODUCTION>
    <SECTION>
      <TITLE>
        <LATEX language="en">Identity</LATEX>
      </TITLE>
      <INTRODUCTION>
        <LATEX language="en">
          <![CDATA[
            We have a definition some axioms and a proposition.
          ]]>
        </LATEX>
      </INTRODUCTION>
      <SUBSECTIONS>
        <NODE id="definition:in">
          <NAME>
            <LATEX language="en">is a member of</LATEX>
            <LATEX language="de">ist enthalten in</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Membership Operator</LATEX>
            <LATEX language="de">Elementbeziehung</LATEX>
          </TITLE>
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[
                The theory of sets introduced here has initial objects, called \emph{classes}. Furthermore the only predefined symbol is for a binary relation called \emph{membership}.
              ]]>
            </LATEX>
            <LATEX language="de">
              <![CDATA[
                Die hier vorgestellte Mengenlehre hat als Ausgangsobjekte \emph{Klassen}.
                Weiterhin wird nur ein einziges Symbol für eine binäre Relation vorausgesetzt: der \emph{Enthaltenseinoperator}.
              ]]>
            </LATEX>
          </PRECEDING>
          <DEFINITION_PREDICATE_INITIAL arguments="2" name="in">
            <LATEXPATTERN>#1 \in #2</LATEXPATTERN>
            <PREDCON ref="in">
              <VAR id="x"/>
              <VAR id="y"/>
            </PREDCON>
          </DEFINITION_PREDICATE_INITIAL>
          <SUCCEEDING>
            <LATEX language="en">
              <![CDATA[
                We also say ``$x$ \emph{is element of} $y$'', ``$x$ \emph{belongs to} $y$'', ``$x$ \emph{is a member of} $y$'' or ``$x$ \emph{is in} $y$''.
                Beside identity this is the only predicate we start with. All other will be defined. Also no function constants are initially given. Later on we will successively fix their meaning.
              ]]>
            </LATEX>
            <LATEX language="de">
              <![CDATA[
                Wir sagen auch \glqq$x$ \emph{ist Element von} $y$\grqq, \glqq$x$ \emph{gehört zu} $y$\grqq, \glqq$x$ \emph{liegt in} $y$\grqq oder auch \glqq$x$ \emph{ist in} $y$\grqq.
                Neben der Identität ist dies das einzige Prädikat welches wir zu Beginn haben. Alle anderen werden definiert. Auch Funktionskonstanten haben wir zu Anfang nicht, ihre Bedeutung wird sukzessive im weiteren Verlauf festgelegt.
              ]]>
            </LATEX>
          </SUCCEEDING>
        </NODE>

        <NODE id="definition:identity">
          <NAME>
            <LATEX language="en">identity definition</LATEX>
            <LATEX language="de">Definition der Identität</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Identity\index{identity}\index{definition!of identity}</LATEX>
            <LATEX language="de">Identität\index{Identität}\index{Definition!der Identität}</LATEX>
          </TITLE>
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[
                We define a predicate constant of arity two that shall stand for the identity of subjects.
              ]]>
            </LATEX>
            <LATEX language="de">
              <![CDATA[
                Es wird eine zweistellige Prädikatskonstante festgelegt, welche in der Interpretation die Identität von Subjekten ausdrücken soll.
              ]]>
            </LATEX>
          </PRECEDING>
          <DEFINITION_PREDICATE_INITIAL arguments="2" name="equal">
            <LATEXPATTERN>#1 \ =  \ #2</LATEXPATTERN>
            <PREDCON ref="equal">
              <VAR id="x"/>
              <VAR id="y"/>
            </PREDCON>
          </DEFINITION_PREDICATE_INITIAL>
        </NODE>
        
        <NODE id="definition:notEqual">
          <NAME>
            <LATEX language="en">not identical definition</LATEX>
            <LATEX language="de">Definition der Verschiedenheit</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Not Identical\index{identical!is not}</LATEX>
            <LATEX language="de">Verschiedenheit\index{Verschiedenheit}\index{Definition!der Verschiedenheit}</LATEX>
          </TITLE>
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[
                For convenience we also define the negation of the identity a predicate constant.
              ]]>
            </LATEX>
            <LATEX language="de">
              <![CDATA[
                Aus Bequemlichkeit definieren wir auch die Negation der Identitätskonstante.
              ]]>
            </LATEX>
          </PRECEDING>
          <DEFINITION_PREDICATE arguments="2" name="notEqual">
            <LATEXPATTERN>#1 \ \neq \ #2</LATEXPATTERN>
            <FORMULA>
              <EQUI>
                <PREDCON ref="notEqual">
                  <VAR id="x"/>
                  <VAR id="y"/>
                </PREDCON>
                <NOT>
                  <PREDCON ref="equal">
                    <VAR id="x"/>
                    <VAR id="y"/>
                  </PREDCON>
                </NOT>
              </EQUI>
            </FORMULA>
          </DEFINITION_PREDICATE>
        </NODE>
        
        <NODE id="axiom:identityIsReflexive">
          <NAME>
            <LATEX language="en">reflexivity of identity</LATEX>
            <LATEX language="de">Reflexivität der Identität</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Reflexivity of Identity\index{reflexivity!of identity}\index{identy!reflexivity of}</LATEX>
            <LATEX language="de">Reflexivität der Identität\index{Reflexivität!der Identität}\index{Identität!Reflexivität der}</LATEX>
          </TITLE>
          <AXIOM>
            <FORMULA>
              <PREDCON ref="equal">
                <VAR id="x" />
                <VAR id="x" />
              </PREDCON>
            </FORMULA>
          </AXIOM>
        </NODE>

        <NODE id="axiom:leibnizReplacement">
          <NAME>
            <LATEX language="en">Leibniz' replacement</LATEX>
            <LATEX language="de">Leibnizsche Ersetzbarkeit</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Leibniz' replacement\index{Leibniz' replacement}</LATEX>
            <LATEX language="de">Leibnizsche Ersetzbarkeit\index{Leibnizsche Ersetzbarkeit}</LATEX>
          </TITLE>
          <AXIOM>
            <FORMULA>
              <IMPL>
                <PREDCON ref="equal">
                  <VAR id="x" />
                  <VAR id="y" />
                </PREDCON>
                <IMPL>
                  <PREDVAR id="\phi">
                    <VAR id="x" />
                  </PREDVAR>
                  <PREDVAR id="\phi">
                    <VAR id="y" />
                  </PREDVAR>
                </IMPL>
              </IMPL>
            </FORMULA>
          </AXIOM>
        </NODE>

        <NODE id="axiom:symmetryOfIdentity">
          <NAME>
            <LATEX language="en">symmetry of identity</LATEX>
            <LATEX language="de">Symmetrie der Identität</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Symmetrie of identity\index{identity!symmetry of}</LATEX>
            <LATEX language="de">Symmetrie der Identität\index{Identität!Symmetrie der}</LATEX>
          </TITLE>
          <AXIOM>
            <FORMULA>
              <IMPL>
                <PREDCON ref="equal">
                  <VAR id="x" />
                  <VAR id="y" />
                </PREDCON>
                <PREDCON ref="equal">
                  <VAR id="y" />
                  <VAR id="x" />
                </PREDCON>
              </IMPL>
            </FORMULA>
          </AXIOM>
        </NODE>

        <NODE id="axiom:transitivityOfIdentity">
          <NAME>
            <LATEX language="en">transetivity of identity</LATEX>
            <LATEX language="de">Transitivität der Identität</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Transitivity of identity\index{identity!transetivity of}</LATEX>
            <LATEX language="de">Transitivität der Identität\index{Identität!Transitivität der}</LATEX>
          </TITLE>
          <AXIOM>
            <FORMULA>
              <IMPL>
                <AND>
                  <PREDCON ref="equal">
                    <VAR id="x" />
                    <VAR id="y" />
                  </PREDCON>
                  <PREDCON ref="equal">
                    <VAR id="y" />
                    <VAR id="z" />
                  </PREDCON>
                </AND>
                <PREDCON ref="equal">
                  <VAR id="x" />
                  <VAR id="z" />
                </PREDCON>
              </IMPL>
            </FORMULA>
          </AXIOM>
        </NODE>
        
        <NODE id="theorem:leibnizEquivalence" level="formal">
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[
                We can reverse the second implication in the Leibniz replacement.
              ]]>
            </LATEX>
            <LATEX language="de">
              <![CDATA[
                Bei der Leibnizschen Ersetzbarkeit können wir die zweite Implikation umkehren.
              ]]>
            </LATEX>
          </PRECEDING>
          <THEOREM>
            <FORMULA>
              <IMPL>
                <PREDCON ref="equal">
                  <VAR id="x" />
                  <VAR id="y" />
                </PREDCON>
                <EQUI>
                  <PREDVAR id="\phi">
                    <VAR id="x" />
                  </PREDVAR>
                  <PREDVAR id="\phi">
                    <VAR id="y" />
                  </PREDVAR>
                </EQUI>
              </IMPL>
            </FORMULA>
          </THEOREM>
       </NODE>

        <NODE id="rule:classDefinition">
          <NAME>
            <LATEX language="en">class definition</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Class definition</LATEX>
          </TITLE>
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[
                Starting with \qref{theorem:comprehension} we can extend the syntax and provide a new abbreviation.
              ]]>
            </LATEX>
          </PRECEDING>
          <RULE name="CLASS_DEFINITION_BY_FORMULA" version="1.00.00">
            <LINK id="theorem:comprehension"/>
            <DESCRIPTION>
              <LATEX language="en">
                <![CDATA[
                  For every formula $\alpha(x_1)$ we define the term expression $\{ x_1 \ | \ \alpha(x_1)\}$ where $x_1$ is a subject variable that is not bound within $\alpha(x_1)$. The free variables of $\{ x_1 \ | \ \alpha(x_1)\}$ are the are the free variables of $\alpha(x_1)$. The bound variables correspond to the bound variables of $\alpha(x_1)$ enhanced by $x_1$. 
                  \par
                  All deduction rules are accordingly extended.
                  
                ]]>
              </LATEX>
            </DESCRIPTION>
          </RULE>
          <SUCCEEDING>
            <LATEX language="en">
              <![CDATA[
                In particular the substitution rules must be adapted because now a term can have bound subject variables. \footnote{Luckily we formulated the substitution rules with this extension already in our mind, so we have nothing to do.}
                In the following this new notation is used.
              ]]>
            </LATEX>
          </SUCCEEDING>
        </NODE>
       
        <NODE id="definition:union" level="formal">
          <NAME>
            <LATEX language="en">union</LATEX>
          </NAME>
          <TITLE>
            <LATEX language="en">Union Operator\index{union}\index{class!union}</LATEX>
          </TITLE>
          <PRECEDING>
            <LATEX language="en">
              <![CDATA[

                The union of two classes contains exactly all elements of both classes.
                
              ]]>
            </LATEX>
          </PRECEDING>
          <DEFINITION_FUNCTION arguments="2" name="union">
            <LATEXPATTERN>(#1 \cup #2)</LATEXPATTERN>
            <FORMULA>
              <PREDCON ref="equal">
                <FUNCON ref="union">
                  <VAR id="x"/>
                  <VAR id="y"/>
                </FUNCON>
                <CLASS>
                  <VAR id="z" />
                  <OR>
                    <PREDCON ref="in">
                      <VAR id="z" />
                      <VAR id="x" />
                    </PREDCON>
                    <PREDCON ref="in">
                      <VAR id="z" />
                      <VAR id="y" />
                    </PREDCON>
                  </OR>
                </CLASS>
              </PREDCON>
            </FORMULA>
          </DEFINITION_FUNCTION>
        </NODE>


      </SUBSECTIONS>
    </SECTION>
  </CHAPTER>
</QEDEQ>
