Intuitionistic Logic Explorer Home Intuitionistic Logic Explorer
Most Recent Proofs
 
Mirrors  >  Home  >  ILE Home  >  Th. List  >  Recent MPE Most Recent             Other  >  MM 100

Most recent proofs    These are the 100 (Unicode, GIF) or 1000 (Unicode, GIF) most recent proofs in the iset.mm database for the Intuitionistic Logic Explorer. The iset.mm database is maintained on GitHub with master (stable) and develop (development) versions. This page was created from the commit given on the MPE Most Recent Proofs page. The database from that commit is also available here: iset.mm.

See the MPE Most Recent Proofs page for news and some useful links.

Color key:   Intuitionistic Logic Explorer  Intuitionistic Logic Explorer   User Mathboxes  User Mathboxes  

Last updated on 18-Jan-2022 at 1:31 AM ET.
Recent Additions to the Intuitionistic Logic Explorer
DateLabelDescription
Theorem
 
5-Dec-2021divalglemqt 10231 Lemma for divalg 10236. The  Q  =  T case involved in showing uniqueness. (Contributed by Jim Kingdon, 5-Dec-2021.)
 |-  ( ph  ->  D  e.  ZZ )   &    |-  ( ph  ->  R  e.  ZZ )   &    |-  ( ph  ->  S  e.  ZZ )   &    |-  ( ph  ->  Q  e.  ZZ )   &    |-  ( ph  ->  T  e.  ZZ )   &    |-  ( ph  ->  Q  =  T )   &    |-  ( ph  ->  (
 ( Q  x.  D )  +  R )  =  ( ( T  x.  D )  +  S ) )   =>    |-  ( ph  ->  R  =  S )
 
4-Dec-2021divalglemeuneg 10235 Lemma for divalg 10236. Uniqueness for a negative denominator. (Contributed by Jim Kingdon, 4-Dec-2021.)
 |-  ( ( N  e.  ZZ  /\  D  e.  ZZ  /\  D  <  0 ) 
 ->  E! r  e.  ZZ  E. q  e.  ZZ  (
 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r )
 ) )
 
4-Dec-2021divalglemeunn 10233 Lemma for divalg 10236. Uniqueness for a positive denominator. (Contributed by Jim Kingdon, 4-Dec-2021.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN )  ->  E! r  e. 
 ZZ  E. q  e.  ZZ  ( 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r
 ) ) )
 
4-Dec-2021divalglemnqt 10232 Lemma for divalg 10236. The  Q  <  T case involved in showing uniqueness. (Contributed by Jim Kingdon, 4-Dec-2021.)
 |-  ( ph  ->  D  e.  NN )   &    |-  ( ph  ->  R  e.  ZZ )   &    |-  ( ph  ->  S  e.  ZZ )   &    |-  ( ph  ->  Q  e.  ZZ )   &    |-  ( ph  ->  T  e.  ZZ )   &    |-  ( ph  ->  0  <_  S )   &    |-  ( ph  ->  R  <  D )   &    |-  ( ph  ->  ( ( Q  x.  D )  +  R )  =  ( ( T  x.  D )  +  S ) )   =>    |-  ( ph  ->  -.  Q  <  T )
 
2-Dec-2021rspc2gv 2684 Restricted specialization with two quantifiers, using implicit substitution. (Contributed by BJ, 2-Dec-2021.)
 |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph 
 <->  ps ) )   =>    |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A. x  e.  V  A. y  e.  W  ph  ->  ps ) )
 
30-Nov-2021divalglemex 10234 Lemma for divalg 10236. The quotient and remainder exist. (Contributed by Jim Kingdon, 30-Nov-2021.)
 |-  ( ( N  e.  ZZ  /\  D  e.  ZZ  /\  D  =/=  0 ) 
 ->  E. r  e.  ZZ  E. q  e.  ZZ  (
 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r )
 ) )
 
30-Nov-2021divalglemnn 10230 Lemma for divalg 10236. Existence for a positive denominator. (Contributed by Jim Kingdon, 30-Nov-2021.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN )  ->  E. r  e.  ZZ  E. q  e.  ZZ  (
 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r )
 ) )
 
27-Nov-2021ioom 9217 An open interval of extended reals is inhabited iff the lower argument is less than the upper argument. (Contributed by Jim Kingdon, 27-Nov-2021.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( E. x  x  e.  ( A (,) B )  <->  A  <  B ) )
 
26-Nov-2021supisoti 6414 Image of a supremum under an isomorphism. (Contributed by Jim Kingdon, 26-Nov-2021.)
 |-  ( ph  ->  F  Isom  R ,  S  ( A ,  B ) )   &    |-  ( ph  ->  C 
 C_  A )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  C  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  C  y R z ) ) )   &    |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A ) )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   =>    |-  ( ph  ->  sup ( ( F " C ) ,  B ,  S )  =  ( F ` 
 sup ( C ,  A ,  R )
 ) )
 
26-Nov-2021isoti 6411 An isomorphism preserves tightness. (Contributed by Jim Kingdon, 26-Nov-2021.)
 |-  ( F  Isom  R ,  S  ( A ,  B )  ->  ( A. u  e.  A  A. v  e.  A  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) )  <->  A. u  e.  B  A. v  e.  B  ( u  =  v  <->  ( -.  u S v  /\  -.  v S u ) ) ) )
 
