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 14-Apr-2025 at 6:35 AM ET.
Recent Additions to the Intuitionistic Logic Explorer
DateLabelDescription
Theorem
 
10-Apr-2025cndcap 14846 Real number trichotomy is equivalent to decidability of complex number apartness. (Contributed by Jim Kingdon, 10-Apr-2025.)
 |-  ( A. x  e.  RR  A. y  e.  RR  ( x  <  y  \/  x  =  y  \/  y  <  x )  <->  A. z  e.  CC  A. w  e.  CC DECID  z #  w )
 
20-Mar-2025ccoslid 12692 Slot property of comp. (Contributed by Jim Kingdon, 20-Mar-2025.)
 |-  (comp  = Slot  (comp `  ndx )  /\  (comp `  ndx )  e.  NN )
 
20-Mar-2025homslid 12690 Slot property of  Hom. (Contributed by Jim Kingdon, 20-Mar-2025.)
 |-  ( Hom  = Slot  ( Hom  `  ndx )  /\  ( Hom  `  ndx )  e. 
 NN )
 
19-Mar-2025ptex 12718 Existence of the product topology. (Contributed by Jim Kingdon, 19-Mar-2025.)
 |-  ( F  e.  V  ->  ( Xt_ `  F )  e.  _V )
 
18-Mar-2025prdsex 12723 Existence of the structure product. (Contributed by Jim Kingdon, 18-Mar-2025.)
 |-  ( ( S  e.  V  /\  R  e.  W )  ->  ( S X_s R )  e.  _V )
 
13-Mar-2025imasex 12731 Existence of the image structure. (Contributed by Jim Kingdon, 13-Mar-2025.)
 |-  ( ( F  e.  V  /\  R  e.  W )  ->  ( F  "s  R )  e.  _V )
 
11-Mar-2025imasival 12732 Value of an image structure. The is a lemma for the theorems imasbas 12733, imasplusg 12734, and imasmulr 12735 and should not be needed once they are proved. (Contributed by Mario Carneiro, 23-Feb-2015.) (Revised by Jim Kingdon, 11-Mar-2025.) (New usage is discouraged.)
 |-  ( ph  ->  U  =  ( F  "s  R )
 )   &    |-  ( ph  ->  V  =  ( Base `  R )
 )   &    |- 
 .+  =  ( +g  `  R )   &    |-  .X.  =  ( .r `  R )   &    |-  .x.  =  ( .s `  R )   &    |-  ( ph  ->  .+b  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `
  p ) ,  ( F `  q
 ) >. ,  ( F `
  ( p  .+  q ) ) >. } )   &    |-  ( ph  ->  .xb 
 =  U_ p  e.  V  U_ q  e.  V  { <.
 <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p  .X.  q ) ) >. } )   &    |-  ( ph  ->  F : V -onto-> B )   &    |-  ( ph  ->  R  e.  Z )   =>    |-  ( ph  ->  U  =  { <. ( Base `  ndx ) ,  B >. , 
 <. ( +g  `  ndx ) ,  .+b  >. ,  <. ( .r `  ndx ) ,  .xb  >. } )
 
8-Mar-2025subgex 13041 The class of subgroups of a group is a set. (Contributed by Jim Kingdon, 8-Mar-2025.)
 |-  ( G  e.  Grp  ->  (SubGrp `  G )  e. 
 _V )
 
28-Feb-2025ringressid 13243 A ring restricted to its base set is a ring. It will usually be the original ring exactly, of course, but to show that needs additional conditions such as those in strressid 12532. (Contributed by Jim Kingdon, 28-Feb-2025.)
 |-  B  =  ( Base `  G )   =>    |-  ( G  e.  Ring  ->  ( Gs  B )  e.  Ring )
 
28-Feb-2025grpressid 12936 A group restricted to its base set is a group. It will usually be the original group exactly, of course, but to show that needs additional conditions such as those in strressid 12532. (Contributed by Jim Kingdon, 28-Feb-2025.)
 |-  B  =  ( Base `  G )   =>    |-  ( G  e.  Grp  ->  ( Gs  B )  e.  Grp )
 
26-Feb-2025strext 12566 Extending the upper range of a structure. This works because when we say that a structure has components in  A ... C we are not saying that every slot in that range is present, just that all the slots that are present are within that range. (Contributed by Jim Kingdon, 26-Feb-2025.)
 |-  ( ph  ->  F Struct  <. A ,  B >. )   &    |-  ( ph  ->  C  e.  ( ZZ>= `  B )
 )   =>    |-  ( ph  ->  F Struct  <. A ,  C >. )
 
23-Feb-2025ltlenmkv 14857 If  < can be expressed as holding exactly when 
<_ holds and the values are not equal, then the analytic Markov's Principle applies. (To get the regular Markov's Principle, combine with neapmkv 14855). (Contributed by Jim Kingdon, 23-Feb-2025.)
 |-  ( A. x  e.  RR  A. y  e.  RR  ( x  <  y  <->  ( x  <_  y  /\  y  =/=  x ) )  ->  A. x  e.  RR  A. y  e. 
 RR  ( x  =/=  y  ->  x #  y
 ) )
 
23-Feb-2025neap0mkv 14856 The analytic Markov principle can be expressed either with two arbitrary real numbers, or one arbitrary number and zero. (Contributed by Jim Kingdon, 23-Feb-2025.)
 |-  ( A. x  e.  RR  A. y  e.  RR  ( x  =/=  y  ->  x #  y )  <->  A. x  e.  RR  ( x  =/=  0  ->  x #  0 ) )
 
23-Feb-2025lringuplu 13342 If the sum of two elements of a local ring is invertible, then at least one of the summands must be invertible. (Contributed by Jim Kingdon, 18-Feb-2025.) (Revised by SN, 23-Feb-2025.)
 |-  ( ph  ->  B  =  ( Base `  R )
 )   &    |-  ( ph  ->  U  =  (Unit `  R )
 )   &    |-  ( ph  ->  .+  =  ( +g  `  R )
 )   &    |-  ( ph  ->  R  e. LRing )   &    |-  ( ph  ->  ( X  .+  Y )  e.  U )   &    |-  ( ph  ->  X  e.  B )   &    |-  ( ph  ->  Y  e.  B )   =>    |-  ( ph  ->  ( X  e.  U  \/  Y  e.  U )
 )
 
23-Feb-2025lringnz 13341 A local ring is a nonzero ring. (Contributed by Jim Kingdon, 20-Feb-2025.) (Revised by SN, 23-Feb-2025.)
 |- 
 .1.  =  ( 1r `  R )   &    |-  .0.  =  ( 0g `  R )   =>    |-  ( R  e. LRing  ->  .1.  =/=  .0.  )
 
23-Feb-2025lringring 13340 A local ring is a ring. (Contributed by Jim Kingdon, 20-Feb-2025.) (Revised by SN, 23-Feb-2025.)
 |-  ( R  e. LRing  ->  R  e.  Ring )
 
23-Feb-2025lringnzr 13339 A local ring is a nonzero ring. (Contributed by SN, 23-Feb-2025.)
 |-  ( R  e. LRing  ->  R  e. NzRing )
 
23-Feb-2025islring 13338 The predicate "is a local ring". (Contributed by SN, 23-Feb-2025.)
 |-  B  =  ( Base `  R )   &    |-  .+  =  ( +g  `  R )   &    |-  .1.  =  ( 1r `  R )   &    |-  U  =  (Unit `  R )   =>    |-  ( R  e. LRing  <->  ( R  e. NzRing  /\ 
 A. x  e.  B  A. y  e.  B  ( ( x  .+  y
 )  =  .1.  ->  ( x  e.  U  \/  y  e.  U )
 ) ) )
 
23-Feb-2025df-lring 13337 A local ring is a nonzero ring where for any two elements summing to one, at least one is invertible. Any field is a local ring; the ring of integers is an example of a ring which is not a local ring. (Contributed by Jim Kingdon, 18-Feb-2025.) (Revised by SN, 23-Feb-2025.)
 |- LRing  =  { r  e. NzRing  |  A. x  e.  ( Base `  r ) A. y  e.  ( Base `  r )
 ( ( x (
 +g  `  r )
 y )  =  ( 1r `  r ) 
 ->  ( x  e.  (Unit `  r )  \/  y  e.  (Unit `  r )
 ) ) }
 
23-Feb-202501eq0ring 13335 If the zero and the identity element of a ring are the same, the ring is the zero ring. (Contributed by AV, 16-Apr-2019.) (Proof shortened by SN, 23-Feb-2025.)
 |-  B  =  ( Base `  R )   &    |-  .0.  =  ( 0g `  R )   &    |-  .1.  =  ( 1r `  R )   =>    |-  ( ( R  e.  Ring  /\  .0.  =  .1.  )  ->  B  =  {  .0.  } )
 
23-Feb-2025nzrring 13332 A nonzero ring is a ring. (Contributed by Stefan O'Rear, 24-Feb-2015.) (Proof shortened by SN, 23-Feb-2025.)
 |-  ( R  e. NzRing  ->  R  e.  Ring )
 
21-Feb-2025dftap2 7252 Tight apartness with the apartness properties from df-pap 7249 expanded. (Contributed by Jim Kingdon, 21-Feb-2025.)
 |-  ( R TAp  A  <->  ( R  C_  ( A  X.  A ) 
 /\  ( A. x  e.  A  -.  x R x  /\  A. x  e.  A  A. y  e.  A  ( x R y  ->  y R x ) )  /\  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  y R z ) ) 
 /\  A. x  e.  A  A. y  e.  A  ( -.  x R y 
 ->  x  =  y
 ) ) ) )
 
20-Feb-2025aprap 13381 The relation given by df-apr 13376 for a local ring is an apartness relation. (Contributed by Jim Kingdon, 20-Feb-2025.)
 |-  ( R  e. LRing  ->  (#r `  R ) Ap  ( Base `  R ) )
 
20-Feb-2025setscomd 12505 Different components can be set in any order. (Contributed by Jim Kingdon, 20-Feb-2025.)
 |-  ( ph  ->  A  e.  Y )   &    |-  ( ph  ->  B  e.  Z )   &    |-  ( ph  ->  S  e.  V )   &    |-  ( ph  ->  A  =/=  B )   &    |-  ( ph  ->  C  e.  W )   &    |-  ( ph  ->  D  e.  X )   =>    |-  ( ph  ->  (
 ( S sSet  <. A ,  C >. ) sSet  <. B ,  D >. )  =  ( ( S sSet  <. B ,  D >. ) sSet  <. A ,  C >. ) )
 
17-Feb-2025aprcotr 13380 The apartness relation given by df-apr 13376 for a local ring is cotransitive. (Contributed by Jim Kingdon, 17-Feb-2025.)
 |-  ( ph  ->  B  =  ( Base `  R )
 )   &    |-  ( ph  -> #  =  (#r `  R ) )   &    |-  ( ph  ->  R  e. LRing )   &    |-  ( ph  ->  X  e.  B )   &    |-  ( ph  ->  Y  e.  B )   &    |-  ( ph  ->  Z  e.  B )   =>    |-  ( ph  ->  ( X #  Y  ->  ( X #  Z  \/  Y #  Z ) ) )
 
17-Feb-2025aprsym 13379 The apartness relation given by df-apr 13376 for a ring is symmetric. (Contributed by Jim Kingdon, 17-Feb-2025.)
 |-  ( ph  ->  B  =  ( Base `  R )
 )   &    |-  ( ph  -> #  =  (#r `  R ) )   &    |-  ( ph  ->  R  e.  Ring )   &    |-  ( ph  ->  X  e.  B )   &    |-  ( ph  ->  Y  e.  B )   =>    |-  ( ph  ->  ( X #  Y  ->  Y #  X ) )
 
17-Feb-2025aprval 13377 Expand Definition df-apr 13376. (Contributed by Jim Kingdon, 17-Feb-2025.)
 |-  ( ph  ->  B  =  ( Base `  R )
 )   &    |-  ( ph  -> #  =  (#r `  R ) )   &    |-  ( ph  ->  .-  =  ( -g `  R ) )   &    |-  ( ph  ->  U  =  (Unit `  R ) )   &    |-  ( ph  ->  R  e.  Ring
 )   &    |-  ( ph  ->  X  e.  B )   &    |-  ( ph  ->  Y  e.  B )   =>    |-  ( ph  ->  ( X #  Y  <->  ( X  .-  Y )  e.  U ) )
 
16-Feb-2025aprirr 13378 The apartness relation given by df-apr 13376 for a nonzero ring is irreflexive. (Contributed by Jim Kingdon, 16-Feb-2025.)
 |-  ( ph  ->  B  =  ( Base `  R )
 )   &    |-  ( ph  -> #  =  (#r `  R ) )   &    |-  ( ph  ->  R  e.  Ring )   &    |-  ( ph  ->  X  e.  B )   &    |-  ( ph  ->  ( 1r `  R )  =/=  ( 0g `  R ) )   =>    |-  ( ph  ->  -.  X #  X )
 
16-Feb-2025aptap 8609 Complex apartness (as defined at df-ap 8541) is a tight apartness (as defined at df-tap 7251). (Contributed by Jim Kingdon, 16-Feb-2025.)
 |- # TAp  CC
 
15-Feb-2025tapeq2 7254 Equality theorem for tight apartness predicate. (Contributed by Jim Kingdon, 15-Feb-2025.)
 |-  ( A  =  B  ->  ( R TAp  A  <->  R TAp  B )
 )
 
14-Feb-2025exmidmotap 7262 The proposition that every class has at most one tight apartness is equivalent to excluded middle. (Contributed by Jim Kingdon, 14-Feb-2025.)
 |-  (EXMID  <->  A. x E* r  r TAp 
 x )
 
14-Feb-2025exmidapne 7261 Excluded middle implies there is only one tight apartness on any class, namely negated equality. (Contributed by Jim Kingdon, 14-Feb-2025.)
 |-  (EXMID 
 ->  ( R TAp  A  <->  R  =  { <. u ,  v >.  |  ( ( u  e.  A  /\  v  e.  A )  /\  u  =/=  v ) } )
 )
 
14-Feb-2025df-pap 7249 Apartness predicate. A relation  R is an apartness if it is irreflexive, symmetric, and cotransitive. (Contributed by Jim Kingdon, 14-Feb-2025.)
 |-  ( R Ap  A  <->  ( ( R 
 C_  ( A  X.  A )  /\  A. x  e.  A  -.  x R x )  /\  ( A. x  e.  A  A. y  e.  A  ( x R y  ->  y R x )  /\  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  y R z ) ) ) ) )
 
13-Feb-2025df-apr 13376 The relation between elements whose difference is invertible, which for a local ring is an apartness relation by aprap 13381. (Contributed by Jim Kingdon, 13-Feb-2025.)
 |- #r  =  ( w  e.  _V  |->  {
 <. x ,  y >.  |  ( ( x  e.  ( Base `  w )  /\  y  e.  ( Base `  w ) ) 
 /\  ( x (
 -g `  w )
 y )  e.  (Unit `  w ) ) }
 )
 
8-Feb-20252oneel 7257  (/) and  1o are two unequal elements of  2o. (Contributed by Jim Kingdon, 8-Feb-2025.)
 |- 
 <. (/) ,  1o >.  e. 
 { <. u ,  v >.  |  ( ( u  e.  2o  /\  v  e.  2o )  /\  u  =/=  v ) }
 
8-Feb-2025tapeq1 7253 Equality theorem for tight apartness predicate. (Contributed by Jim Kingdon, 8-Feb-2025.)
 |-  ( R  =  S  ->  ( R TAp  A  <->  S TAp  A )
 )
 
6-Feb-20252omotap 7260 If there is at most one tight apartness on  2o, excluded middle follows. Based on online discussions by Tom de Jong, Andrew W Swan, and Martin Escardo. (Contributed by Jim Kingdon, 6-Feb-2025.)
 |-  ( E* r  r TAp 
 2o  -> EXMID
 )
 
6-Feb-20252omotaplemst 7259 Lemma for 2omotap 7260. (Contributed by Jim Kingdon, 6-Feb-2025.)
 |-  ( ( E* r  r TAp  2o  /\  -.  -.  ph )  ->  ph )
 
6-Feb-20252omotaplemap 7258 Lemma for 2omotap 7260. (Contributed by Jim Kingdon, 6-Feb-2025.)
 |-  ( -.  -.  ph  ->  { <. u ,  v >.  |  ( ( u  e.  2o  /\  v  e.  2o )  /\  ( ph  /\  u  =/=  v
 ) ) } TAp  2o )
 
6-Feb-20252onetap 7256 Negated equality is a tight apartness on  2o. (Contributed by Jim Kingdon, 6-Feb-2025.)
 |- 
 { <. u ,  v >.  |  ( ( u  e.  2o  /\  v  e.  2o )  /\  u  =/=  v ) } TAp  2o
 
5-Feb-2025netap 7255 Negated equality on a set with decidable equality is a tight apartness. (Contributed by Jim Kingdon, 5-Feb-2025.)
 |-  ( A. x  e.  A  A. y  e.  A DECID  x  =  y  ->  { <. u ,  v >.  |  ( ( u  e.  A  /\  v  e.  A )  /\  u  =/=  v ) } TAp  A )
 
5-Feb-2025df-tap 7251 Tight apartness predicate. A relation  R is a tight apartness if it is irreflexive, symmetric, cotransitive, and tight. (Contributed by Jim Kingdon, 5-Feb-2025.)
 |-  ( R TAp  A  <->  ( R Ap  A  /\  A. x  e.  A  A. y  e.  A  ( -.  x R y 
 ->  x  =  y
 ) ) )
 
1-Feb-2025mulgnn0cld 13009 Closure of the group multiple (exponentiation) operation for a nonnegative multiplier in a monoid. Deduction associated with mulgnn0cl 13004. (Contributed by SN, 1-Feb-2025.)
 |-  B  =  ( Base `  G )   &    |-  .x.  =  (.g `  G )   &    |-  ( ph  ->  G  e.  Mnd )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  ( ph  ->  X  e.  B )   =>    |-  ( ph  ->  ( N  .x.  X )  e.  B )
 
31-Jan-20250subg 13064 The zero subgroup of an arbitrary group. (Contributed by Stefan O'Rear, 10-Dec-2014.) (Proof shortened by SN, 31-Jan-2025.)
 |- 
 .0.  =  ( 0g `  G )   =>    |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubGrp `  G ) )
 
28-Jan-2025dvdsrex 13272 Existence of the divisibility relation. (Contributed by Jim Kingdon, 28-Jan-2025.)
 |-  ( R  e. SRing  ->  (
 ||r `  R )  e.  _V )
 
24-Jan-2025reldvdsrsrg 13266 The divides relation is a relation. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by Jim Kingdon, 24-Jan-2025.)
 |-  ( R  e. SRing  ->  Rel  ( ||r
 `  R ) )
 
18-Jan-2025rerecapb 8802 A real number has a multiplicative inverse if and only if it is apart from zero. Theorem 11.2.4 of [HoTT], p. (varies). (Contributed by Jim Kingdon, 18-Jan-2025.)
 |-  ( A  e.  RR  ->  ( A #  0  <->  E. x  e.  RR  ( A  x.  x )  =  1 )
 )
 
18-Jan-2025recapb 8630 A complex number has a multiplicative inverse if and only if it is apart from zero. Theorem 11.2.4 of [HoTT], p. (varies), generalized from real to complex numbers. (Contributed by Jim Kingdon, 18-Jan-2025.)
 |-  ( A  e.  CC  ->  ( A #  0  <->  E. x  e.  CC  ( A  x.  x )  =  1 )
 )
 
17-Jan-2025ressval3d 12533 Value of structure restriction, deduction version. (Contributed by AV, 14-Mar-2020.) (Revised by Jim Kingdon, 17-Jan-2025.)
 |-  R  =  ( Ss  A )   &    |-  B  =  (
 Base `  S )   &    |-  E  =  ( Base `  ndx )   &    |-  ( ph  ->  S  e.  V )   &    |-  ( ph  ->  Fun  S )   &    |-  ( ph  ->  E  e.  dom  S )   &    |-  ( ph  ->  A  C_  B )   =>    |-  ( ph  ->  R  =  ( S sSet  <. E ,  A >. ) )
 
17-Jan-2025strressid 12532 Behavior of trivial restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.) (Revised by Jim Kingdon, 17-Jan-2025.)
 |-  ( ph  ->  B  =  ( Base `  W )
 )   &    |-  ( ph  ->  W Struct  <. M ,  N >. )   &    |-  ( ph  ->  Fun  W )   &    |-  ( ph  ->  ( Base ` 
 ndx )  e.  dom  W )   =>    |-  ( ph  ->  ( Ws  B )  =  W )
 
16-Jan-2025ressex 12527 Existence of structure restriction. (Contributed by Jim Kingdon, 16-Jan-2025.)
 |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  e.  _V )
 
16-Jan-2025ressvalsets 12526 Value of structure restriction. (Contributed by Jim Kingdon, 16-Jan-2025.)
 |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  =  ( W sSet  <. ( Base ` 
 ndx ) ,  ( A  i^i  ( Base `  W ) ) >. ) )
 
10-Jan-2025opprex 13250 Existence of the opposite ring. If you know that  R is a ring, see opprring 13254. (Contributed by Jim Kingdon, 10-Jan-2025.)
 |-  O  =  (oppr `  R )   =>    |-  ( R  e.  V  ->  O  e.  _V )
 
10-Jan-2025mgpex 13140 Existence of the multiplication group. If  R is known to be a semiring, see srgmgp 13156. (Contributed by Jim Kingdon, 10-Jan-2025.)
 |-  M  =  (mulGrp `  R )   =>    |-  ( R  e.  V  ->  M  e.  _V )
 
5-Jan-2025imbibi 252 The antecedent of one side of a biconditional can be moved out of the biconditional to become the antecedent of the remaining biconditional. (Contributed by BJ, 1-Jan-2025.) (Proof shortened by Wolf Lammen, 5-Jan-2025.)
 |-  ( ( ( ph  ->  ps )  <->  ch )  ->  ( ph  ->  ( ps  <->  ch ) ) )
 
1-Jan-2025snss 3729 The singleton of an element of a class is a subset of the class (inference form of snssg 3728). Theorem 7.4 of [Quine] p. 49. (Contributed by NM, 21-Jun-1993.) (Proof shortened by BJ, 1-Jan-2025.)
 |-  A  e.  _V   =>    |-  ( A  e.  B 
 <->  { A }  C_  B )
 
1-Jan-2025snssg 3728 The singleton formed on a set is included in a class if and only if the set is an element of that class. Theorem 7.4 of [Quine] p. 49. (Contributed by NM, 22-Jul-2001.) (Proof shortened by BJ, 1-Jan-2025.)
 |-  ( A  e.  V  ->  ( A  e.  B  <->  { A }  C_  B ) )
 
1-Jan-2025snssb 3727 Characterization of the inclusion of a singleton in a class. (Contributed by BJ, 1-Jan-2025.)
 |-  ( { A }  C_  B  <->  ( A  e.  _V 
 ->  A  e.  B ) )
 
9-Dec-2024nninfwlpoim 7178 Decidable equality for ℕ implies the Weak Limited Principle of Omniscience (WLPO). (Contributed by Jim Kingdon, 9-Dec-2024.)
 |-  ( A. x  e.  A. y  e. DECID  x  =  y  ->  om  e. WOmni )
 
8-Dec-2024nninfwlpoimlemdc 7177 Lemma for nninfwlpoim 7178. (Contributed by Jim Kingdon, 8-Dec-2024.)
 |-  ( ph  ->  F : om --> 2o )   &    |-  G  =  ( i  e.  om  |->  if ( E. x  e. 
 suc  i ( F `
  x )  =  (/) ,  (/) ,  1o )
 )   &    |-  ( ph  ->  A. x  e.  A. y  e. DECID  x  =  y )   =>    |-  ( ph  -> DECID  A. n  e.  om  ( F `  n )  =  1o )
 
8-Dec-2024nninfwlpoimlemginf 7176 Lemma for nninfwlpoim 7178. (Contributed by Jim Kingdon, 8-Dec-2024.)
 |-  ( ph  ->  F : om --> 2o )   &    |-  G  =  ( i  e.  om  |->  if ( E. x  e. 
 suc  i ( F `
  x )  =  (/) ,  (/) ,  1o )
 )   =>    |-  ( ph  ->  ( G  =  ( i  e.  om  |->  1o )  <->  A. n  e.  om  ( F `  n )  =  1o ) )
 
8-Dec-2024nninfwlpoimlemg 7175 Lemma for nninfwlpoim 7178. (Contributed by Jim Kingdon, 8-Dec-2024.)
 |-  ( ph  ->  F : om --> 2o )   &    |-  G  =  ( i  e.  om  |->  if ( E. x  e. 
 suc  i ( F `
  x )  =  (/) ,  (/) ,  1o )
 )   =>    |-  ( ph  ->  G  e. )
 
7-Dec-2024nninfwlpor 7174 The Weak Limited Principle of Omniscience (WLPO) implies that equality for ℕ is decidable. (Contributed by Jim Kingdon, 7-Dec-2024.)
 |-  ( om  e. WOmni  ->  A. x  e.  A. y  e. DECID  x  =  y )
 
7-Dec-2024nninfwlporlem 7173 Lemma for nninfwlpor 7174. The result. (Contributed by Jim Kingdon, 7-Dec-2024.)
 |-  ( ph  ->  X : om --> 2o )   &    |-  ( ph  ->  Y : om --> 2o )   &    |-  D  =  ( i  e.  om  |->  if ( ( X `  i )  =  ( Y `  i ) ,  1o ,  (/) ) )   &    |-  ( ph  ->  om  e. WOmni )   =>    |-  ( ph  -> DECID  X  =  Y )
 
6-Dec-2024nninfwlporlemd 7172 Given two countably infinite sequences of zeroes and ones, they are equal if and only if a sequence formed by pointwise comparing them is all ones. (Contributed by Jim Kingdon, 6-Dec-2024.)
 |-  ( ph  ->  X : om --> 2o )   &    |-  ( ph  ->  Y : om --> 2o )   &    |-  D  =  ( i  e.  om  |->  if ( ( X `  i )  =  ( Y `  i ) ,  1o ,  (/) ) )   =>    |-  ( ph  ->  ( X  =  Y  <->  D  =  (
 i  e.  om  |->  1o ) ) )
 
3-Dec-2024nninfwlpo 7179 Decidability of equality for ℕ is equivalent to the Weak Limited Principle of Omniscience (WLPO). (Contributed by Jim Kingdon, 3-Dec-2024.)
 |-  ( A. x  e.  A. y  e. DECID  x  =  y  <->  om  e. WOmni )
 
3-Dec-2024nninfdcinf 7171 The Weak Limited Principle of Omniscience (WLPO) implies that it is decidable whether an element of ℕ equals the point at infinity. (Contributed by Jim Kingdon, 3-Dec-2024.)
 |-  ( ph  ->  om  e. WOmni )   &    |-  ( ph  ->  N  e. )   =>    |-  ( ph  -> DECID  N  =  ( i  e.  om  |->  1o ) )
 
28-Nov-2024basmexd 12524 A structure whose base is inhabited is a set. (Contributed by Jim Kingdon, 28-Nov-2024.)
 |-  ( ph  ->  B  =  ( Base `  G )
 )   &    |-  ( ph  ->  A  e.  B )   =>    |-  ( ph  ->  G  e.  _V )
 
22-Nov-2024eliotaeu 5207 An inhabited iota expression has a unique value. (Contributed by Jim Kingdon, 22-Nov-2024.)
 |-  ( A  e.  ( iota x ph )  ->  E! x ph )
 
22-Nov-2024eliota 5206 An element of an iota expression. (Contributed by Jim Kingdon, 22-Nov-2024.)
 |-  ( A  e.  ( iota x ph )  <->  E. y ( A  e.  y  /\  A. x ( ph  <->  x  =  y
 ) ) )
 
18-Nov-2024basmex 12523 A structure whose base is inhabited is a set. (Contributed by Jim Kingdon, 18-Nov-2024.)
 |-  B  =  ( Base `  G )   =>    |-  ( A  e.  B  ->  G  e.  _V )
 
12-Nov-2024slotsdifipndx 12635 The slot for the scalar is not the index of other slots. (Contributed by AV, 12-Nov-2024.)
 |-  ( ( .s `  ndx )  =/=  ( .i `  ndx )  /\  (Scalar `  ndx )  =/=  ( .i `  ndx ) )
 
11-Nov-2024bj-con1st 14542 Contraposition when the antecedent is a negated stable proposition. See con1dc 856. (Contributed by BJ, 11-Nov-2024.)
 |-  (STAB  ph  ->  ( ( -.  ph  ->  ps )  ->  ( -.  ps 
 ->  ph ) ) )
 
11-Nov-2024slotsdifdsndx 12681 The index of the slot for the distance is not the index of other slots. (Contributed by AV, 11-Nov-2024.)
 |-  ( ( *r `
  ndx )  =/=  ( dist `  ndx )  /\  ( le `  ndx )  =/=  ( dist `  ndx ) )
 
11-Nov-2024slotsdifplendx 12670 The index of the slot for the distance is not the index of other slots. (Contributed by AV, 11-Nov-2024.)
 |-  ( ( *r `
  ndx )  =/=  ( le `  ndx )  /\  (TopSet `  ndx )  =/=  ( le `  ndx ) )
 
11-Nov-2024tsetndxnstarvndx 12654 The slot for the topology is not the slot for the involution in an extensible structure. (Contributed by AV, 11-Nov-2024.)
 |-  (TopSet `  ndx )  =/=  ( *r `  ndx )
 
11-Nov-2024const 852 Contraposition when the antecedent is a negated stable proposition. See comment of condc 853. (Contributed by BJ, 18-Nov-2023.) (Proof shortened by BJ, 11-Nov-2024.)
 |-  (STAB 
 ph  ->  ( ( -.  ph  ->  -.  ps )  ->  ( ps  ->  ph )
 ) )
 
10-Nov-2024slotsdifunifndx 12688 The index of the slot for the uniform set is not the index of other slots. (Contributed by AV, 10-Nov-2024.)
 |-  ( ( ( +g  ` 
 ndx )  =/=  ( UnifSet
 `  ndx )  /\  ( .r `  ndx )  =/=  ( UnifSet `  ndx )  /\  ( *r `  ndx )  =/=  ( UnifSet `  ndx ) )  /\  ( ( le `  ndx )  =/=  ( UnifSet `  ndx )  /\  ( dist `  ndx )  =/=  ( UnifSet `  ndx ) ) )
 
7-Nov-2024ressbasd 12529 Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014.) (Proof shortened by AV, 7-Nov-2024.)
 |-  ( ph  ->  R  =  ( Ws  A ) )   &    |-  ( ph  ->  B  =  (
 Base `  W ) )   &    |-  ( ph  ->  W  e.  X )   &    |-  ( ph  ->  A  e.  V )   =>    |-  ( ph  ->  ( A  i^i  B )  =  ( Base `  R ) )
 
6-Nov-2024oppraddg 13253 Addition operation of an opposite ring. (Contributed by Mario Carneiro, 1-Dec-2014.) (Proof shortened by AV, 6-Nov-2024.)
 |-  O  =  (oppr `  R )   &    |- 
 .+  =  ( +g  `  R )   =>    |-  ( R  e.  V  ->  .+  =  ( +g  `  O ) )
 
6-Nov-2024opprbasg 13252 Base set of an opposite ring. (Contributed by Mario Carneiro, 1-Dec-2014.) (Proof shortened by AV, 6-Nov-2024.)
 |-  O  =  (oppr `  R )   &    |-  B  =  ( Base `  R )   =>    |-  ( R  e.  V  ->  B  =  ( Base `  O ) )
 
6-Nov-2024opprsllem 13251 Lemma for opprbasg 13252 and oppraddg 13253. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by AV, 6-Nov-2024.)
 |-  O  =  (oppr `  R )   &    |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )   &    |-  ( E `  ndx )  =/=  ( .r `  ndx )   =>    |-  ( R  e.  V  ->  ( E `  R )  =  ( E `  O ) )
 
4-Nov-2024lgsfvalg 14445 Value of the function  F which defines the Legendre symbol at the primes. (Contributed by Mario Carneiro, 4-Feb-2015.) (Revised by Jim Kingdon, 4-Nov-2024.)
 |-  F  =  ( n  e.  NN  |->  if ( n  e.  Prime ,  ( if ( n  =  2 ,  if ( 2 
 ||  A ,  0 ,  if ( ( A  mod  8 )  e.  { 1 ,  7 } ,  1 ,  -u 1 ) ) ,  ( ( ( ( A ^ (
 ( n  -  1
 )  /  2 )
 )  +  1 ) 
 mod  n )  -  1 ) ) ^
 ( n  pCnt  N ) ) ,  1 ) )   =>    |-  ( ( A  e.  ZZ  /\  N  e.  NN  /\  M  e.  NN )  ->  ( F `  M )  =  if ( M  e.  Prime ,  ( if ( M  =  2 ,  if ( 2 
 ||  A ,  0 ,  if ( ( A  mod  8 )  e.  { 1 ,  7 } ,  1 ,  -u 1 ) ) ,  ( ( ( ( A ^ (
 ( M  -  1
 )  /  2 )
 )  +  1 ) 
 mod  M )  -  1
 ) ) ^ ( M  pCnt  N ) ) ,  1 ) )
 
1-Nov-2024plendxnvscandx 12669 The slot for the "less than or equal to" ordering is not the slot for the scalar product in an extensible structure. (Contributed by AV, 1-Nov-2024.)
 |-  ( le `  ndx )  =/=  ( .s `  ndx )
 
1-Nov-2024plendxnscandx 12668 The slot for the "less than or equal to" ordering is not the slot for the scalar in an extensible structure. (Contributed by AV, 1-Nov-2024.)
 |-  ( le `  ndx )  =/=  (Scalar `  ndx )
 
1-Nov-2024plendxnmulrndx 12667 The slot for the "less than or equal to" ordering is not the slot for the ring multiplication operation in an extensible structure. (Contributed by AV, 1-Nov-2024.)
 |-  ( le `  ndx )  =/=  ( .r `  ndx )
 
1-Nov-2024qsqeqor 10633 The squares of two rational numbers are equal iff one number equals the other or its negative. (Contributed by Jim Kingdon, 1-Nov-2024.)
 |-  ( ( A  e.  QQ  /\  B  e.  QQ )  ->  ( ( A ^ 2 )  =  ( B ^ 2
 ) 
 <->  ( A  =  B  \/  A  =  -u B ) ) )
 
31-Oct-2024dsndxnmulrndx 12678 The slot for the distance function is not the slot for the ring multiplication operation in an extensible structure. (Contributed by AV, 31-Oct-2024.)
 |-  ( dist `  ndx )  =/=  ( .r `  ndx )
 
31-Oct-2024tsetndxnmulrndx 12653 The slot for the topology is not the slot for the ring multiplication operation in an extensible structure. (Contributed by AV, 31-Oct-2024.)
 |-  (TopSet `  ndx )  =/=  ( .r `  ndx )
 
31-Oct-2024tsetndxnbasendx 12651 The slot for the topology is not the slot for the base set in an extensible structure. (Contributed by AV, 21-Oct-2024.) (Proof shortened by AV, 31-Oct-2024.)
 |-  (TopSet `  ndx )  =/=  ( Base `  ndx )
 
31-Oct-2024basendxlttsetndx 12650 The index of the slot for the base set is less then the index of the slot for the topology in an extensible structure. (Contributed by AV, 31-Oct-2024.)
 |-  ( Base `  ndx )  < 
 (TopSet `  ndx )
 
31-Oct-2024tsetndxnn 12649 The index of the slot for the group operation in an extensible structure is a positive integer. (Contributed by AV, 31-Oct-2024.)
 |-  (TopSet `  ndx )  e. 
 NN
 
30-Oct-2024plendxnbasendx 12665 The slot for the order is not the slot for the base set in an extensible structure. (Contributed by AV, 21-Oct-2024.) (Proof shortened by AV, 30-Oct-2024.)
 |-  ( le `  ndx )  =/=  ( Base `  ndx )
 
30-Oct-2024basendxltplendx 12664 The index value of the  Base slot is less than the index value of the  le slot. (Contributed by AV, 30-Oct-2024.)
 |-  ( Base `  ndx )  < 
 ( le `  ndx )
 
30-Oct-2024plendxnn 12663 The index value of the order slot is a positive integer. This property should be ensured for every concrete coding because otherwise it could not be used in an extensible structure (slots must be positive integers). (Contributed by AV, 30-Oct-2024.)
 |-  ( le `  ndx )  e.  NN
 
29-Oct-2024dsndxntsetndx 12680 The slot for the distance function is not the slot for the topology in an extensible structure. (Contributed by AV, 29-Oct-2024.)
 |-  ( dist `  ndx )  =/=  (TopSet `  ndx )
 
29-Oct-2024slotsdnscsi 12679 The slots Scalar,  .s and  .i are different from the slot  dist. (Contributed by AV, 29-Oct-2024.)
 |-  ( ( dist `  ndx )  =/=  (Scalar `  ndx )  /\  ( dist `  ndx )  =/=  ( .s `  ndx )  /\  ( dist ` 
 ndx )  =/=  ( .i `  ndx ) )
 
29-Oct-2024slotstnscsi 12655 The slots Scalar,  .s and  .i are different from the slot TopSet. (Contributed by AV, 29-Oct-2024.)
 |-  ( (TopSet `  ndx )  =/=  (Scalar `  ndx )  /\  (TopSet `  ndx )  =/=  ( .s `  ndx )  /\  (TopSet `  ndx )  =/=  ( .i `  ndx ) )
 
29-Oct-2024ipndxnmulrndx 12634 The slot for the inner product is not the slot for the ring (multiplication) operation in an extensible structure. (Contributed by AV, 29-Oct-2024.)
 |-  ( .i `  ndx )  =/=  ( .r `  ndx )
 
29-Oct-2024ipndxnplusgndx 12633 The slot for the inner product is not the slot for the group operation in an extensible structure. (Contributed by AV, 29-Oct-2024.)
 |-  ( .i `  ndx )  =/=  ( +g  `  ndx )

  Copyright terms: Public domain W3C HTML validation [external]