A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://openmath.org/cd/setname1 below:

setname1

OpenMath Content Dictionary: setname1
Canonical URL:
http://www.openmath.org/cd/setname1.ocd
CD Base:
http://www.openmath.org/cd
CD File:
setname1.ocd
CD as XML Encoded OpenMath:
setname1.omcd
Defines:
C, N, P, Q, R, Z
Date:
2004-03-30
Version:
3 (Revision 1)
Review Date:
2006-03-30
Status:
official 
     This document is distributed in the hope that it will be useful, 
     but WITHOUT ANY WARRANTY; without even the implied warranty of 
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

     The copyright holder grants you permission to redistribute this 
     document freely as a verbatim copy. Furthermore, the copyright
     holder permits you to develop any derived work from this document
     provided that the following conditions are met.
       a) The derived work acknowledges the fact that it is derived from
          this document, and maintains a prominent reference in the 
          work to the original source.
       b) The fact that the derived work is not the original OpenMath 
          document is stated prominently in the derived work.  Moreover if
          both this document and the derived work are Content Dictionaries
          then the derived work must include a different CDName element,
          chosen so that it cannot be confused with any works adopted by
          the OpenMath Society.  In particular, if there is a Content 
          Dictionary Group whose name is, for example, `math' containing
          Content Dictionaries named `math1', `math2' etc., then you should 
          not name a derived Content Dictionary `mathN' where N is an integer.
          However you are free to name it `private_mathN' or some such.  This
          is because the names `mathN' may be used by the OpenMath Society
          for future extensions.
       c) The derived work is distributed under terms that allow the
          compilation of derived works, but keep paragraphs a) and b)
          intact.  The simplest way to do this is to distribute the derived
          work under the OpenMath license, but this is not a requirement.
     If you have questions about this license please contact the OpenMath
     society at http://www.openmath.org.

  Author: OpenMath Consortium
  SourceURL: https://github.com/OpenMath/CDs

This CD defines common sets of mathematics

Written by J.H. Davenport on 1999-04-18.
Revised to add Zm, GFp, GFpn on 1999-11-09.
Revised to add QuotientField and A on 1999-11-19.
P
Role:
constant
Description:

This symbol represents the set of positive prime numbers.

Commented Mathematical property (CMP):
for all n | n is a positive prime number is equivalent to: n is a natural number and n > 1 and ((n=a*b and a and b are natural numbers) implies ((a=1 and b=n) or (b=1 and a=n)))
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
  <OMBIND>
    <OMS name="forall" cd="quant1"/>
    <OMBVAR>
       <OMV name="n"/>
    </OMBVAR>
    <OMA>
      <OMS name="equivalent" cd="logic1"/>
      <OMA>
        <OMS name="in" cd="set1"/>
        <OMV name="n"/>
        <OMS name="P" cd="setname1"/>
      </OMA>
      <OMA>
        <OMS name="and" cd="logic1"/>
        <OMA>
          <OMS name="in" cd="set1"/>
          <OMV name="n"/>
          <OMS name="N" cd="setname1"/>
        </OMA>
        <OMA>
          <OMS name="gt" cd="relation1"/>
          <OMV name="n"/>
          <OMS name="one" cd="alg1"/>
        </OMA>
        <OMA>
          <OMS name="implies" cd="logic1"/>
          <OMA>
            <OMS name="and" cd="logic1"/>
            <OMA>
              <OMS name="eq" cd="relation1"/>
              <OMV name="n"/>
              <OMA>
                <OMS name="times" cd="arith1"/>
                <OMV name="a"/>
                <OMV name="b"/>
              </OMA>
            </OMA>
            <OMA>
              <OMS name="in" cd="set1"/>
              <OMV name="a"/>
              <OMS name="N" cd="setname1"/>
            </OMA>
            <OMA>
              <OMS name="in" cd="set1"/>
              <OMV name="b"/>
              <OMS name="N" cd="setname1"/>
            </OMA>
          </OMA>
          <OMA>
            <OMS name="or" cd="logic1"/>
            <OMA>
              <OMS name="and" cd="logic1"/>
              <OMA>
                <OMS name="eq" cd="relation1"/>
                <OMV name="a"/>
                <OMS name="one" cd="alg1"/>
              </OMA>
              <OMA>
                <OMS name="eq" cd="relation1"/>
                <OMV name="b"/>
                <OMV name="n"/>
              </OMA>
            </OMA>
            <OMA>
              <OMS name="and" cd="logic1"/>
              <OMA>
                <OMS name="eq" cd="relation1"/>
                <OMV name="b"/>
                <OMS name="one" cd="alg1"/>
              </OMA>
              <OMA>
                <OMS name="eq" cd="relation1"/>
                <OMV name="a"/>
                <OMV name="n"/>
              </OMA>
            </OMA>
          </OMA>
        </OMA>
      </OMA>
    </OMA>
  </OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>n</ci></bvar>
  <apply><csymbol cd="logic1">equivalent</csymbol>
   <apply><csymbol cd="set1">in</csymbol><ci>n</ci><csymbol cd="setname1">P</csymbol></apply>
   <apply><csymbol cd="logic1">and</csymbol>
    <apply><csymbol cd="set1">in</csymbol><ci>n</ci><csymbol cd="setname1">N</csymbol></apply>
    <apply><csymbol cd="relation1">gt</csymbol><ci>n</ci><csymbol cd="alg1">one</csymbol></apply>
    <apply><csymbol cd="logic1">implies</csymbol>
     <apply><csymbol cd="logic1">and</csymbol>
      <apply><csymbol cd="relation1">eq</csymbol>
       <ci>n</ci>
       <apply><csymbol cd="arith1">times</csymbol><ci>a</ci><ci>b</ci></apply>
      </apply>
      <apply><csymbol cd="set1">in</csymbol><ci>a</ci><csymbol cd="setname1">N</csymbol></apply>
      <apply><csymbol cd="set1">in</csymbol><ci>b</ci><csymbol cd="setname1">N</csymbol></apply>
     </apply>
     <apply><csymbol cd="logic1">or</csymbol>
      <apply><csymbol cd="logic1">and</csymbol>
       <apply><csymbol cd="relation1">eq</csymbol><ci>a</ci><csymbol cd="alg1">one</csymbol></apply>
       <apply><csymbol cd="relation1">eq</csymbol><ci>b</ci><ci>n</ci></apply>
      </apply>
      <apply><csymbol cd="logic1">and</csymbol>
       <apply><csymbol cd="relation1">eq</csymbol><ci>b</ci><csymbol cd="alg1">one</csymbol></apply>
       <apply><csymbol cd="relation1">eq</csymbol><ci>a</ci><ci>n</ci></apply>
      </apply>
     </apply>
    </apply>
   </apply>
  </apply>
 </bind>
</math>
forall

[

n

] . (

equivalent

(

in

(

n

,

P

) ,

and

(

in

(

n

,

N

) ,

gt

(

n

,

one

) ,

implies

(

and

(

eq

(

n

,

times

(

a

,

b

) ) ,

in

(

a

,

N

) ,

in

(

b

,

N

) ) ,

or

(

and

(

eq

(

a

,

one

) ,

eq

(

b

,

n

) ) ,

and

(

eq

(

b

,

one

) ,

eq

(

a

,

n

) ) ) ) ) ) )

quant1.forall[$n -> logic1.equivalent(set1.in($n, setname1.P), set1.in($n, setname1.N) and $n > alg1.one and ($n = $a * $b and set1.in($a, setname1.N) and set1.in($b, setname1.N) ==> $a = alg1.one and $b = $n > $b = alg1.one and $a = $n))]

∀   n . n ∈ P ≡ ( n ∈ N ∧ n > 1 ∧ ( n = a ⁢ b ∧ a ∈ N ∧ b ∈ N ⇒ ( a = 1 ∧ b = n ) ∨ ( b = 1 ∧ a = n ) ) )

Signatures:
sts
[Next: N] [Last: C] [Top] N
Role:
constant
Description:

This symbol represents the set of natural numbers (including zero).

Commented Mathematical property (CMP):
for all n | n in the natural numbers is equivalent to saying n=0 or n-1 is a natural number
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
  <OMBIND>
    <OMS name="forall" cd="quant1"/>
    <OMBVAR>
       <OMV name="n"/>
    </OMBVAR>
    <OMA>
      <OMS name="implies" cd="logic1"/>
      <OMA>
        <OMS name="in" cd="set1"/>
        <OMV name="n"/>
        <OMS name="N" cd="setname1"/>
      </OMA>
      <OMA>
        <OMS name="or" cd="logic1"/>
        <OMA>
          <OMS name="eq" cd="relation1"/>
          <OMV name="n"/>
          <OMS name="zero" cd="alg1"/>
        </OMA>
        <OMA>
          <OMS name="in" cd="set1"/>
          <OMA>
            <OMS name="minus" cd="arith1"/>
            <OMV name="n"/>
            <OMS name="one" cd="alg1"/>
          </OMA>
          <OMS name="N" cd="setname1"/>
        </OMA>
      </OMA>
    </OMA>
  </OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>n</ci></bvar>
  <apply><csymbol cd="logic1">implies</csymbol>
   <apply><csymbol cd="set1">in</csymbol><ci>n</ci><csymbol cd="setname1">N</csymbol></apply>
   <apply><csymbol cd="logic1">or</csymbol>
    <apply><csymbol cd="relation1">eq</csymbol><ci>n</ci><csymbol cd="alg1">zero</csymbol></apply>
    <apply><csymbol cd="set1">in</csymbol>
     <apply><csymbol cd="arith1">minus</csymbol><ci>n</ci><csymbol cd="alg1">one</csymbol></apply>
     <csymbol cd="setname1">N</csymbol>
    </apply>
   </apply>
  </apply>
 </bind>
</math>

quant1.forall[$n -> set1.in($n, setname1.N) ==> $n = alg1.zero > set1.in($n - alg1.one, setname1.N)]

∀   n . n ∈ N ⇒ ( n = 0 ) ∨ ( n - 1 ) ∈ N

Signatures:
sts
[Next: Z] [Previous: P] [Top] Z
Role:
constant
Description:

This symbol represents the set of integers, positive, negative and zero.

Commented Mathematical property (CMP):
for all z | the statements z is an integer and z is a natural number or -z is a natural number are equivalent
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
  <OMBIND>
    <OMS name="forall" cd="quant1"/>
    <OMBVAR>
       <OMV name="z"/>
    </OMBVAR>
    <OMA>
      <OMS name="implies" cd="logic1"/>
      <OMA>
        <OMS name="in" cd="set1"/>
        <OMV name="z"/>
        <OMS name="Z" cd="setname1"/>
      </OMA>
      <OMA>
        <OMS name="or" cd="logic1"/>
        <OMA>
          <OMS name="in" cd="set1"/>
          <OMV name="z"/>
          <OMS name="N" cd="setname1"/>
        </OMA>
        <OMA>
          <OMS name="in" cd="set1"/>
          <OMA>
            <OMS name="unary_minus" cd="arith1"/>
            <OMV name="z"/>
          </OMA>
          <OMS name="N" cd="setname1"/>
        </OMA>
      </OMA>
    </OMA>
  </OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>z</ci></bvar>
  <apply><csymbol cd="logic1">implies</csymbol>
   <apply><csymbol cd="set1">in</csymbol><ci>z</ci><csymbol cd="setname1">Z</csymbol></apply>
   <apply><csymbol cd="logic1">or</csymbol>
    <apply><csymbol cd="set1">in</csymbol><ci>z</ci><csymbol cd="setname1">N</csymbol></apply>
    <apply><csymbol cd="set1">in</csymbol>
     <apply><csymbol cd="arith1">unary_minus</csymbol><ci>z</ci></apply>
     <csymbol cd="setname1">N</csymbol>
    </apply>
   </apply>
  </apply>
 </bind>
</math>

quant1.forall[$z -> set1.in($z, setname1.Z) ==> set1.in($z, setname1.N) > set1.in( -($z), setname1.N)]

∀   z . z ∈ Z ⇒ z ∈ N ∨ - z ∈ N

Signatures:
sts
[Next: Q] [Previous: N] [Top] Q
Role:
constant
Description:

This symbol represents the set of rational numbers.

Commented Mathematical property (CMP):
for all z where z is a rational, there exists integers p and q with q > 1 and p/q = z
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
  <OMBIND>
    <OMS name="forall" cd="quant1"/>
    <OMBVAR>
       <OMV name="z"/>
    </OMBVAR>
    <OMA>
      <OMS name="implies" cd="logic1"/>
      <OMA>
        <OMS name="in" cd="set1"/>
        <OMV name="z"/>
        <OMS name="Q" cd="setname1"/>
      </OMA>
      <OMBIND>
        <OMS name="exists" cd="quant1"/>
        <OMBVAR>
          <OMV name="p"/>
          <OMV name="q"/>
        </OMBVAR>
        <OMA>
          <OMS name="and" cd="logic1"/>
          <OMA>
            <OMS name="in" cd="set1"/>
            <OMV name="p"/>
            <OMS name="Z" cd="setname1"/>
          </OMA>
          <OMA>
            <OMS name="in" cd="set1"/>
            <OMV name="q"/>
            <OMS name="Z" cd="setname1"/>
          </OMA>
          <OMA>
            <OMS name="geq" cd="relation1"/>
            <OMV name="q"/>
            <OMS name="one" cd="alg1"/>
          </OMA>
          <OMA>
            <OMS name="eq" cd="relation1"/>
            <OMV name="z"/>
            <OMA>
              <OMS name="divide" cd="arith1"/>
              <OMV name="p"/>
              <OMV name="q"/>
            </OMA>
          </OMA>
        </OMA>
      </OMBIND>
     </OMA>
  </OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>z</ci></bvar>
  <apply><csymbol cd="logic1">implies</csymbol>
   <apply><csymbol cd="set1">in</csymbol><ci>z</ci><csymbol cd="setname1">Q</csymbol></apply>
   <bind><csymbol cd="quant1">exists</csymbol>
    <bvar><ci>p</ci></bvar>
    <bvar><ci>q</ci></bvar>
    <apply><csymbol cd="logic1">and</csymbol>
     <apply><csymbol cd="set1">in</csymbol><ci>p</ci><csymbol cd="setname1">Z</csymbol></apply>
     <apply><csymbol cd="set1">in</csymbol><ci>q</ci><csymbol cd="setname1">Z</csymbol></apply>
     <apply><csymbol cd="relation1">geq</csymbol><ci>q</ci><csymbol cd="alg1">one</csymbol></apply>
     <apply><csymbol cd="relation1">eq</csymbol>
      <ci>z</ci>
      <apply><csymbol cd="arith1">divide</csymbol><ci>p</ci><ci>q</ci></apply>
     </apply>
    </apply>
   </bind>
  </apply>
 </bind>
</math>
forall

[

z

] . (

implies

(

in

(

z

,

Q

) ,

exists

[

p q

] . (

and

(

in

(

p

,

Z

) ,

in

(

q

,

Z

) ,

geq

(

q

,

one

) ,

eq

(

z

,

divide

(

p

,

q

) ) ) ) ) )

quant1.forall[$z -> set1.in($z, setname1.Q) ==> quant1.exists[$p, $q -> set1.in($p, setname1.Z) and set1.in($q, setname1.Z) and $q >= alg1.one and $z = $p / $q]]

∀   z . z ∈ Q ⇒ ∃   p , q . p ∈ Z ∧ q ∈ Z ∧ q ≥ 1 ∧ z = p q

Commented Mathematical property (CMP):
for all a,b | a,b rational with a<b implies there exists rational a,c s.t. a<c and c<b
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
<OMBIND>
  <OMS cd="quant1" name="forall"/>
  <OMBVAR>
    <OMV name="a"/>
    <OMV name="b"/>
  </OMBVAR>
  <OMA>
    <OMS cd="logic1" name="implies"/>
    <OMA>
      <OMS cd="logic1" name="and"/>
      <OMA>
        <OMS cd="set1" name="in"/>
	<OMV name="a"/>
	<OMS cd="setname1" name="Q"/>
      </OMA>
      <OMA>
        <OMS cd="set1" name="in"/>
	<OMV name="b"/>
	<OMS cd="setname1" name="Q"/>
      </OMA>
      <OMA>
        <OMS cd="relation1" name="lt"/>
	<OMV name="a"/>
	<OMV name="b"/>
      </OMA>
    </OMA>
    <OMBIND>
      <OMS cd="quant1" name="exists"/>
      <OMBVAR>
        <OMV name="c"/>
      </OMBVAR>
      <OMA>
        <OMS cd="logic1" name="and"/>
	<OMA>
	  <OMS cd="set1" name="in"/>
	  <OMV name="c"/>
	  <OMS cd="setname1" name="Q"/>
	</OMA>
	<OMA>
	  <OMS cd="relation1" name="lt"/>
	  <OMV name="a"/>
	  <OMV name="c"/>
	</OMA>
	<OMA>
	  <OMS cd="relation1" name="lt"/>
	  <OMV name="c"/>
	  <OMV name="b"/>
	</OMA>
      </OMA>
    </OMBIND>
  </OMA>
</OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>a</ci></bvar>
  <bvar><ci>b</ci></bvar>
  <apply><csymbol cd="logic1">implies</csymbol>
   <apply><csymbol cd="logic1">and</csymbol>
    <apply><csymbol cd="set1">in</csymbol><ci>a</ci><csymbol cd="setname1">Q</csymbol></apply>
    <apply><csymbol cd="set1">in</csymbol><ci>b</ci><csymbol cd="setname1">Q</csymbol></apply>
    <apply><csymbol cd="relation1">lt</csymbol><ci>a</ci><ci>b</ci></apply>
   </apply>
   <bind><csymbol cd="quant1">exists</csymbol>
    <bvar><ci>c</ci></bvar>
    <apply><csymbol cd="logic1">and</csymbol>
     <apply><csymbol cd="set1">in</csymbol><ci>c</ci><csymbol cd="setname1">Q</csymbol></apply>
     <apply><csymbol cd="relation1">lt</csymbol><ci>a</ci><ci>c</ci></apply>
     <apply><csymbol cd="relation1">lt</csymbol><ci>c</ci><ci>b</ci></apply>
    </apply>
   </bind>
  </apply>
 </bind>
</math>
forall

[

a b

] . (

implies

(

and

(

in

(

a

,

Q

) ,

in

(

b

,

Q

) ,

lt

(

a

,

b

) ) ,

exists

[

c

] . (

and

(

in

(

c

,

Q

) ,

lt

(

a

,

c

) ,

lt

(

c

,

b

) ) ) ) )

quant1.forall[$a, $b -> set1.in($a, setname1.Q) and set1.in($b, setname1.Q) and $a < $b ==> quant1.exists[$c -> set1.in($c, setname1.Q) and $a < $c and $c < $b]]

∀   a , b . a ∈ Q ∧ b ∈ Q ∧ a < b ⇒ ∃   c . c ∈ Q ∧ a < c ∧ c < b

Signatures:
sts
[Next: R] [Previous: Z] [Top] R
Role:
constant
Description:

This symbol represents the set of real numbers.

Commented Mathematical property (CMP):
S \subset R and exists y in R : forall x in S x <= y) implies exists z in R such that (( forall x in S x <= z) and ((forall x in S x <= w) implies z <= w)
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
  <OMA>
    <OMS cd="logic1" name="implies"/>
    <OMA>
      <OMS cd="logic1" name="and"/>
      <OMA>
        <OMS cd="set1" name="subset"/>
	<OMV name="S"/>
	<OMS cd="setname1" name="R"/>
      </OMA>
      <OMBIND>
        <OMS cd="quant1" name="exists"/>
	<OMBVAR>
	  <OMV name="y"/>
	</OMBVAR>
	<OMA>
	  <OMS cd="logic1" name="and"/>
	  <OMA>
	    <OMS cd="set1" name="in"/>
	    <OMV name="y"/>
	    <OMS cd="setname1" name="R"/>
	  </OMA>
	  <OMBIND>
	    <OMS cd="quant1" name="forall"/>
	    <OMBVAR>
	      <OMV name="x"/>
	    </OMBVAR>
	    <OMA>
	      <OMS cd="logic1" name="and"/>
	      <OMA>
	        <OMS cd="set1" name="in"/>
		<OMV name="x"/>
		<OMV name="S"/>
	      </OMA>
	      <OMA>
	        <OMS cd="relation1" name="leq"/>
		<OMV name="x"/>
		<OMV name="y"/>
	      </OMA>
	    </OMA>
	  </OMBIND>
	</OMA>
      </OMBIND>
    </OMA>
    <OMBIND>
      <OMS cd="quant1" name="exists"/>
      <OMBVAR>
        <OMV name="z"/>
      </OMBVAR>
      <OMA>
        <OMS cd="logic1" name="and"/>
	<OMA>
          <OMS cd="set1" name="in"/>
	  <OMV name="z"/>
	  <OMS cd="setname1" name="R"/>
	</OMA>
	<OMBIND>
	  <OMS cd="quant1" name="forall"/>
	  <OMBVAR>
	    <OMV name="x"/>
	  </OMBVAR>
	  <OMA>
	    <OMS cd="logic1" name="implies"/>
	    <OMA>
	      <OMS cd="set1" name="in"/>
	      <OMV name="x"/>
	      <OMV name="S"/>
	    </OMA>
	    <OMA>
	      <OMS cd="relation1" name="leq"/>
	      <OMV name="x"/>
	      <OMV name="z"/>
	    </OMA>
	  </OMA>
	</OMBIND>
	<OMA>
	  <OMS cd="logic1" name="implies"/>
	  <OMBIND>
	    <OMS cd="quant1" name="forall"/>
	    <OMBVAR>
	      <OMV name="x"/>
	    </OMBVAR>
	    <OMA>
	      <OMS cd="logic1" name="implies"/>
	      <OMA>
	        <OMS cd="set1" name="in"/>
		<OMV name="x"/>
		<OMV name="S"/>
	      </OMA>
	      <OMA>
	        <OMS cd="relation1" name="leq"/>
		<OMV name="x"/>
		<OMV name="w"/>
	      </OMA>
	    </OMA>
	  </OMBIND>
	  <OMA>
	    <OMS cd="relation1" name="leq"/>
	    <OMV name="z"/>
	    <OMV name="w"/>
	  </OMA>
	</OMA>
      </OMA>
    </OMBIND>
  </OMA>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <apply><csymbol cd="logic1">implies</csymbol>
  <apply><csymbol cd="logic1">and</csymbol>
   <apply><csymbol cd="set1">subset</csymbol><ci>S</ci><csymbol cd="setname1">R</csymbol></apply>
   <bind><csymbol cd="quant1">exists</csymbol>
    <bvar><ci>y</ci></bvar>
    <apply><csymbol cd="logic1">and</csymbol>
     <apply><csymbol cd="set1">in</csymbol><ci>y</ci><csymbol cd="setname1">R</csymbol></apply>
     <bind><csymbol cd="quant1">forall</csymbol>
      <bvar><ci>x</ci></bvar>
      <apply><csymbol cd="logic1">and</csymbol>
       <apply><csymbol cd="set1">in</csymbol><ci>x</ci><ci>S</ci></apply>
       <apply><csymbol cd="relation1">leq</csymbol><ci>x</ci><ci>y</ci></apply>
      </apply>
     </bind>
    </apply>
   </bind>
  </apply>
  <bind><csymbol cd="quant1">exists</csymbol>
   <bvar><ci>z</ci></bvar>
   <apply><csymbol cd="logic1">and</csymbol>
    <apply><csymbol cd="set1">in</csymbol><ci>z</ci><csymbol cd="setname1">R</csymbol></apply>
    <bind><csymbol cd="quant1">forall</csymbol>
     <bvar><ci>x</ci></bvar>
     <apply><csymbol cd="logic1">implies</csymbol>
      <apply><csymbol cd="set1">in</csymbol><ci>x</ci><ci>S</ci></apply>
      <apply><csymbol cd="relation1">leq</csymbol><ci>x</ci><ci>z</ci></apply>
     </apply>
    </bind>
    <apply><csymbol cd="logic1">implies</csymbol>
     <bind><csymbol cd="quant1">forall</csymbol>
      <bvar><ci>x</ci></bvar>
      <apply><csymbol cd="logic1">implies</csymbol>
       <apply><csymbol cd="set1">in</csymbol><ci>x</ci><ci>S</ci></apply>
       <apply><csymbol cd="relation1">leq</csymbol><ci>x</ci><ci>w</ci></apply>
      </apply>
     </bind>
     <apply><csymbol cd="relation1">leq</csymbol><ci>z</ci><ci>w</ci></apply>
    </apply>
   </apply>
  </bind>
 </apply>
</math>
implies

(

and

(

subset

(

S

,

R

) ,

exists

[

y

] . (

and

(

in

(

y

,

R

) ,

forall

[

x

] . (

and

(

in

(

x

,

S

) ,

leq

(

x

,

y

) ) ) ) ) ) ,

exists

[

z

] . (

and

(

in

(

z

,

R

) ,

forall

[

x

] . (

implies

(

in

(

x

,

S

) ,

leq

(

x

,

z

) ) ) ,

implies

(

forall

[

x

] . (

implies

(

in

(

x

,

S

) ,

leq

(

x

,

w

) ) ) ,

leq

(

z

,

w

) ) ) ) )

set1.subset($S, setname1.R) and quant1.exists[$y -> set1.in($y, setname1.R) and quant1.forall[$x -> set1.in($x, $S) and $x <= $y]] ==> quant1.exists[$z -> set1.in($z, setname1.R) and quant1.forall[$x -> set1.in($x, $S) ==> $x <= $z] and (quant1.forall[$x -> set1.in($x, $S) ==> $x <= $w] ==> $z <= $w)]

S ⊂ R ∧ ∃   y . y ∈ R ∧ ∀   x . x ∈ S ∧ x ≤ y ⇒ ∃   z . z ∈ R ∧ ∀   x . x ∈ S ⇒ x ≤ z ∧ ( ∀   x . x ∈ S ⇒ x ≤ w ⇒ z ≤ w )

Signatures:
sts
[Next: C] [Previous: Q] [Top] C
Role:
constant
Description:

This symbol represents the set of complex numbers.

Commented Mathematical property (CMP):
for all z | if z is complex then there exist reals x,y s.t. z = x + i * y
Formal Mathematical property (FMP): 
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0" cdbase="http://www.openmath.org/cd">
<OMBIND>
  <OMS cd="quant1" name="forall"/>
  <OMBVAR>
    <OMV name="z"/>
  </OMBVAR>
  <OMA>
    <OMS cd="logic1" name="implies"/>
    <OMA>
      <OMS cd="set1" name="in"/>
      <OMV name="z"/>
      <OMS cd="setname1" name="C"/>
    </OMA>
    <OMBIND>
      <OMS cd="quant1" name="exists"/>
      <OMBVAR>
        <OMV name="x"/>
	<OMV name="y"/>
      </OMBVAR>
      <OMA>
        <OMS cd="logic1" name="and"/>
	<OMA>
	  <OMS cd="set1" name="in"/>
	  <OMV name="x"/>
	  <OMS cd="setname1" name="R"/>
	</OMA>
	<OMA>
	  <OMS cd="set1" name="in"/>
	  <OMV name="y"/>
	  <OMS cd="setname1" name="R"/>
	</OMA>
	<OMA>
	  <OMS cd="relation1" name="eq"/>
	  <OMV name="z"/>
	  <OMA>
	    <OMS cd="arith1" name="plus"/>
	    <OMV name="x"/>
	    <OMA>
	      <OMS cd="arith1" name="times"/>
	      <OMS cd="nums1" name="i"/>
	      <OMV name="y"/>
	    </OMA>
	  </OMA>
	</OMA>
      </OMA>
    </OMBIND>
  </OMA>
</OMBIND>
</OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <bind><csymbol cd="quant1">forall</csymbol>
  <bvar><ci>z</ci></bvar>
  <apply><csymbol cd="logic1">implies</csymbol>
   <apply><csymbol cd="set1">in</csymbol><ci>z</ci><csymbol cd="setname1">C</csymbol></apply>
   <bind><csymbol cd="quant1">exists</csymbol>
    <bvar><ci>x</ci></bvar>
    <bvar><ci>y</ci></bvar>
    <apply><csymbol cd="logic1">and</csymbol>
     <apply><csymbol cd="set1">in</csymbol><ci>x</ci><csymbol cd="setname1">R</csymbol></apply>
     <apply><csymbol cd="set1">in</csymbol><ci>y</ci><csymbol cd="setname1">R</csymbol></apply>
     <apply><csymbol cd="relation1">eq</csymbol>
      <ci>z</ci>
      <apply><csymbol cd="arith1">plus</csymbol>
       <ci>x</ci>
       <apply><csymbol cd="arith1">times</csymbol><csymbol cd="nums1">i</csymbol><ci>y</ci></apply>
      </apply>
     </apply>
    </apply>
   </bind>
  </apply>
 </bind>
</math>

quant1.forall[$z -> set1.in($z, setname1.C) ==> quant1.exists[$x, $y -> set1.in($x, setname1.R) and set1.in($y, setname1.R) and $z = $x + nums1.i * $y]]

∀   z . z ∈ C ⇒ ∃   x , y . x ∈ R ∧ y ∈ R ∧ z = x + i ⁢ y

Signatures:
sts
[First: P] [Previous: R] [Top]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.5