26-Nov-2021isotilem 6410 Lemma for isoti 6411. (Contributed by Jim Kingdon, 26-Nov-2021.)
 |-  ( F  Isom  R ,  S  ( A ,  B )  ->  ( A. x  e.  B  A. y  e.  B  ( x  =  y  <->  ( -.  x S y  /\  -.  y S x ) )  ->  A. u  e.  A  A. v  e.  A  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) ) )
 
26-Nov-2021supsnti 6409 The supremum of a singleton. (Contributed by Jim Kingdon, 26-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  B  e.  A )   =>    |-  ( ph  ->  sup ( { B } ,  A ,  R )  =  B )
 
24-Nov-2021supmaxti 6408 The greatest element of a set is its supremum. Note that the converse is not true; the supremum might not be an element of the set considered. (Contributed by Jim Kingdon, 24-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  C  e.  A )   &    |-  ( ph  ->  C  e.  B )   &    |-  (
 ( ph  /\  y  e.  B )  ->  -.  C R y )   =>    |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
 
24-Nov-2021suplubti 6406 A supremum is the least upper bound. See also supclti 6404 and supubti 6405. (Contributed by Jim Kingdon, 24-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )   =>    |-  ( ph  ->  ( ( C  e.  A  /\  C R sup ( B ,  A ,  R ) )  ->  E. z  e.  B  C R z ) )
 
24-Nov-2021supubti 6405 A supremum is an upper bound. See also supclti 6404 and suplubti 6406.

This proof demonstrates how to expand an iota-based definition (df-iota 4895) using riotacl2 5509.

(Contributed by Jim Kingdon, 24-Nov-2021.)

 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )   =>    |-  ( ph  ->  ( C  e.  B  ->  -. 
 sup ( B ,  A ,  R ) R C ) )
 
24-Nov-2021supclti 6404 A supremum belongs to its base class (closure law). See also supubti 6405 and suplubti 6406. (Contributed by Jim Kingdon, 24-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )   =>    |-  ( ph  ->  sup ( B ,  A ,  R )  e.  A )
 
24-Nov-2021eqsuptid 6403 Sufficient condition for an element to be equal to the supremum. (Contributed by Jim Kingdon, 24-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  C  e.  A )   &    |-  ( ( ph  /\  y  e.  B ) 
 ->  -.  C R y )   &    |-  ( ( ph  /\  ( y  e.  A  /\  y R C ) )  ->  E. z  e.  B  y R z )   =>    |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
 
23-Nov-2021eqsupti 6402 Sufficient condition for an element to be equal to the supremum. (Contributed by Jim Kingdon, 23-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   =>    |-  ( ph  ->  ( ( C  e.  A  /\  A. y  e.  B  -.  C R y  /\  A. y  e.  A  (
 y R C  ->  E. z  e.  B  y R z ) ) 
 ->  sup ( B ,  A ,  R )  =  C ) )
 
23-Nov-2021supval2ti 6401 Alternate expression for the supremum. (Contributed by Jim Kingdon, 23-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )   =>    |-  ( ph  ->  sup ( B ,  A ,  R )  =  (
 iota_ x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) ) )
 
23-Nov-2021supeuti 6400 A supremum is unique. Similar to Theorem I.26 of [Apostol] p. 24 (but for suprema in general). (Contributed by Jim Kingdon, 23-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   &    |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )   =>    |-  ( ph  ->  E! x  e.  A  (
 A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )
 
23-Nov-2021supmoti 6399 Any class  B has at most one supremum in  A (where  R is interpreted as 'less than'). The hypothesis is satisfied by real numbers (see lttri3 7157) or other orders which correspond to tight apartnesses. (Contributed by Jim Kingdon, 23-Nov-2021.)
 |-  ( ( ph  /\  ( u  e.  A  /\  v  e.  A )
 )  ->  ( u  =  v  <->  ( -.  u R v  /\  -.  v R u ) ) )   =>    |-  ( ph  ->  E* x  e.  A  ( A. y  e.  B  -.  x R y  /\  A. y  e.  A  ( y R x  ->  E. z  e.  B  y R z ) ) )
 
17-Nov-2021oddpwdclemndvds 10259 Lemma for oddpwdc 10262. A natural number is not divisible by one more than the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)
 |-  ( A  e.  NN  ->  -.  ( 2 ^
 ( ( iota_ z  e. 
 NN0  ( ( 2 ^ z )  ||  A  /\  -.  ( 2 ^ ( z  +  1 ) )  ||  A ) )  +  1 ) )  ||  A )
 
