HomeHome Intuitionistic Logic Explorer
Theorem List (p. 61 of 102)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 6001-6100   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Definitiondf-1o 6001 Define the ordinal number 1. (Contributed by NM, 29-Oct-1995.)
 |- 
 1o  =  suc  (/)
 
Definitiondf-2o 6002 Define the ordinal number 2. (Contributed by NM, 18-Feb-2004.)
 |- 
 2o  =  suc  1o
 
Definitiondf-3o 6003 Define the ordinal number 3. (Contributed by Mario Carneiro, 14-Jul-2013.)
 |- 
 3o  =  suc  2o
 
Definitiondf-4o 6004 Define the ordinal number 4. (Contributed by Mario Carneiro, 14-Jul-2013.)
 |- 
 4o  =  suc  3o
 
Definitiondf-oadd 6005* Define the ordinal addition operation. (Contributed by NM, 3-May-1995.)
 |- 
 +o  =  ( x  e.  On ,  y  e.  On  |->  ( rec (
 ( z  e.  _V  |->  suc  z ) ,  x ) `  y ) )
 
Definitiondf-omul 6006* Define the ordinal multiplication operation. (Contributed by NM, 26-Aug-1995.)
 |- 
 .o  =  ( x  e.  On ,  y  e.  On  |->  ( rec (
 ( z  e.  _V  |->  ( z  +o  x ) ) ,  (/) ) `  y ) )
 
Definitiondf-oexpi 6007* Define the ordinal exponentiation operation.

This definition is similar to a conventional definition of exponentiation except that it defines  (/)𝑜  A to be  1o for all  A  e.  On, in order to avoid having different cases for whether the base is  (/) or not. (Contributed by Mario Carneiro, 4-Jul-2019.)

 |-𝑜  =  ( x  e.  On ,  y  e.  On  |->  ( rec ( ( z  e.  _V  |->  ( z  .o  x ) ) ,  1o ) `  y ) )
 
Theorem1on 6008 Ordinal 1 is an ordinal number. (Contributed by NM, 29-Oct-1995.)
 |- 
 1o  e.  On
 
Theorem2on 6009 Ordinal 2 is an ordinal number. (Contributed by NM, 18-Feb-2004.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
 |- 
 2o  e.  On
 
Theorem2on0 6010 Ordinal two is not zero. (Contributed by Scott Fenton, 17-Jun-2011.)
 |- 
 2o  =/=  (/)
 
Theorem3on 6011 Ordinal 3 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 3o  e.  On
 
Theorem4on 6012 Ordinal 3 is an ordinal number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 4o  e.  On
 
Theoremdf1o2 6013 Expanded value of the ordinal number 1. (Contributed by NM, 4-Nov-2002.)
 |- 
 1o  =  { (/) }
 
Theoremdf2o3 6014 Expanded value of the ordinal number 2. (Contributed by Mario Carneiro, 14-Aug-2015.)
 |- 
 2o  =  { (/) ,  1o }
 
Theoremdf2o2 6015 Expanded value of the ordinal number 2. (Contributed by NM, 29-Jan-2004.)
 |- 
 2o  =  { (/) ,  { (/)
 } }
 
Theorem1n0 6016 Ordinal one is not equal to ordinal zero. (Contributed by NM, 26-Dec-2004.)
 |- 
 1o  =/=  (/)
 
Theoremxp01disj 6017 Cartesian products with the singletons of ordinals 0 and 1 are disjoint. (Contributed by NM, 2-Jun-2007.)
 |-  ( ( A  X.  { (/) } )  i^i  ( C  X.  { 1o }
 ) )  =  (/)
 
Theoremordgt0ge1 6018 Two ways to express that an ordinal class is positive. (Contributed by NM, 21-Dec-2004.)
 |-  ( Ord  A  ->  ( (/)  e.  A  <->  1o  C_  A ) )
 
Theoremordge1n0im 6019 An ordinal greater than or equal to 1 is nonzero. (Contributed by Jim Kingdon, 26-Jun-2019.)
 |-  ( Ord  A  ->  ( 1o  C_  A  ->  A  =/=  (/) ) )
 
Theoremel1o 6020 Membership in ordinal one. (Contributed by NM, 5-Jan-2005.)
 |-  ( A  e.  1o  <->  A  =  (/) )
 
Theoremdif1o 6021 Two ways to say that  A is a nonzero number of the set  B. (Contributed by Mario Carneiro, 21-May-2015.)
 |-  ( A  e.  ( B  \  1o )  <->  ( A  e.  B  /\  A  =/=  (/) ) )
 
Theorem2oconcl 6022 Closure of the pair swapping function on  2o. (Contributed by Mario Carneiro, 27-Sep-2015.)
 |-  ( A  e.  2o  ->  ( 1o  \  A )  e.  2o )
 
Theorem0lt1o 6023 Ordinal zero is less than ordinal one. (Contributed by NM, 5-Jan-2005.)
 |-  (/)  e.  1o
 
Theoremoafnex 6024 The characteristic function for ordinal addition is defined everywhere. (Contributed by Jim Kingdon, 27-Jul-2019.)
 |-  ( x  e.  _V  |->  suc  x )  Fn  _V
 
Theoremsucinc 6025* Successor is increasing. (Contributed by Jim Kingdon, 25-Jun-2019.)
 |-  F  =  ( z  e.  _V  |->  suc  z
 )   =>    |- 
 A. x  x  C_  ( F `  x )
 
Theoremsucinc2 6026* Successor is increasing. (Contributed by Jim Kingdon, 14-Jul-2019.)
 |-  F  =  ( z  e.  _V  |->  suc  z
 )   =>    |-  ( ( B  e.  On  /\  A  e.  B )  ->  ( F `  A )  C_  ( F `
  B ) )
 
Theoremfnoa 6027 Functionality and domain of ordinal addition. (Contributed by NM, 26-Aug-1995.) (Proof shortened by Mario Carneiro, 3-Jul-2019.)
 |- 
 +o  Fn  ( On  X. 
 On )
 
Theoremoaexg 6028 Ordinal addition is a set. (Contributed by Mario Carneiro, 3-Jul-2019.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  +o  B )  e.  _V )
 
