<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="../../../xsl/lemmabase.xsl"?>
<LEMMABASE name="Specification olist"><LEMMADIR><DIRECTORY><TRUENAME>specs/olist/proofs/</TRUENAME></DIRECTORY></LEMMADIR><SAVELEMMASP><F/></SAVELEMMASP><BASEDATE>1623070846000</BASEDATE><MODIFIEDLEMMAS><LIST></LIST></MODIFIEDLEMMAS><ADDEDLEMMAS><LIST></LIST></ADDEDLEMMAS><THELEMMAS><LIST><LE><LEMMAINFO><LEMMANAME>del1-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) → ordered≤(x -1l a)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>le-o</LE><LE>ole-rec</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>6</USERACTIONS><PROOFSTEPS>17</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>del1-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>del1-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-prefix</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ⊑ x0 ∧ ordered≤(x0) → (ordered≤(x) ↔ true)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>k-le-r</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>17</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-prefix-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-prefix-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>as</LE><LE>las</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>del1</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(x) → ordered&lt;(x -1l a)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedls-ls</LE><LE>ls-o</LE><LE>ols-rec</LE><LE>cons</LE><LE>ls-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>5</USERACTIONS><PROOFSTEPS>15</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>del1-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>del1-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-last-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) ∧ x ≠ [] → (ordered≤(x + a ') ↔ ¬ a &lt; x.last)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ole-last</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-last-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-last-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>eq</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, x) = ins≤(a, y) ↔ x = y</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>in-04</LE><LE>ins-rec</LE><LE>ins-y</LE><LE>empty</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>21</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>eq-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>eq-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>sw</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, ins≤(b, x)) = ins≤(b, ins≤(a, x))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y-01</LE><LE>ins-y</LE><LE>ins-n</LE><LE>ins-one-02</LE><LE>ins-one-01</LE><LE>ins-one</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>3</USERACTIONS><PROOFSTEPS>18</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>sw-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>sw-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>merge-empty</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ merge([], x) = x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>merge-empty-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>merge-empty-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>insperm-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ perm(ins≤(a, x + y), ins≤(a, x) + y)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>insperm</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>8</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>insperm-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>insperm-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-in</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + x) ∧ b ∈ x → ¬ b &lt; a</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>app-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-in-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-in-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>forward</LE><LE>localforward</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-one-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ¬ b &lt; a → ins≤(a, b ') = a ' + b '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-one-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-one-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>le-r</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + b ' + x) ↔ ¬ b &lt; a ∧ ordered≤(b ' + x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>le-r-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>le-r-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>ws</LE><LE>lws</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-last</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x + a ') → (ordered≤(x + a ' + b ') ↔ ¬ b &lt; a)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-o</LE><LE>le-r</LE><LE>ole-in</LE><LE>ole-rec</LE><LE>app-01</LE><LE>cons-02</LE><LE>ole-two</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>5</USERACTIONS><PROOFSTEPS>23</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-last-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-last-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>eqdef</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ>perm(x, y), ordered≤(x), ordered≤(y) ⊦ x = y</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>del1-01-01</LE><LE>del1-01</LE><LE>app-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>7</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>eqdef-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>eqdef-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>cons</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(a ' + x) → ordered&lt;(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ls-r</LE><LE>ls-e</LE><LE>ls-o</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>cons-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>cons-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-append</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) ∧ ordered≤(x0) ∧ (x ≠ [] ∧ x0 ≠ [] → ¬ x0.head &lt; x.last) → ordered≤(x + x0)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>k-le-r</LE><LE>le-r</LE><LE>le-o</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>3</USERACTIONS><PROOFSTEPS>13</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-append-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-append-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>app-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x + y) → ordered≤(y)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>app-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>app-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-less-first</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) ∧ x ≠ [] ∧ ¬ a &lt; x.head → ins≤(a, x) = x.head + ins≤(a, x.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>cons-03</LE><LE>ins-y</LE><LE>ins-n</LE><LE>app-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-less-first-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-less-first-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>le-o</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ')</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>le-o-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>le-o-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>sort-possible</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ∃ y. perm(x, y) ∧ ordered≤(y) ∧ &#35; x = &#35; y</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>del1-02</LE><LE>in-04</LE><LE>len</LE><LE>ole</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>3</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>sort-possible-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>sort-possible-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>szle1-orderedls</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ &#35; x ≤ 1 → ordered&lt;(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ls-o</LE><LE>ls-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>szle1-orderedls-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>szle1-orderedls-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>del1-01-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ a ≠ b ∧ ordered≤(x) → ins≤(a, x -1l b) = ins≤(a, x) -1l b</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ole-rec</LE><LE>ins-y</LE><LE>eq</LE><LE>ins-n</LE><LE>app-01</LE><LE>cons-02</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>17</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>del1-01-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>del1-01-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>orderedls-ls</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ b &lt; a ∧ b ∈ x → ¬ ordered&lt;(a ' + x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ls-r</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>orderedls-ls-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>orderedls-ls-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(ins≤(a, x)) ↔ ordered≤(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>app-01</LE><LE>cons-02</LE><LE>le-r</LE><LE>ins-y</LE><LE>empty</LE><LE>ole-rec</LE><LE>ins-n</LE><LE>le-o</LE><LE>ins-e</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>16</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-postfix</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ⊒ x0 ∧ ordered≤(x0) → (ordered≤(x) ↔ true)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>k-le-r</LE><LE>le-e</LE><LE>le-o</LE><LE>ole-rec</LE><LE>app-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>8</USERACTIONS><PROOFSTEPS>17</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-postfix-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-postfix-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>as</LE><LE>las</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>orderedle-ls</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ b &lt; a ∧ b ∈ x → ¬ ordered≤(a ' + x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>cons-02</LE><LE>ole-in</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>orderedle-ls-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>orderedle-ls-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-ex-divide-lsle</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ>ordered≤(x) ⊦ ∃ y, z. x = y + z ∧ (∀ b. b ∈ y → b &lt; a) ∧ (∀ b. b ∈ z → b = a ∨ a &lt; b)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedle-ls</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>7</USERACTIONS><PROOFSTEPS>15</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-ex-divide-lsle-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-ex-divide-lsle-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ls-o</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(a ')</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ls-o-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ls-o-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>empty</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, x) ≠ []</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>empty-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>empty-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>insperm-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ perm(ins≤(a, x), ins≤(a, y)) ↔ perm(x, y)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>insperm</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>5</USERACTIONS><PROOFSTEPS>9</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>insperm-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>insperm-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>len</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ &#35; ins≤(a, x) = &#35; x + 1</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>6</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>len-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>len-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ls-r</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(a ' + b ' + x) ↔ a &lt; b ∧ ordered&lt;(b ' + x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ls-r-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ls-r-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>ws</LE><LE>lws</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ols-rec</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ≠ [] ∧ x.tail ≠ [] → (ordered&lt;(x) ↔ x.head &lt; x.tail.head ∧ ordered&lt;(x.tail))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ls-r</LE><LE>cons</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ols-rec-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ols-rec-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-n</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ b &lt; a → ins≤(a, b ' + x) = b + ins≤(a, x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ins-n-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-n-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>localcut</LE><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-e</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, []) = a '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ins-e-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-e-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-ex-divide-lels</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ>ordered≤(x) ⊦ ∃ y, z. x = y + z ∧ (∀ b. b ∈ y → b &lt; a ∨ b = a) ∧ (∀ b. b ∈ z → a &lt; b)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedle-ls</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>8</USERACTIONS><PROOFSTEPS>19</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-ex-divide-lels-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-ex-divide-lels-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>in-04</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ a ∈ ins≤(a, x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>6</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>in-04-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>in-04-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>cons-03</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + x) → ins≤(a, x) = a ' + x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>le-r</LE><LE>ins-e</LE><LE>app-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>cons-03-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>cons-03-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>one-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, a ') = a ' + a '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-one-02</LE><LE>ins-one-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>one-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>one-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins2</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, ins≤(b, x)) = ins≤(b, ins≤(a, x)) ↔ true</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>sw</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins2-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins2-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-two</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + b ') ↔ ¬ b &lt; a</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-o</LE><LE>le-r</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-two-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-two-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>orderedls-all</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(x) ↔ (∀ m, n. m &lt; n ∧ n &lt; &#35; x → x[m] &lt; x[n])</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedls-ls</LE><LE>ls-o</LE><LE>ols-rec</LE><LE>ls-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>11</USERACTIONS><PROOFSTEPS>31</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>orderedls-all-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>orderedls-all-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>in-01-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ a ≠ b → (a ∈ ins≤(b, x) ↔ a ∈ x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>7</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>in-01-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>in-01-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-y-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ a &lt; b → ins≤(a, b ' + x) = a + b + x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-n</LE><LE>ins-y</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-y-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-y-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>app</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x + y) → ordered≤(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>le-o</LE><LE>ole-rec</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>9</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>app-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>app-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>del1-01-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + (x -1l a)) ∧ ordered≤(x) ∧ a ∈ x → a ' + (x -1l a) = x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedle-ls</LE><LE>le-r</LE><LE>app-01</LE><LE>del1-01</LE><LE>cons-02</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>del1-01-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>del1-01-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>le-e</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤([])</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>le-e-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>le-e-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-rec</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ≠ [] ∧ x.head &lt; a → ins≤(a, x) = x.head + ins≤(a, x.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-n</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-rec-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-rec-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-one</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ b &lt; a → ins≤(a, b ') = b ' + a '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-e</LE><LE>ins-n</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-one-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-one-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>insperm-03</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ perm(ins≤(a, x), y) ↔ perm(a + x, y)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>insperm</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>insperm-03-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>insperm-03-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ls-e</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;([])</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ls-e-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ls-e-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE><LE>nokodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-y</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ¬ b &lt; a → ins≤(a, b ' + x) = a + b + x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>ins-y-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-y-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ordered-shorter-sublist</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(sublist(m0, n1 + 1, x)) ∧ n2 &lt; n1 ∧ n1 + m0 &lt; &#35; x → (ordered≤(sublist(m0, n2 + 1, x)) ↔ true)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ordered-prefix</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>3</USERACTIONS><PROOFSTEPS>6</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ordered-shorter-sublist-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ordered-shorter-sublist-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>ss</LE><LE>lss</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>merge-rec</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ merge(a ' + x0, x) = ins≤(a, merge(x0, x))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><AXIOMLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>0</PROOFSTEPS><PROVEDP><F/></PROVEDP><PROOFEXISTSP><F/></PROOFEXISTSP><PROOFFILENAME>merge-rec-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>merge-rec-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>rest-01</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) ∧ x ≠ [] → ordered≤(x.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>app-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>rest-01-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>rest-01-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-less-last</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ¬ a0 &lt; a → ins≤(a, x + a0 ') = ins≤(a, x) + a0 '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE><LE>ins-one-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>7</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-less-last-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-less-last-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole-rec</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ≠ [] ∧ x.tail ≠ [] → (ordered≤(x) ↔ ¬ x.tail.head &lt; x.head ∧ ordered≤(x.tail))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>app-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-rec-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-rec-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>k-le-r</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(y) ↔ &#35; y ≤ 1 ∨ ¬ y.tail.head &lt; y.head ∧ ordered≤(y.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>app-01</LE><LE>le-o</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>k-le-r-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>k-le-r-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>kodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-yes</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ x ≠ [] ∧ ¬ x.head &lt; a → ins≤(a, x) = a + x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-yes-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-yes-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>del1-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, x) -1l a = x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-n</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>8</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>del1-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>del1-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ex</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ∃ y, z. ins≤(a, x) = y + a ' + z ∧ x = y + z</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-n</LE><LE>ins-y</LE><LE>ins-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>11</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ex-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ex-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>perm-ins</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ perm((x + ins≤(a, y)) -1l a, z) ↔ perm(x + y, z)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>del1-02</LE><LE>in-04</LE><LE>insperm-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>4</USERACTIONS><PROOFSTEPS>7</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>perm-ins-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>perm-ins-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>app-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x + y + z) → ordered≤(y)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>app-01</LE><LE>cons-02</LE><LE>app</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>2</USERACTIONS><PROOFSTEPS>5</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>app-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>app-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>same</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ins≤(a, a ' + x) = a ' + a ' + x</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-y</LE><LE>ins-y-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>same-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>same-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>rest</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(x) ∧ x ≠ [] → ordered&lt;(x.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>cons</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>rest-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>rest-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ole</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) → ordered≤(ins≤(a, x))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ole-01</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ole-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ole-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>k-ls-r</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered&lt;(y) ↔ &#35; y ≤ 1 ∨ y.head &lt; y.tail.head ∧ ordered&lt;(y.tail)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ls-r</LE><LE>cons</LE><LE>ls-o</LE><LE>ls-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>4</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>k-ls-r-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>k-ls-r-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>kodkodax</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>ins-one-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ a &lt; b → ins≤(a, b ') = a ' + b '</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>ins-one</LE><LE>ins-y</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>ins-one-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>ins-one-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>orderedle-all</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(x) ↔ (∀ m, n. m ≤ n ∧ n &lt; &#35; x → ¬ x[n] &lt; x[m])</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>orderedle-ls</LE><LE>app-01</LE><LE>cons-02</LE><LE>le-o</LE><LE>ole-rec</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>10</USERACTIONS><PROOFSTEPS>29</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>orderedle-all-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>orderedle-all-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>insperm</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ perm(a ' + x, ins≤(a, x))</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>del1-02</LE><LE>in-04</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>insperm-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>insperm-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>szle1-orderedle</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ &#35; x ≤ 1 → ordered≤(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-o</LE><LE>le-e</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>1</USERACTIONS><PROOFSTEPS>2</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>szle1-orderedle-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>szle1-orderedle-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>ls</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE><LE><LEMMAINFO><LEMMANAME>cons-02</LEMMANAME><LEMMAGOAL><SEQGOAL><GOALSEQ><SEQ> ⊦ ordered≤(a ' + x) → ordered≤(x)</SEQ></GOALSEQ></SEQGOAL></LEMMAGOAL><LEMMATYPE><USERLEMMA/></LEMMATYPE><VALIDITY><LIST></LIST></VALIDITY><USEDLEMMAS><LIST><LE>le-r</LE><LE>le-e</LE><LE>le-o</LE></LIST></USEDLEMMAS><SMTINFOS><LIST></LIST></SMTINFOS><MAINGOALS><LIST></LIST></MAINGOALS><USERACTIONS>0</USERACTIONS><PROOFSTEPS>3</PROOFSTEPS><PROVEDP><T/></PROVEDP><PROOFEXISTSP><T/></PROOFEXISTSP><PROOFFILENAME>cons-02-proof</PROOFFILENAME><LEMMAPROOFBAG><NONE/></LEMMAPROOFBAG><SAVETREEP><F/></SAVETREEP><INFOFILENAME>cons-02-proof-info</INFOFILENAME><LEMMAPROOFINFOBAG><NONE/></LEMMAPROOFINFOBAG><SAVEINFOSP><F/></SAVEINFOSP><SIMPFEATURES><LIST><LE>s</LE><LE>localforward</LE></LIST></SIMPFEATURES><HISTINFO><LIST></LIST></HISTINFO></LEMMAINFO></LE></LIST></THELEMMAS><EXTRALEMMABASE><EXTRALEMMABASELIST><EXTRALEMMABASELIST><LIST><LE><SPECHEUINFO><PRDSLOT><LIST></LIST></PRDSLOT><SIZESLOT><LIST></LIST></SIZESLOT><CONSTRSLOT><LIST></LIST></CONSTRSLOT><DONOTUSE>0</DONOTUSE></SPECHEUINFO></LE></LIST></EXTRALEMMABASELIST></EXTRALEMMABASELIST></EXTRALEMMABASE></LEMMABASE>