17-Nov-2021oddpwdclemdvds 10258 Lemma for oddpwdc 10262. A natural number is divisible by the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)
 |-  ( A  e.  NN  ->  ( 2 ^ ( iota_
 z  e.  NN0  (
 ( 2 ^ z
 )  ||  A  /\  -.  ( 2 ^ (
 z  +  1 ) )  ||  A )
 ) )  ||  A )
 
17-Nov-2021pw2dvdseulemle 10255 Lemma for pw2dvdseu 10256. Powers of two which do and do not divide a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.)
 |-  ( ph  ->  N  e.  NN )   &    |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  B  e.  NN0 )   &    |-  ( ph  ->  ( 2 ^ A ) 
 ||  N )   &    |-  ( ph  ->  -.  ( 2 ^ ( B  +  1 ) )  ||  N )   =>    |-  ( ph  ->  A  <_  B )
 
16-Nov-2021oddpwdclemdc 10261 Lemma for oddpwdc 10262. Decomposing a number into odd and even parts. (Contributed by Jim Kingdon, 16-Nov-2021.)
 |-  ( ( ( ( X  e.  NN  /\  -.  2  ||  X )  /\  Y  e.  NN0 )  /\  A  =  ( ( 2 ^ Y )  x.  X ) )  <-> 
 ( A  e.  NN  /\  ( X  =  ( A  /  ( 2 ^ ( iota_ z  e. 
 NN0  ( ( 2 ^ z )  ||  A  /\  -.  ( 2 ^ ( z  +  1 ) )  ||  A ) ) ) )  /\  Y  =  ( iota_ z  e.  NN0  ( ( 2 ^
 z )  ||  A  /\  -.  ( 2 ^
 ( z  +  1 ) )  ||  A ) ) ) ) )
 
16-Nov-2021oddpwdclemodd 10260 Lemma for oddpwdc 10262. Removing the powers of two from a natural number produces an odd number. (Contributed by Jim Kingdon, 16-Nov-2021.)
 |-  ( A  e.  NN  ->  -.  2  ||  ( A  /  ( 2 ^
 ( iota_ z  e.  NN0  ( ( 2 ^
 z )  ||  A  /\  -.  ( 2 ^
 ( z  +  1 ) )  ||  A ) ) ) ) )
 
16-Nov-2021oddpwdclemxy 10257 Lemma for oddpwdc 10262. Another way of stating that decomposing a natural number into a power of two and an odd number is unique. (Contributed by Jim Kingdon, 16-Nov-2021.)
 |-  ( ( ( ( X  e.  NN  /\  -.  2  ||  X )  /\  Y  e.  NN0 )  /\  A  =  ( ( 2 ^ Y )  x.  X ) ) 
 ->  ( X  =  ( A  /  ( 2 ^ ( iota_ z  e. 
 NN0  ( ( 2 ^ z )  ||  A  /\  -.  ( 2 ^ ( z  +  1 ) )  ||  A ) ) ) )  /\  Y  =  ( iota_ z  e.  NN0  ( ( 2 ^
 z )  ||  A  /\  -.  ( 2 ^
 ( z  +  1 ) )  ||  A ) ) ) )
 
16-Nov-2021pw2dvdseu 10256 A natural number has a unique highest power of two which divides it. (Contributed by Jim Kingdon, 16-Nov-2021.)
 |-  ( N  e.  NN  ->  E! m  e.  NN0  ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  +  1 )
 )  ||  N )
 )
 
14-Nov-2021pw2dvds 10254 A natural number has a highest power of two which divides it. (Contributed by Jim Kingdon, 14-Nov-2021.)
 |-  ( N  e.  NN  ->  E. m  e.  NN0  ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  +  1 )
 )  ||  N )
 )
 
14-Nov-2021pw2dvdslemn 10253 Lemma for pw2dvds 10254. If a natural number has some power of two which does not divide it, there is a highest power of two which does divide it. (Contributed by Jim Kingdon, 14-Nov-2021.)
 |-  ( ( N  e.  NN  /\  A  e.  NN  /\ 
 -.  ( 2 ^ A )  ||  N ) 
 ->  E. m  e.  NN0  ( ( 2 ^ m )  ||  N  /\  -.  ( 2 ^ ( m  +  1 )
 )  ||  N )
 )
 
14-Nov-2021dvdsdc 10116 Divisibility is decidable. (Contributed by Jim Kingdon, 14-Nov-2021.)
 |-  ( ( M  e.  NN  /\  N  e.  ZZ )  -> DECID  M  ||  N )
 
11-Nov-2021fz01or 10190 An integer is in the integer range from zero to one iff it is either zero or one. (Contributed by Jim Kingdon, 11-Nov-2021.)
 |-  ( A  e.  (
 0 ... 1 )  <->  ( A  =  0  \/  A  =  1 ) )
 