Theoremomfnex 6029* The characteristic function for ordinal multiplication is defined everywhere. (Contributed by Jim Kingdon, 23-Aug-2019.)
 |-  ( A  e.  V  ->  ( x  e.  _V  |->  ( x  +o  A ) )  Fn  _V )
 
Theoremfnom 6030 Functionality and domain of ordinal multiplication. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 3-Jul-2019.)
 |- 
 .o  Fn  ( On  X. 
 On )
 
Theoremomexg 6031 Ordinal multiplication is a set. (Contributed by Mario Carneiro, 3-Jul-2019.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A  .o  B )  e.  _V )
 
Theoremfnoei 6032 Functionality and domain of ordinal exponentiation. (Contributed by Mario Carneiro, 29-May-2015.) (Revised by Mario Carneiro, 3-Jul-2019.)
 |-𝑜  Fn  ( On  X.  On )
 
Theoremoeiexg 6033 Ordinal exponentiation is a set. (Contributed by Mario Carneiro, 3-Jul-2019.)
 |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A𝑜  B )  e.  _V )
 
Theoremoav 6034* Value of ordinal addition. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B )  =  ( rec ( ( x  e. 
 _V  |->  suc  x ) ,  A ) `  B ) )
 
Theoremomv 6035* Value of ordinal multiplication. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B )  =  ( rec ( ( x  e. 
 _V  |->  ( x  +o  A ) ) ,  (/) ) `  B ) )
 