11-Nov-2021muldivdirap 7758 Distribution of division over addition with a multiplication. (Contributed by Jim Kingdon, 11-Nov-2021.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  ( C  e.  CC  /\  C #  0 ) ) 
 ->  ( ( ( C  x.  A )  +  B )  /  C )  =  ( A  +  ( B  /  C ) ) )
 
10-Nov-2021zeoxor 10180 An integer is even or odd but not both. (Contributed by Jim Kingdon, 10-Nov-2021.)
 |-  ( N  e.  ZZ  ->  ( 2  ||  N  \/_  -.  2  ||  N ) )
 
9-Nov-2021qlttri2 8673 Apartness is equivalent to not equal for rationals. (Contributed by Jim Kingdon, 9-Nov-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ )  ->  ( A  =/=  B  <-> 
 ( A  <  B  \/  B  <  A ) ) )
 
8-Nov-2021dvdslelemd 10155 Lemma for dvdsle 10156. (Contributed by Jim Kingdon, 8-Nov-2021.)
 |-  ( ph  ->  M  e.  ZZ )   &    |-  ( ph  ->  N  e.  NN )   &    |-  ( ph  ->  K  e.  ZZ )   &    |-  ( ph  ->  N  <  M )   =>    |-  ( ph  ->  ( K  x.  M )  =/= 
 N )
 
8-Nov-2021qabsord 9903 The absolute value of a rational number is either that number or its negative. (Contributed by Jim Kingdon, 8-Nov-2021.)
 |-  ( ph  ->  A  e.  QQ )   =>    |-  ( ph  ->  (
 ( abs `  A )  =  A  \/  ( abs `  A )  =  -u A ) )
 
8-Nov-2021qabsor 9902 The absolute value of a rational number is either that number or its negative. (Contributed by Jim Kingdon, 8-Nov-2021.)
 |-  ( A  e.  QQ  ->  ( ( abs `  A )  =  A  \/  ( abs `  A )  =  -u A ) )
 
6-Nov-2021ibcval5 9631 Write out the top and bottom parts of the binomial coefficient  ( N  _C  K )  =  ( N  x.  ( N  -  1 )  x. 
...  x.  ( ( N  -  K )  +  1 ) )  /  K ! explicitly. In this form, it is valid even for  N  <  K, although it is no longer valid for nonpositive  K. (Contributed by Jim Kingdon, 6-Nov-2021.)
 |-  ( ( N  e.  NN0  /\  K  e.  NN )  ->  ( N  _C  K )  =  ( (  seq ( ( N  -  K )  +  1
 ) (  x.  ,  _I  ,  CC ) `  N )  /  ( ! `  K ) ) )
 
3-Nov-2021qavgle 9215 The average of two rational numbers is less than or equal to at least one of them. (Contributed by Jim Kingdon, 3-Nov-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ )  ->  ( ( ( A  +  B ) 
 /  2 )  <_  A  \/  ( ( A  +  B )  / 
 2 )  <_  B ) )
 
31-Oct-2021nn0opth2d 9591 An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. See comments for nn0opthd 9590. (Contributed by Jim Kingdon, 31-Oct-2021.)
 |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  B  e.  NN0 )   &    |-  ( ph  ->  C  e.  NN0 )   &    |-  ( ph  ->  D  e.  NN0 )   =>    |-  ( ph  ->  (
 ( ( ( A  +  B ) ^
 2 )  +  B )  =  ( (
 ( C  +  D ) ^ 2 )  +  D )  <->  ( A  =  C  /\  B  =  D ) ) )
 
31-Oct-2021nn0opthd 9590 An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. We can represent an ordered pair of nonnegative integers  A and  B by  (
( ( A  +  B )  x.  ( A  +  B )
)  +  B ). If two such ordered pairs are equal, their first elements are equal and their second elements are equal. Contrast this ordered pair representation with the standard one df-op 3412 that works for any set. (Contributed by Jim Kingdon, 31-Oct-2021.)
 |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  B  e.  NN0 )   &    |-  ( ph  ->  C  e.  NN0 )   &    |-  ( ph  ->  D  e.  NN0 )   =>    |-  ( ph  ->  (
 ( ( ( A  +  B )  x.  ( A  +  B ) )  +  B )  =  ( (
 ( C  +  D )  x.  ( C  +  D ) )  +  D )  <->  ( A  =  C  /\  B  =  D ) ) )
 
31-Oct-2021nn0opthlem2d 9589 Lemma for nn0opth2 9592. (Contributed by Jim Kingdon, 31-Oct-2021.)
 |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  B  e.  NN0 )   &    |-  ( ph  ->  C  e.  NN0 )   &    |-  ( ph  ->  D  e.  NN0 )   =>    |-  ( ph  ->  (
 ( A  +  B )  <  C  ->  (
 ( C  x.  C )  +  D )  =/=  ( ( ( A  +  B )  x.  ( A  +  B ) )  +  B ) ) )
 
31-Oct-2021nn0opthlem1d 9588 A rather pretty lemma for nn0opth2 9592. (Contributed by Jim Kingdon, 31-Oct-2021.)
 |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  C  e.  NN0 )   =>    |-  ( ph  ->  ( A  <  C  <->  ( ( A  x.  A )  +  ( 2  x.  A ) )  <  ( C  x.  C ) ) )
 
31-Oct-2021nn0le2msqd 9587 The square function on nonnegative integers is monotonic. (Contributed by Jim Kingdon, 31-Oct-2021.)
 |-  ( ph  ->  A  e.  NN0 )   &    |-  ( ph  ->  B  e.  NN0 )   =>    |-  ( ph  ->  ( A  <_  B  <->  ( A  x.  A )  <_  ( B  x.  B ) ) )
 
28-Oct-2021mulle0r 7985 Multiplying a nonnegative number by a nonpositive number yields a nonpositive number. (Contributed by Jim Kingdon, 28-Oct-2021.)
 |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  <_  0  /\  0  <_  B ) )  ->  ( A  x.  B )  <_  0 )
 
26-Oct-2021modqeqmodmin 9344 A rational number equals the difference of the rational number and a modulus modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  M  e.  QQ  /\  0  <  M ) 
 ->  ( A  mod  M )  =  ( ( A  -  M )  mod  M ) )
 
26-Oct-2021modqsubdir 9343 Distribute the modulo operation over a subtraction. (Contributed by Jim Kingdon, 26-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( C  e.  QQ  /\  0  <  C ) )  ->  ( ( B  mod  C )  <_  ( A  mod  C )  <->  ( ( A  -  B )  mod  C )  =  ( ( A  mod  C )  -  ( B  mod  C ) ) ) )
 
26-Oct-2021modqdi 9342 Distribute multiplication over a modulo operation. (Contributed by Jim Kingdon, 26-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  0  <  A )  /\  B  e.  QQ  /\  ( C  e.  QQ  /\  0  <  C ) )  ->  ( A  x.  ( B  mod  C ) )  =  ( ( A  x.  B )  mod  ( A  x.  C ) ) )
 
26-Oct-2021modqaddmulmod 9341 The sum of a rational number and the product of a second rational number modulo a modulus and an integer equals the sum of the rational number and the product of the other rational number and the integer modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  C  e.  ZZ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( A  +  ( ( B  mod  M )  x.  C ) )  mod  M )  =  ( ( A  +  ( B  x.  C ) )  mod  M ) )
 
26-Oct-2021modqmulmodr 9340 The product of an integer and a rational number modulo a modulus equals the product of the integer and the rational number modulo the modulus. (Contributed by Jim Kingdon, 26-Oct-2021.)
 |-  ( ( ( A  e.  ZZ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( A  x.  ( B  mod  M ) )  mod  M )  =  ( ( A  x.  B )  mod  M ) )
 
25-Oct-2021modqmulmod 9339 The product of a rational number modulo a modulus and an integer equals the product of the rational number and the integer modulo the modulus. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  ZZ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( ( A 
 mod  M )  x.  B )  mod  M )  =  ( ( A  x.  B )  mod  M ) )
 
25-Oct-2021q2submod 9335 If a number is between a modulus and twice the modulus, the first number modulo the modulus equals the first number minus the modulus. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B )  /\  ( B 
 <_  A  /\  A  <  ( 2  x.  B ) ) )  ->  ( A  mod  B )  =  ( A  -  B ) )
 
25-Oct-2021q2txmodxeq0 9334 Two times a positive number modulo the number is zero. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ( X  e.  QQ  /\  0  <  X )  ->  ( ( 2  x.  X )  mod  X )  =  0 )
 
25-Oct-2021modqsubmodmod 9333 The difference of a number modulo a modulus and another number modulo the same modulus equals the difference of the two numbers modulo the modulus. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( ( A 
 mod  M )  -  ( B  mod  M ) ) 
 mod  M )  =  ( ( A  -  B )  mod  M ) )
 
25-Oct-2021modqsubmod 9332 The difference of a number modulo a modulus and another number equals the difference of the two numbers modulo the modulus. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( ( A 
 mod  M )  -  B )  mod  M )  =  ( ( A  -  B )  mod  M ) )
 
25-Oct-2021modqsub12d 9331 Subtraction property of the modulo operation. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  C  e.  QQ )   &    |-  ( ph  ->  D  e.  QQ )   &    |-  ( ph  ->  E  e.  QQ )   &    |-  ( ph  ->  0  <  E )   &    |-  ( ph  ->  ( A  mod  E )  =  ( B  mod  E ) )   &    |-  ( ph  ->  ( C  mod  E )  =  ( D  mod  E ) )   =>    |-  ( ph  ->  (
 ( A  -  C )  mod  E )  =  ( ( B  -  D )  mod  E ) )
 