Theoremoeiv 6036* Value of ordinal exponentiation. (Contributed by Jim Kingdon, 9-Jul-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A𝑜  B )  =  ( rec ( ( x  e.  _V  |->  ( x  .o  A ) ) ,  1o ) `  B ) )
 
Theoremoa0 6037 Addition with zero. Proposition 8.3 of [TakeutiZaring] p. 57. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( A  e.  On  ->  ( A  +o  (/) )  =  A )
 
Theoremom0 6038 Ordinal multiplication with zero. Definition 8.15 of [TakeutiZaring] p. 62. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( A  e.  On  ->  ( A  .o  (/) )  =  (/) )
 
Theoremoei0 6039 Ordinal exponentiation with zero exponent. Definition 8.30 of [TakeutiZaring] p. 67. (Contributed by NM, 31-Dec-2004.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( A  e.  On  ->  ( A𝑜 
 (/) )  =  1o )
 
Theoremoacl 6040 Closure law for ordinal addition. Proposition 8.2 of [TakeutiZaring] p. 57. (Contributed by NM, 5-May-1995.) (Constructive proof by Jim Kingdon, 26-Jul-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B )  e.  On )
 
Theoremomcl 6041 Closure law for ordinal multiplication. Proposition 8.16 of [TakeutiZaring] p. 57. (Contributed by NM, 3-Aug-2004.) (Constructive proof by Jim Kingdon, 26-Jul-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B )  e.  On )
 
Theoremoeicl 6042 Closure law for ordinal exponentiation. (Contributed by Jim Kingdon, 26-Jul-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A𝑜  B )  e.  On )
 
Theoremoav2 6043* Value of ordinal addition. (Contributed by Mario Carneiro and Jim Kingdon, 12-Aug-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B )  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
 
Theoremoasuc 6044 Addition with successor. Definition 8.1 of [TakeutiZaring] p. 56. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc 
 B )  =  suc  ( A  +o  B ) )
 
Theoremomv2 6045* Value of ordinal multiplication. (Contributed by Jim Kingdon, 23-Aug-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B )  =  U_ x  e.  B  ( ( A  .o  x )  +o  A ) )
 
Theoremonasuc 6046 Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Contributed by Mario Carneiro, 16-Nov-2014.)
 |-  ( ( A  e.  On  /\  B  e.  om )  ->  ( A  +o  suc 
 B )  =  suc  ( A  +o  B ) )
 
Theoremoa1suc 6047 Addition with 1 is same as successor. Proposition 4.34(a) of [Mendelson] p. 266. (Contributed by NM, 29-Oct-1995.) (Revised by Mario Carneiro, 16-Nov-2014.)
 |-  ( A  e.  On  ->  ( A  +o  1o )  =  suc  A )
 
Theoremo1p1e2 6048 1 + 1 = 2 for ordinal numbers. (Contributed by NM, 18-Feb-2004.)
 |-  ( 1o  +o  1o )  =  2o
 
Theoremoawordi 6049 Weak ordering property of ordinal addition. (Contributed by Jim Kingdon, 27-Jul-2019.)
 |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  C_  B  ->  ( C  +o  A )  C_  ( C  +o  B ) ) )
 
Theoremoaword1 6050 An ordinal is less than or equal to its sum with another. Part of Exercise 5 of [TakeutiZaring] p. 62. (Contributed by NM, 6-Dec-2004.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  A  C_  ( A  +o  B ) )
 
Theoremomsuc 6051 Multiplication with successor. Definition 8.15 of [TakeutiZaring] p. 62. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
 |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  suc 
 B )  =  ( ( A  .o  B )  +o  A ) )
 
Theoremonmsuc 6052 Multiplication with successor. Theorem 4J(A2) of [Enderton] p. 80. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
 |-  ( ( A  e.  On  /\  B  e.  om )  ->  ( A  .o  suc 
 B )  =  ( ( A  .o  B )  +o  A ) )
 
2.6.23  Natural number arithmetic
 
Theoremnna0 6053 Addition with zero. Theorem 4I(A1) of [Enderton] p. 79. (Contributed by NM, 20-Sep-1995.)
 |-  ( A  e.  om  ->  ( A  +o  (/) )  =  A )
 
Theoremnnm0 6054 Multiplication with zero. Theorem 4J(A1) of [Enderton] p. 80. (Contributed by NM, 20-Sep-1995.)
 |-  ( A  e.  om  ->  ( A  .o  (/) )  =  (/) )
 
Theoremnnasuc 6055 Addition with successor. Theorem 4I(A2) of [Enderton] p. 79. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  +o  suc 
 B )  =  suc  ( A  +o  B ) )
 
Theoremnnmsuc 6056 Multiplication with successor. Theorem 4J(A2) of [Enderton] p. 80. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  .o  suc 
 B )  =  ( ( A  .o  B )  +o  A ) )
 
Theoremnna0r 6057 Addition to zero. Remark in proof of Theorem 4K(2) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
 |-  ( A  e.  om  ->  ( (/)  +o  A )  =  A )
 
Theoremnnm0r 6058 Multiplication with zero. Exercise 16 of [Enderton] p. 82. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( A  e.  om  ->  ( (/)  .o  A )  =  (/) )
 
Theoremnnacl 6059 Closure of addition of natural numbers. Proposition 8.9 of [TakeutiZaring] p. 59. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  +o  B )  e.  om )
 
Theoremnnmcl 6060 Closure of multiplication of natural numbers. Proposition 8.17 of [TakeutiZaring] p. 63. (Contributed by NM, 20-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  .o  B )  e.  om )
 
Theoremnnacli 6061  om is closed under addition. Inference form of nnacl 6059. (Contributed by Scott Fenton, 20-Apr-2012.)
 |-  A  e.  om   &    |-  B  e.  om   =>    |-  ( A  +o  B )  e.  om
 
Theoremnnmcli 6062  om is closed under multiplication. Inference form of nnmcl 6060. (Contributed by Scott Fenton, 20-Apr-2012.)
 |-  A  e.  om   &    |-  B  e.  om   =>    |-  ( A  .o  B )  e.  om
 
Theoremnnacom 6063 Addition of natural numbers is commutative. Theorem 4K(2) of [Enderton] p. 81. (Contributed by NM, 6-May-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  +o  B )  =  ( B  +o  A ) )
 
Theoremnnaass 6064 Addition of natural numbers is associative. Theorem 4K(1) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( ( A  +o  B )  +o  C )  =  ( A  +o  ( B  +o  C ) ) )
 
Theoremnndi 6065 Distributive law for natural numbers (left-distributivity). Theorem 4K(3) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( A  .o  ( B  +o  C ) )  =  ( ( A  .o  B )  +o  ( A  .o  C ) ) )
 
Theoremnnmass 6066 Multiplication of natural numbers is associative. Theorem 4K(4) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( ( A  .o  B )  .o  C )  =  ( A  .o  ( B  .o  C ) ) )
 
Theoremnnmsucr 6067 Multiplication with successor. Exercise 16 of [Enderton] p. 82. (Contributed by NM, 21-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( suc  A  .o  B )  =  ( ( A  .o  B )  +o  B ) )
 
Theoremnnmcom 6068 Multiplication of natural numbers is commutative. Theorem 4K(5) of [Enderton] p. 81. (Contributed by NM, 21-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  .o  B )  =  ( B  .o  A ) )
 
Theoremnndir 6069 Distributive law for natural numbers (right-distributivity). (Contributed by Jim Kingdon, 3-Dec-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( ( A  +o  B )  .o  C )  =  ( ( A  .o  C )  +o  ( B  .o  C ) ) )
 
Theoremnnsucelsuc 6070 Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4234, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4255. (Contributed by Jim Kingdon, 25-Aug-2019.)
 |-  ( B  e.  om  ->  ( A  e.  B  <->  suc 
 A  e.  suc  B ) )
 
Theoremnnsucsssuc 6071 Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucsssucr 4235, but the forward direction, for all ordinals, implies excluded middle as seen as onsucsssucexmid 4252. (Contributed by Jim Kingdon, 25-Aug-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  C_  B 
 <-> 
 suc  A  C_  suc  B ) )
 
Theoremnntri3or 6072 Trichotomy for natural numbers. (Contributed by Jim Kingdon, 25-Aug-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A ) )
 
Theoremnntri2 6073 A trichotomy law for natural numbers. (Contributed by Jim Kingdon, 28-Aug-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  e.  B 
 <->  -.  ( A  =  B  \/  B  e.  A ) ) )
 
Theoremnntri1 6074 A trichotomy law for natural numbers. (Contributed by Jim Kingdon, 28-Aug-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  C_  B 
 <->  -.  B  e.  A ) )
 
Theoremnntri3 6075 A trichotomy law for natural numbers. (Contributed by Jim Kingdon, 15-May-2020.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  =  B 
 <->  ( -.  A  e.  B  /\  -.  B  e.  A ) ) )
 
Theoremnntri2or2 6076 A trichotomy law for natural numbers. (Contributed by Jim Kingdon, 15-Sep-2021.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  C_  B  \/  B  C_  A ) )
 
Theoremnndceq 6077 Equality of natural numbers is decidable. Theorem 7.2.6 of [HoTT], p. (varies). For the specific case where  B is zero, see nndceq0 4339. (Contributed by Jim Kingdon, 31-Aug-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  -> DECID  A  =  B )
 
Theoremnndcel 6078 Set membership between two natural numbers is decidable. (Contributed by Jim Kingdon, 6-Sep-2019.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  -> DECID  A  e.  B )
 
Theoremnnsseleq 6079 For natural numbers, inclusion is equivalent to membership or equality. (Contributed by Jim Kingdon, 16-Sep-2021.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  C_  B 
 <->  ( A  e.  B  \/  A  =  B ) ) )
 
Theoremnndifsnid 6080 If we remove a single element from a natural number then put it back in, we end up with the original natural number. This strengthens difsnss 3510 from subset to equality but the proof relies on equality being decidable. (Contributed by Jim Kingdon, 31-Aug-2021.)
 |-  ( ( A  e.  om 
 /\  B  e.  A )  ->  ( ( A 
 \  { B }
 )  u.  { B } )  =  A )
 
Theoremnnaordi 6081 Ordering property of addition. Proposition 8.4 of [TakeutiZaring] p. 58, limited to natural numbers. (Contributed by NM, 3-Feb-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( B  e.  om 
 /\  C  e.  om )  ->  ( A  e.  B  ->  ( C  +o  A )  e.  ( C  +o  B ) ) )
 
Theoremnnaord 6082 Ordering property of addition. Proposition 8.4 of [TakeutiZaring] p. 58, limited to natural numbers, and its converse. (Contributed by NM, 7-Mar-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( A  e.  B  <->  ( C  +o  A )  e.  ( C  +o  B ) ) )
 
Theoremnnaordr 6083 Ordering property of addition of natural numbers. (Contributed by NM, 9-Nov-2002.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( A  e.  B  <->  ( A  +o  C )  e.  ( B  +o  C ) ) )
 
Theoremnnaword 6084 Weak ordering property of addition. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( A  C_  B  <->  ( C  +o  A ) 
 C_  ( C  +o  B ) ) )
 
Theoremnnacan 6085 Cancellation law for addition of natural numbers. (Contributed by NM, 27-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( ( A  +o  B )  =  ( A  +o  C )  <->  B  =  C ) )
 
Theoremnnaword1 6086 Weak ordering property of addition. (Contributed by NM, 9-Nov-2002.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  A  C_  ( A  +o  B ) )
 
Theoremnnaword2 6087 Weak ordering property of addition. (Contributed by NM, 9-Nov-2002.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  A  C_  ( B  +o  A ) )
 
Theoremnnawordi 6088 Adding to both sides of an inequality in  om (Contributed by Scott Fenton, 16-Apr-2012.) (Revised by Mario Carneiro, 12-May-2012.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( A  C_  B  ->  ( A  +o  C )  C_  ( B  +o  C ) ) )
 
Theoremnnmordi 6089 Ordering property of multiplication. Half of Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers. (Contributed by NM, 18-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( ( B  e.  om  /\  C  e.  om )  /\  (/)  e.  C )  ->  ( A  e.  B  ->  ( C  .o  A )  e.  ( C  .o  B ) ) )
 
Theoremnnmord 6090 Ordering property of multiplication. Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers. (Contributed by NM, 22-Jan-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om  /\  C  e.  om )  ->  ( ( A  e.  B  /\  (/)  e.  C )  <-> 
 ( C  .o  A )  e.  ( C  .o  B ) ) )
 
Theoremnnmword 6091 Weak ordering property of ordinal multiplication. (Contributed by Mario Carneiro, 17-Nov-2014.)
 |-  ( ( ( A  e.  om  /\  B  e.  om  /\  C  e.  om )  /\  (/)  e.  C )  ->  ( A  C_  B 
 <->  ( C  .o  A )  C_  ( C  .o  B ) ) )
 
Theoremnnmcan 6092 Cancellation law for multiplication of natural numbers. (Contributed by NM, 26-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( ( A  e.  om  /\  B  e.  om  /\  C  e.  om )  /\  (/)  e.  A )  ->  ( ( A  .o  B )  =  ( A  .o  C ) 
 <->  B  =  C ) )
 
Theorem1onn 6093 One is a natural number. (Contributed by NM, 29-Oct-1995.)
 |- 
 1o  e.  om
 
Theorem2onn 6094 The ordinal 2 is a natural number. (Contributed by NM, 28-Sep-2004.)
 |- 
 2o  e.  om
 
Theorem3onn 6095 The ordinal 3 is a natural number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 3o  e.  om
 
Theorem4onn 6096 The ordinal 4 is a natural number. (Contributed by Mario Carneiro, 5-Jan-2016.)
 |- 
 4o  e.  om
 
Theoremnnm1 6097 Multiply an element of  om by  1o. (Contributed by Mario Carneiro, 17-Nov-2014.)
 |-  ( A  e.  om  ->  ( A  .o  1o )  =  A )
 
Theoremnnm2 6098 Multiply an element of  om by  2o (Contributed by Scott Fenton, 18-Apr-2012.) (Revised by Mario Carneiro, 17-Nov-2014.)
 |-  ( A  e.  om  ->  ( A  .o  2o )  =  ( A  +o  A ) )
 
Theoremnn2m 6099 Multiply an element of  om by  2o (Contributed by Scott Fenton, 16-Apr-2012.) (Revised by Mario Carneiro, 17-Nov-2014.)
 |-  ( A  e.  om  ->  ( 2o  .o  A )  =  ( A  +o  A ) )
 
Theoremnnaordex 6100* Equivalence for ordering. Compare Exercise 23 of [Enderton] p. 88. (Contributed by NM, 5-Dec-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
 |-  ( ( A  e.  om 
 /\  B  e.  om )  ->  ( A  e.  B 
 <-> 
 E. x  e.  om  ( (/)  e.  x  /\  ( A  +o  x )  =  B )
 ) )
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10124
  Copyright terms: Public domain < Previous  Next >