25-Oct-2021modqadd12d 9330 Additive property of the modulo operation. (Contributed by Jim Kingdon, 25-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  C  e.  QQ )   &    |-  ( ph  ->  D  e.  QQ )   &    |-  ( ph  ->  E  e.  QQ )   &    |-  ( ph  ->  0  <  E )   &    |-  ( ph  ->  ( A  mod  E )  =  ( B  mod  E ) )   &    |-  ( ph  ->  ( C  mod  E )  =  ( D  mod  E ) )   =>    |-  ( ph  ->  (
 ( A  +  C )  mod  E )  =  ( ( B  +  D )  mod  E ) )
 
25-Oct-2021syl11 31 A syllogism inference. Commuted form of an instance of syl 14. (Contributed by BJ, 25-Oct-2021.)
 |-  ( ph  ->  ( ps  ->  ch ) )   &    |-  ( th  ->  ph )   =>    |-  ( ps  ->  ( th  ->  ch ) )
 
24-Oct-2021ax-ddkcomp 10501 Axiom of Dedekind completeness for Dedekind real numbers: every inhabited upper-bounded located set of reals has a real upper bound. Ideally, this axiom should be "proved" as "axddkcomp" for the real numbers constructed from IZF, and then the axiom ax-ddkcomp 10501 should be used in place of construction specific results. In particular, axcaucvg 7032 should be proved from it. (Contributed by BJ, 24-Oct-2021.)
 |-  (
 ( ( A  C_  RR  /\  E. x  x  e.  A )  /\  E. x  e.  RR  A. y  e.  A  y  <  x  /\  A. x  e.  RR  A. y  e. 
 RR  ( x  < 
 y  ->  ( E. z  e.  A  x  <  z  \/  A. z  e.  A  z  <  y
 ) ) )  ->  E. x  e.  RR  ( A. y  e.  A  y  <_  x  /\  (
 ( B  e.  R  /\  A. y  e.  A  y  <_  B )  ->  x  <_  B ) ) )
 
24-Oct-2021modqnegd 9329 Negation property of the modulo operation. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  C  e.  QQ )   &    |-  ( ph  ->  0  <  C )   &    |-  ( ph  ->  ( A  mod  C )  =  ( B  mod  C ) )   =>    |-  ( ph  ->  ( -u A  mod  C )  =  ( -u B  mod  C ) )
 
24-Oct-2021modqmul12d 9328 Multiplication property of the modulo operation, see theorem 5.2(b) in [ApostolNT] p. 107. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ph  ->  A  e.  ZZ )   &    |-  ( ph  ->  B  e.  ZZ )   &    |-  ( ph  ->  C  e.  ZZ )   &    |-  ( ph  ->  D  e.  ZZ )   &    |-  ( ph  ->  E  e.  QQ )   &    |-  ( ph  ->  0  <  E )   &    |-  ( ph  ->  ( A  mod  E )  =  ( B  mod  E ) )   &    |-  ( ph  ->  ( C  mod  E )  =  ( D  mod  E ) )   =>    |-  ( ph  ->  (
 ( A  x.  C )  mod  E )  =  ( ( B  x.  D )  mod  E ) )
 
24-Oct-2021modqmul1 9327 Multiplication property of the modulo operation. Note that the multiplier  C must be an integer. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  C  e.  ZZ )   &    |-  ( ph  ->  D  e.  QQ )   &    |-  ( ph  ->  0  <  D )   &    |-  ( ph  ->  ( A  mod  D )  =  ( B 
 mod  D ) )   =>    |-  ( ph  ->  ( ( A  x.  C )  mod  D )  =  ( ( B  x.  C )  mod  D ) )
 
24-Oct-2021modqltm1p1mod 9326 If a number modulo a modulus is less than the modulus decreased by 1, the first number increased by 1 modulo the modulus equals the first number modulo the modulus, increased by 1. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  ( A  mod  M )  < 
 ( M  -  1
 ) )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( A  +  1 )  mod  M )  =  ( ( A 
 mod  M )  +  1 ) )
 
24-Oct-2021modqm1p1mod0 9325 If a number modulo a modulus equals the modulus decreased by 1, the first number increased by 1 modulo the modulus equals 0. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  M  e.  QQ  /\  0  <  M ) 
 ->  ( ( A  mod  M )  =  ( M  -  1 )  ->  ( ( A  +  1 )  mod  M )  =  0 ) )
 
24-Oct-2021modqadd2mod 9324 The sum of a number modulo a modulus and another number equals the sum of the two numbers modulo the modulus. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( B  +  ( A  mod  M ) )  mod  M )  =  ( ( B  +  A )  mod  M ) )
 
24-Oct-2021qnegmod 9319 The negation of a number modulo a positive number is equal to the difference of the modulus and the number modulo the modulus. (Contributed by Jim Kingdon, 24-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  N  e.  QQ  /\  0  <  N ) 
 ->  ( -u A  mod  N )  =  ( ( N  -  A )  mod  N ) )
 
23-Oct-2021modqmuladdnn0 9318 Implication of a decomposition of a nonnegative integer into a multiple of a modulus and a remainder. (Contributed by Jim Kingdon, 23-Oct-2021.)
 |-  ( ( A  e.  NN0  /\  M  e.  QQ  /\  0  <  M )  ->  ( ( A  mod  M )  =  B  ->  E. k  e.  NN0  A  =  ( ( k  x.  M )  +  B ) ) )
 
23-Oct-2021modqmuladdim 9317 Implication of a decomposition of an integer into a multiple of a modulus and a remainder. (Contributed by Jim Kingdon, 23-Oct-2021.)
 |-  ( ( A  e.  ZZ  /\  M  e.  QQ  /\  0  <  M ) 
 ->  ( ( A  mod  M )  =  B  ->  E. k  e.  ZZ  A  =  ( ( k  x.  M )  +  B ) ) )
 
23-Oct-2021modqmuladd 9316 Decomposition of an integer into a multiple of a modulus and a remainder. (Contributed by Jim Kingdon, 23-Oct-2021.)
 |-  ( ph  ->  A  e.  ZZ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  B  e.  (
 0 [,) M ) )   &    |-  ( ph  ->  M  e.  QQ )   &    |-  ( ph  ->  0  <  M )   =>    |-  ( ph  ->  ( ( A  mod  M )  =  B  <->  E. k  e.  ZZ  A  =  ( (
 k  x.  M )  +  B ) ) )
 
23-Oct-2021mulqaddmodid 9314 The sum of a positive rational number less than an upper bound and the product of an integer and the upper bound is the positive rational number modulo the upper bound. (Contributed by Jim Kingdon, 23-Oct-2021.)
 |-  ( ( ( N  e.  ZZ  /\  M  e.  QQ )  /\  ( A  e.  QQ  /\  A  e.  ( 0 [,) M ) ) )  ->  ( ( ( N  x.  M )  +  A )  mod  M )  =  A )
 
23-Oct-2021modqaddmod 9313 The sum of a number modulo a modulus and another number equals the sum of the two numbers modulo the same modulus. (Contributed by Jim Kingdon, 23-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( M  e.  QQ  /\  0  <  M ) )  ->  ( ( ( A 
 mod  M )  +  B )  mod  M )  =  ( ( A  +  B )  mod  M ) )
 
22-Oct-2021modqaddabs 9312 Absorption law for modulo. (Contributed by Jim Kingdon, 22-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  ( C  e.  QQ  /\  0  <  C ) )  ->  ( ( ( A 
 mod  C )  +  ( B  mod  C ) ) 
 mod  C )  =  ( ( A  +  B )  mod  C ) )
 
22-Oct-2021modqadd1 9311 Addition property of the modulo operation. (Contributed by Jim Kingdon, 22-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  C  e.  QQ )   &    |-  ( ph  ->  D  e.  QQ )   &    |-  ( ph  ->  0  <  D )   &    |-  ( ph  ->  ( A  mod  D )  =  ( B 
 mod  D ) )   =>    |-  ( ph  ->  ( ( A  +  C )  mod  D )  =  ( ( B  +  C )  mod  D ) )
 
21-Oct-2021modqcyc2 9310 The modulo operation is periodic. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  N  e.  ZZ )  /\  ( B  e.  QQ  /\  0  <  B ) )  ->  ( ( A  -  ( B  x.  N ) )  mod  B )  =  ( A  mod  B ) )
 
21-Oct-2021modqcyc 9309 The modulo operation is periodic. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  N  e.  ZZ )  /\  ( B  e.  QQ  /\  0  <  B ) )  ->  ( ( A  +  ( N  x.  B ) )  mod  B )  =  ( A  mod  B ) )
 
21-Oct-2021modqabs2 9308 Absorption law for modulo. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  mod  B )  mod  B )  =  ( A  mod  B ) )
 
21-Oct-2021modqabs 9307 Absorption law for modulo. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ph  ->  A  e.  QQ )   &    |-  ( ph  ->  B  e.  QQ )   &    |-  ( ph  ->  0  <  B )   &    |-  ( ph  ->  C  e.  QQ )   &    |-  ( ph  ->  B 
 <_  C )   =>    |-  ( ph  ->  (
 ( A  mod  B )  mod  C )  =  ( A  mod  B ) )
 
21-Oct-2021q1mod 9306 Special case: 1 modulo a real number greater than 1 is 1. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( N  e.  QQ  /\  1  <  N )  ->  ( 1  mod 
 N )  =  1 )
 
21-Oct-2021q0mod 9305 Special case: 0 modulo a positive real number is 0. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( N  e.  QQ  /\  0  <  N )  ->  ( 0  mod 
 N )  =  0 )
 
21-Oct-2021modqid2 9301 Identity law for modulo. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  mod  B )  =  A  <->  ( 0  <_  A  /\  A  <  B ) ) )
 
21-Oct-2021modqid0 9300 A positive real number modulo itself is 0. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( N  e.  QQ  /\  0  <  N )  ->  ( N  mod  N )  =  0 )
 
21-Oct-2021modqid 9299 Identity law for modulo. (Contributed by Jim Kingdon, 21-Oct-2021.)
 |-  ( ( ( A  e.  QQ  /\  B  e.  QQ )  /\  (
 0  <_  A  /\  A  <  B ) ) 
 ->  ( A  mod  B )  =  A )
 
20-Oct-2021modqvalp1 9293 The value of the modulo operation (expressed with sum of denominator and nominator). (Contributed by Jim Kingdon, 20-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  +  B )  -  (
 ( ( |_ `  ( A  /  B ) )  +  1 )  x.  B ) )  =  ( A  mod  B ) )
 
20-Oct-2021onunsnss 6386 Adding a singleton to create an ordinal. (Contributed by Jim Kingdon, 20-Oct-2021.)
 |-  ( ( B  e.  V  /\  ( A  u.  { B } )  e. 
 On )  ->  B  C_  A )
 
19-Oct-2021snon0 6387 An ordinal which is a singleton is  { (/) }. (Contributed by Jim Kingdon, 19-Oct-2021.)
 |-  ( ( A  e.  V  /\  { A }  e.  On )  ->  A  =  (/) )
 
18-Oct-2021qdencn 10511 The set of complex numbers whose real and imaginary parts are rational is dense in the complex plane. This is a two dimensional analogue to qdenre 10029 (and also would hold for  RR  X.  RR with the usual metric; this is not about complex numbers in particular). (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  Q  =  { z  e.  CC  |  ( ( Re `  z )  e.  QQ  /\  ( Im `  z
 )  e.  QQ ) }   =>    |-  ( ( A  e.  CC  /\  B  e.  RR+ )  ->  E. x  e.  Q  ( abs `  ( x  -  A ) )  <  B )
 
18-Oct-2021modqmulnn 9292 Move a positive integer in and out of a floor in the first argument of a modulo operation. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( N  e.  NN  /\  A  e.  QQ  /\  M  e.  NN )  ->  ( ( N  x.  ( |_ `  A ) )  mod  ( N  x.  M ) ) 
 <_  ( ( |_ `  ( N  x.  A ) ) 
 mod  ( N  x.  M ) ) )
 
18-Oct-2021intqfrac 9289 Break a number into its integer part and its fractional part. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( A  e.  QQ  ->  A  =  ( ( |_ `  A )  +  ( A  mod  1 ) ) )
 
18-Oct-2021flqmod 9288 The floor function expressed in terms of the modulo operation. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( A  e.  QQ  ->  ( |_ `  A )  =  ( A  -  ( A  mod  1
 ) ) )
 
18-Oct-2021modqfrac 9287 The fractional part of a number is the number modulo 1. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( A  e.  QQ  ->  ( A  mod  1
 )  =  ( A  -  ( |_ `  A ) ) )
 
18-Oct-2021modqdifz 9286 The modulo operation differs from 
A by an integer multiple of  B. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  -  ( A  mod  B ) )  /  B )  e.  ZZ )
 
18-Oct-2021modqdiffl 9285 The modulo operation differs from 
A by an integer multiple of  B. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  -  ( A  mod  B ) )  /  B )  =  ( |_ `  ( A  /  B ) ) )
 
18-Oct-2021modqelico 9284 Modular reduction produces a half-open interval. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( A  mod  B )  e.  ( 0 [,) B ) )
 
18-Oct-2021modqlt 9283 The modulo operation is less than its second argument. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( A  mod  B )  <  B )
 
18-Oct-2021modqge0 9282 The modulo operation is nonnegative. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  0  <_  ( A 
 mod  B ) )
 
18-Oct-2021negqmod0 9281  A is divisible by  B iff its negative is. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ  /\  0  <  B ) 
 ->  ( ( A  mod  B )  =  0  <->  ( -u A  mod  B )  =  0 ) )
 
18-Oct-2021mulqmod0 9280 The product of an integer and a positive rational number is 0 modulo the positive real number. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  ZZ  /\  M  e.  QQ  /\  0  <  M ) 
 ->  ( ( A  x.  M )  mod  M )  =  0 )
 
18-Oct-2021flqdiv 9271 Cancellation of the embedded floor of a real divided by an integer. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  ( ( A  e.  QQ  /\  N  e.  NN )  ->  ( |_ `  (
 ( |_ `  A )  /  N ) )  =  ( |_ `  ( A  /  N ) ) )
 
18-Oct-2021intqfrac2 9269 Decompose a real into integer and fractional parts. (Contributed by Jim Kingdon, 18-Oct-2021.)
 |-  Z  =  ( |_ `  A )   &    |-  F  =  ( A  -  Z )   =>    |-  ( A  e.  QQ  ->  ( 0  <_  F  /\  F  <  1  /\  A  =  ( Z  +  F ) ) )

  Copyright terms: Public domain W3C HTML validation [external]