HomeHome Metamath Proof Explorer
Theorem List (p. 310 of 322)
< Previous  Next >
Browser slow? Try the
Unicode version.

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

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-21498)
  Hilbert Space Explorer  Hilbert Space Explorer
(21499-23021)
  Users' Mathboxes  Users' Mathboxes
(23022-32154)
 

Theorem List for Metamath Proof Explorer - 30901-31000   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremcdlemg34 30901* Use cdlemg33 to eliminate  z from cdlemg29 30894. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  N  =  ( ( P  .\/  v )  ./\  ( Q 
 .\/  ( R `  F ) ) )   &    |-  O  =  ( ( P  .\/  v )  ./\  ( Q  .\/  ( R `
  G ) ) )   =>    |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W ) 
 /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  (
 ( v  e.  A  /\  v  .<_  W ) 
 /\  ( F  e.  T  /\  G  e.  T )  /\  P  =/=  Q )  /\  ( v  =/=  ( R `  F )  /\  v  =/=  ( R `  G )  /\  E. r  e.  A  ( -.  r  .<_  W  /\  ( P  .\/  r )  =  ( Q  .\/  r ) ) ) )  ->  ( ( P  .\/  ( F `  ( G `  P ) ) )  ./\  W )  =  ( ( Q 
 .\/  ( F `  ( G `  Q ) ) )  ./\  W ) )
 
Theoremcdlemg35 30902* TODO: Fix comment. TODO: should we have a more general version of hlsupr 29575 to avoid the  =/= conditions? (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  F  e.  T  /\  G  e.  T )  /\  ( ( F `
  P )  =/= 
 P  /\  ( G `  P )  =/=  P  /\  ( R `  F )  =/=  ( R `  G ) ) ) 
 ->  E. v  e.  A  ( v  .<_  W  /\  ( v  =/=  ( R `  F )  /\  v  =/=  ( R `  G ) ) ) )
 
Theoremcdlemg36 30903* Use cdlemg35 to eliminate  v from cdlemg34 30901. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( ( K  e.  HL  /\  W  e.  H ) 
 /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) 
 /\  ( F  e.  T  /\  G  e.  T  /\  P  =/=  Q ) 
 /\  ( ( ( F `  P )  =/=  P  /\  ( G `  P )  =/= 
 P )  /\  ( R `  F )  =/=  ( R `  G )  /\  E. r  e.  A  ( -.  r  .<_  W  /\  ( P 
 .\/  r )  =  ( Q  .\/  r
 ) ) ) ) 
 ->  ( ( P  .\/  ( F `  ( G `
  P ) ) )  ./\  W )  =  ( ( Q  .\/  ( F `  ( G `
  Q ) ) )  ./\  W )
 )
 
Theoremcdlemg38 30904 Use cdlemg37 30878 to eliminate  E. r  e.  A from cdlemg36 30903. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( ( K  e.  HL  /\  W  e.  H ) 
 /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) 
 /\  ( F  e.  T  /\  G  e.  T  /\  P  =/=  Q ) 
 /\  ( ( ( F `  P )  =/=  P  /\  ( G `  P )  =/= 
 P )  /\  ( R `  F )  =/=  ( R `  G ) ) )  ->  ( ( P  .\/  ( F `  ( G `
  P ) ) )  ./\  W )  =  ( ( Q  .\/  ( F `  ( G `
  Q ) ) )  ./\  W )
 )
 
Theoremcdlemg39 30905 Eliminate  =/= conditions from cdlemg38 30904. TODO: Would this better be done at cdlemg35 30902? TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) 
 /\  ( F  e.  T  /\  G  e.  T  /\  P  =/=  Q ) )  ->  ( ( P  .\/  ( F `  ( G `  P ) ) )  ./\  W )  =  ( ( Q 
 .\/  ( F `  ( G `  Q ) ) )  ./\  W ) )
 
Theoremcdlemg40 30906 Eliminate  P  =/=  Q conditions from cdlemg39 30905. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) 
 /\  ( F  e.  T  /\  G  e.  T ) )  ->  ( ( P  .\/  ( F `  ( G `  P ) ) )  ./\  W )  =  ( ( Q  .\/  ( F `  ( G `  Q ) ) )  ./\  W ) )
 
Theoremcdlemg41 30907 Convert cdlemg40 30906 to function composition. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) 
 /\  ( F  e.  T  /\  G  e.  T ) )  ->  ( ( P  .\/  ( ( F  o.  G ) `  P ) )  ./\  W )  =  ( ( Q  .\/  ( ( F  o.  G ) `  Q ) )  ./\  W ) )
 
Theoremltrnco 30908 The composition of two translations is a translation. Part of proof of Lemma G of [Crawley] p. 116, line 15 on p. 117. (Contributed by NM, 31-May-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( F  o.  G )  e.  T )
 
Theoremtrlcocnv 30909 Swap the arguments of the trace of a composition with converse. (Contributed by NM, 1-Jul-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( R `  ( F  o.  `' G ) )  =  ( R `
  ( G  o.  `' F ) ) )
 
Theoremtrlcoabs 30910 Absorption into a composition by joining with trace. (Contributed by NM, 22-Jul-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  A  =  (
 Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  (
 ( ( F  o.  G ) `  P )  .\/  ( R `  F ) )  =  ( ( G `  P )  .\/  ( R `
  F ) ) )
 
Theoremtrlcoabs2N 30911 Absorption of the trace of a composition. (Contributed by NM, 29-Jul-2013.) (New usage is discouraged.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  A  =  (
 Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  (
 ( F `  P )  .\/  ( R `  ( G  o.  `' F ) ) )  =  ( ( F `  P )  .\/  ( G `
  P ) ) )
 
Theoremtrlcoat 30912 The trace of a composition of two translations is an atom if their traces are different. (Contributed by NM, 15-Jun-2013.)
 |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( R `  F )  =/=  ( R `  G ) ) 
 ->  ( R `  ( F  o.  G ) )  e.  A )
 
Theoremtrlcocnvat 30913 Commonly used special case of trlcoat 30912. (Contributed by NM, 1-Jul-2013.)
 |-  A  =  ( Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( R `  F )  =/=  ( R `  G ) ) 
 ->  ( R `  ( F  o.  `' G ) )  e.  A )
 
Theoremtrlconid 30914 The composition of two different translations is not the identity translation. (Contributed by NM, 22-Jul-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( R `  F )  =/=  ( R `  G ) ) 
 ->  ( F  o.  G )  =/=  (  _I  |`  B ) )
 
Theoremtrlcolem 30915 Lemma for trlco 30916. (Contributed by NM, 1-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  H  =  (
 LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  ./\  =  ( meet `  K )   &    |-  A  =  ( Atoms `  K )   =>    |-  (
 ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( R `  ( F  o.  G ) )  .<_  ( ( R `  F )  .\/  ( R `  G ) ) )
 
Theoremtrlco 30916 The trace of a composition of translations is less than or equal to the join of their traces. Part of proof of Lemma G of [Crawley] p. 116, second paragraph on p. 117. (Contributed by NM, 2-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  H  =  (
 LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( R `  ( F  o.  G ) ) 
 .<_  ( ( R `  F )  .\/  ( R `
  G ) ) )
 
Theoremtrlcone 30917 If two translations have different traces, the trace of their composition is also different. (Contributed by NM, 14-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( ( R `
  F )  =/=  ( R `  G )  /\  G  =/=  (  _I  |`  B ) ) )  ->  ( R `  F )  =/=  ( R `  ( F  o.  G ) ) )
 
Theoremcdlemg42 30918 Part of proof of Lemma G of [Crawley] p. 116, first line of third paragraph on p. 117. (Contributed by NM, 3-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  A  =  (
 Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  ( G `  P )  =/=  P  /\  ( R `  F )  =/=  ( R `  G ) ) )  ->  -.  ( G `  P )  .<_  ( P  .\/  ( F `  P ) ) )
 
Theoremcdlemg43 30919 Part of proof of Lemma G of [Crawley] p. 116, third line of third paragraph on p. 117. (Contributed by NM, 3-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |- 
 .\/  =  ( join `  K )   &    |-  A  =  (
 Atoms `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  ./\  =  ( meet `  K )   =>    |-  (
 ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  ( ( P  e.  A  /\  -.  P  .<_  W )  /\  ( G `  P )  =/=  P  /\  ( R `  F )  =/=  ( R `  G ) ) )  ->  ( F `  ( G `
  P ) )  =  ( ( ( G `  P ) 
 .\/  ( R `  F ) )  ./\  ( ( F `  P )  .\/  ( R `
  G ) ) ) )
 
Theoremcdlemg44a 30920 Part of proof of Lemma G of [Crawley] p. 116, fourth line of third paragraph on p. 117: "so fg(p) = gf(p)." (Contributed by NM, 3-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  .<_  =  ( le `  K )   &    |-  A  =  ( Atoms `  K )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  ( ( F `  P )  =/=  P  /\  ( G `  P )  =/= 
 P  /\  ( R `  F )  =/=  ( R `  G ) ) )  ->  ( F `  ( G `  P ) )  =  ( G `  ( F `  P ) ) )
 
Theoremcdlemg44b 30921 Eliminate  ( F `  P )  =/=  P,  ( G `  P )  =/=  P from cdlemg44a 30920. (Contributed by NM, 3-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  .<_  =  ( le `  K )   &    |-  A  =  ( Atoms `  K )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  ( R `
  F )  =/=  ( R `  G ) )  ->  ( F `
  ( G `  P ) )  =  ( G `  ( F `  P ) ) )
 
Theoremcdlemg44 30922 Part of proof of Lemma G of [Crawley] p. 116, fifth line of third paragraph on p. 117: "and hence fg = gf." (Contributed by NM, 3-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( R `  F )  =/=  ( R `  G ) ) 
 ->  ( F  o.  G )  =  ( G  o.  F ) )
 
Theoremcdlemg47a 30923 TODO: fix comment. TODO: Use this above in place of  ( F `  P )  =  P antecedents? (Contributed by NM, 5-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  F  =  (  _I  |`  B )
 )  ->  ( F  o.  G )  =  ( G  o.  F ) )
 
Theoremcdlemg46 30924* Part of proof of Lemma G of [Crawley] p. 116, seventh line of third paragraph on p. 117: "hf and f have different traces." (Contributed by NM, 5-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  h  e.  T )  /\  ( F  =/=  (  _I  |`  B )  /\  h  =/=  (  _I  |`  B )  /\  ( R `  h )  =/=  ( R `  F ) ) ) 
 ->  ( R `  ( h  o.  F ) )  =/=  ( R `  F ) )
 
Theoremcdlemg47 30925* Part of proof of Lemma G of [Crawley] p. 116, ninth line of third paragraph on p. 117: "we conclude that gf = fg." (Contributed by NM, 5-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( ( K  e.  HL  /\  W  e.  H ) 
 /\  F  e.  T  /\  G  e.  T ) 
 /\  ( h  e.  T  /\  ( R `
  F )  =  ( R `  G ) )  /\  ( F  =/=  (  _I  |`  B ) 
 /\  h  =/=  (  _I  |`  B )  /\  ( R `  h )  =/=  ( R `  F ) ) ) 
 ->  ( F  o.  G )  =  ( G  o.  F ) )
 
Theoremcdlemg48 30926 Elmininate  h from cdlemg47 30925. (Contributed by NM, 5-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T ) 
 /\  ( F  =/=  (  _I  |`  B )  /\  ( R `  F )  =  ( R `  G ) ) ) 
 ->  ( F  o.  G )  =  ( G  o.  F ) )
 
Theoremltrncom 30927 Composition is commutative for translations. Part of proof of Lemma G of [Crawley] p. 116 (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( F  o.  G )  =  ( G  o.  F ) )
 
Theoremltrnco4 30928 Rearrange a composition of 4 translations, analogous to an4 797. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  E  e.  T  /\  F  e.  T )  ->  ( ( D  o.  E )  o.  ( F  o.  G ) )  =  ( ( D  o.  F )  o.  ( E  o.  G ) ) )
 
Theoremtrljco 30929 Trace joined with trace of composition. (Contributed by NM, 15-Jun-2013.)
 |-  .\/  =  ( join `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( ( R `  F )  .\/  ( R `
  ( F  o.  G ) ) )  =  ( ( R `
  F )  .\/  ( R `  G ) ) )
 
Theoremtrljco2 30930 Trace joined with trace of composition. (Contributed by NM, 16-Jun-2013.)
 |-  .\/  =  ( join `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( ( R `  F )  .\/  ( R `
  ( F  o.  G ) ) )  =  ( ( R `
  G )  .\/  ( R `  ( F  o.  G ) ) ) )
 
Syntaxctgrp 30931 Extend class notation with translation group.
 class  TGrp
 
Definitiondf-tgrp 30932* Define the class of all translation groups.  k is normally a member of  HL. Each base set is the set of all lattice translations with respect to a hyperplane  w, and the operation is function composition. Similar to definition of G in [Crawley] p. 116, third paragraph (which defines this for geomodular lattices). (Contributed by NM, 5-Jun-2013.)
 |-  TGrp  =  ( k  e.  _V  |->  ( w  e.  ( LHyp `  k )  |->  {
 <. ( Base `  ndx ) ,  ( ( LTrn `  k
 ) `  w ) >. ,  <. ( +g  `  ndx ) ,  ( f  e.  ( ( LTrn `  k
 ) `  w ) ,  g  e.  (
 ( LTrn `  k ) `  w )  |->  ( f  o.  g ) )
 >. } ) )
 
Theoremtgrpfset 30933* The translation group maps for a lattice  K. (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   =>    |-  ( K  e.  V  ->  (
 TGrp `  K )  =  ( w  e.  H  |->  {
 <. ( Base `  ndx ) ,  ( ( LTrn `  K ) `  w ) >. , 
 <. ( +g  `  ndx ) ,  ( f  e.  ( ( LTrn `  K ) `  w ) ,  g  e.  ( (
 LTrn `  K ) `  w )  |->  ( f  o.  g ) )
 >. } ) )
 
Theoremtgrpset 30934* The translation group for a fiducial co-atom  W. (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  G  =  ( ( TGrp `  K ) `  W )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  G  =  { <. ( Base `  ndx ) ,  T >. , 
 <. ( +g  `  ndx ) ,  ( f  e.  T ,  g  e.  T  |->  ( f  o.  g ) ) >. } )
 
Theoremtgrpbase 30935 The base set of the translation group is the set of all translations (for a fiducial co-atom  W). (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  G  =  ( ( TGrp `  K ) `  W )   &    |-  C  =  ( Base `  G )   =>    |-  (
 ( K  e.  V  /\  W  e.  H ) 
 ->  C  =  T )
 
Theoremtgrpopr 30936* The group operation of the translation group is function composition. (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  G  =  ( ( TGrp `  K ) `  W )   &    |-  .+  =  ( +g  `  G )   =>    |-  (
 ( K  e.  V  /\  W  e.  H ) 
 ->  .+  =  ( f  e.  T ,  g  e.  T  |->  ( f  o.  g ) ) )
 
Theoremtgrpov 30937 The group operation value of the translation group is the composition of translations. (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  G  =  ( ( TGrp `  K ) `  W )   &    |-  .+  =  ( +g  `  G )   =>    |-  (
 ( K  e.  V  /\  W  e.  H  /\  ( X  e.  T  /\  Y  e.  T ) )  ->  ( X  .+  Y )  =  ( X  o.  Y ) )
 
Theoremtgrpgrplem 30938 Lemma for tgrpgrp 30939. (Contributed by NM, 6-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  G  =  ( ( TGrp `  K ) `  W )   &    |-  .+  =  ( +g  `  G )   &    |-  B  =  ( Base `  K )   =>    |-  (
 ( K  e.  HL  /\  W  e.  H ) 
 ->  G  e.  Grp )
 
Theoremtgrpgrp 30939 The translation group is a group. (Contributed by NM, 6-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  G  =  ( ( TGrp `  K ) `  W )   =>    |-  ( ( K  e.  HL  /\  W  e.  H )  ->  G  e.  Grp )
 
Theoremtgrpabl 30940 The translation group is an Abelian group. Lemma G of [Crawley] p. 116. (Contributed by NM, 6-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  G  =  ( ( TGrp `  K ) `  W )   =>    |-  ( ( K  e.  HL  /\  W  e.  H )  ->  G  e.  Abel )
 
Syntaxctendo 30941 Extend class notation with translation group endomorphisms.
 class  TEndo
 
Syntaxcedring 30942 Extend class notation with division ring on trace-preserving endomorphisms.
 class  EDRing
 
Syntaxcedring-rN 30943 Extend class notation with division ring on trace-preserving endomorphisms, with multiplication reversed. TODO: remove  EDRing R theorems if not used.
 class  EDRing R
 
Definitiondf-tendo 30944* Define trace-preserving endomorphisms on the set of translations. (Contributed by NM, 8-Jun-2013.)
 |-  TEndo  =  ( k  e.  _V  |->  ( w  e.  ( LHyp `  k )  |->  { f  |  ( f : ( ( LTrn `  k ) `  w ) --> ( (
 LTrn `  k ) `  w )  /\  A. x  e.  ( ( LTrn `  k
 ) `  w ) A. y  e.  (
 ( LTrn `  k ) `  w ) ( f `
  ( x  o.  y ) )  =  ( ( f `  x )  o.  (
 f `  y )
 )  /\  A. x  e.  ( ( LTrn `  k
 ) `  w )
 ( ( ( trL `  k ) `  w ) `  ( f `  x ) ) ( le `  k ) ( ( ( trL `  k ) `  w ) `  x ) ) } ) )
 
Definitiondf-edring-rN 30945* Define division ring on trace-preserving endomorphisms. Definition of E of [Crawley] p. 117, 4th line from bottom. (Contributed by NM, 8-Jun-2013.)
 |-  EDRing R  =  ( k  e.  _V  |->  ( w  e.  ( LHyp `  k )  |->  {
 <. ( Base `  ndx ) ,  ( ( TEndo `  k
 ) `  w ) >. ,  <. ( +g  `  ndx ) ,  ( s  e.  ( ( TEndo `  k
 ) `  w ) ,  t  e.  (
 ( TEndo `  k ) `  w )  |->  ( f  e.  ( ( LTrn `  k ) `  w )  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )
 >. ,  <. ( .r `  ndx ) ,  ( s  e.  ( ( TEndo `  k ) `  w ) ,  t  e.  ( ( TEndo `  k
 ) `  w )  |->  ( t  o.  s
 ) ) >. } )
 )
 
Definitiondf-edring 30946* Define division ring on trace-preserving endomorphisms. The multiplication operation is reversed composition, per the definition of E of [Crawley] p. 117, 4th line from bottom. (Contributed by NM, 8-Jun-2013.)
 |-  EDRing  =  ( k  e.  _V  |->  ( w  e.  ( LHyp `  k )  |->  { <. (
 Base `  ndx ) ,  ( ( TEndo `  k
 ) `  w ) >. ,  <. ( +g  `  ndx ) ,  ( s  e.  ( ( TEndo `  k
 ) `  w ) ,  t  e.  (
 ( TEndo `  k ) `  w )  |->  ( f  e.  ( ( LTrn `  k ) `  w )  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )
 >. ,  <. ( .r `  ndx ) ,  ( s  e.  ( ( TEndo `  k ) `  w ) ,  t  e.  ( ( TEndo `  k
 ) `  w )  |->  ( s  o.  t
 ) ) >. } )
 )
 
Theoremtendofset 30947* The set of all trace-preserving endomorphisms on the set of translations for a lattice  K. (Contributed by NM, 8-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |-  H  =  ( LHyp `  K )   =>    |-  ( K  e.  V  ->  ( TEndo `  K )  =  ( w  e.  H  |->  { s  |  ( s : ( ( LTrn `  K ) `  w )
 --> ( ( LTrn `  K ) `  w )  /\  A. f  e.  ( (
 LTrn `  K ) `  w ) A. g  e.  ( ( LTrn `  K ) `  w ) ( s `  ( f  o.  g ) )  =  ( ( s `
  f )  o.  ( s `  g
 ) )  /\  A. f  e.  ( ( LTrn `  K ) `  w ) ( ( ( trL `  K ) `  w ) `  ( s `  f
 ) )  .<_  ( ( ( trL `  K ) `  w ) `  f ) ) }
 ) )
 
Theoremtendoset 30948* The set of trace-preserving endomorphisms on the set of translations for a fiducial co-atom  W. (Contributed by NM, 8-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  E  =  { s  |  ( s : T --> T  /\  A. f  e.  T  A. g  e.  T  (
 s `  ( f  o.  g ) )  =  ( ( s `  f )  o.  (
 s `  g )
 )  /\  A. f  e.  T  ( R `  ( s `  f
 ) )  .<_  ( R `
  f ) ) } )
 
Theoremistendo 30949* The predicate "is a trace-preserving endomorphism". Similar to definition of trace-preserving endomorphism in [Crawley] p. 117, penultimate line. (Contributed by NM, 8-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  ( S  e.  E  <->  ( S : T
 --> T  /\  A. f  e.  T  A. g  e.  T  ( S `  ( f  o.  g
 ) )  =  ( ( S `  f
 )  o.  ( S `
  g ) ) 
 /\  A. f  e.  T  ( R `  ( S `
  f ) ) 
 .<_  ( R `  f
 ) ) ) )
 
Theoremtendotp 30950 Trace-preserving property of a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  V  /\  W  e.  H )  /\  S  e.  E  /\  F  e.  T )  ->  ( R `  ( S `  F ) ) 
 .<_  ( R `  F ) )
 
Theoremistendod 30951* Deduce the predicate "is a trace-preserving endomorphism". (Contributed by NM, 9-Jun-2013.)
 |-  .<_  =  ( le `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  R  =  ( ( trL `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  ( ph  ->  ( K  e.  V  /\  W  e.  H ) )   &    |-  ( ph  ->  S : T --> T )   &    |-  ( ( ph  /\  f  e.  T  /\  g  e.  T )  ->  ( S `  ( f  o.  g ) )  =  ( ( S `  f )  o.  ( S `  g ) ) )   &    |-  ( ( ph  /\  f  e.  T ) 
 ->  ( R `  ( S `  f ) ) 
 .<_  ( R `  f
 ) )   =>    |-  ( ph  ->  S  e.  E )
 
Theoremtendof 30952 Functionality of a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  V  /\  W  e.  H )  /\  S  e.  E ) 
 ->  S : T --> T )
 
Theoremtendoeq1 30953* Condition determining equality of two trace-preserving endomorphisms. (Contributed by NM, 11-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  A. f  e.  T  ( U `  f )  =  ( V `  f ) )  ->  U  =  V )
 
Theoremtendovalco 30954 Value of composition of translations in a a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  V  /\  W  e.  H  /\  S  e.  E )  /\  ( F  e.  T  /\  G  e.  T ) )  ->  ( S `  ( F  o.  G ) )  =  (
 ( S `  F )  o.  ( S `  G ) ) )
 
Theoremtendocoval 30955 Value of composition of endomorphisms in a a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  X  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  F  e.  T )  ->  ( ( U  o.  V ) `  F )  =  ( U `  ( V `  F ) ) )
 
Theoremtendocl 30956 Closure of a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  V  /\  W  e.  H )  /\  S  e.  E  /\  F  e.  T )  ->  ( S `  F )  e.  T )
 
Theoremtendoco2 30957 Distribution of compositions in preparation for endomorphism sum definition. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  ( F  e.  T  /\  G  e.  T ) )  ->  ( ( U `  ( F  o.  G ) )  o.  ( V `  ( F  o.  G ) ) )  =  ( ( ( U `
  F )  o.  ( V `  F ) )  o.  (
 ( U `  G )  o.  ( V `  G ) ) ) )
 
Theoremtendoidcl 30958 The identity is a trace-preserving endomorphism. (Contributed by NM, 30-Jul-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( K  e.  HL  /\  W  e.  H )  ->  (  _I  |`  T )  e.  E )
 
Theoremtendo1mul 30959 Multiplicative identity multiplied by a trace-preserving endomorphism. (Contributed by NM, 20-Nov-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E ) 
 ->  ( (  _I  |`  T )  o.  U )  =  U )
 
Theoremtendo1mulr 30960 Multiplicative identity multiplied by a trace-preserving endomorphism. (Contributed by NM, 20-Nov-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E ) 
 ->  ( U  o.  (  _I  |`  T ) )  =  U )
 
Theoremtendococl 30961 The composition of two trace-preserving endomorphisms (multiplication in the endormorphism ring) is a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E  /\  T  e.  E )  ->  ( S  o.  T )  e.  E )
 
Theoremtendoid 30962 The identity value of a trace-preserving endomorphism. (Contributed by NM, 21-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E ) 
 ->  ( S `  (  _I  |`  B ) )  =  (  _I  |`  B ) )
 
Theoremtendoeq2 30963* Condition determining equality of two trace-preserving endomorphisms, showing it is unnecessary to consider the identity translation. In tendocan 31013, we show that we only need to consider a single non-identity translation. (Contributed by NM, 21-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  A. f  e.  T  ( f  =/=  (  _I  |`  B )  ->  ( U `  f )  =  ( V `  f ) ) ) 
 ->  U  =  V )
 
Theoremtendoplcbv 30964* Define sum operation for trace-perserving endomorphisms. Change bound variables to isolate them later. (Contributed by NM, 11-Jun-2013.)
 |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  P  =  ( u  e.  E ,  v  e.  E  |->  ( g  e.  T  |->  ( ( u `  g )  o.  ( v `  g ) ) ) )
 
Theoremtendopl 30965* Value of endomorphism sum operation. (Contributed by NM, 10-Jun-2013.)
 |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( U  e.  E  /\  V  e.  E )  ->  ( U P V )  =  ( g  e.  T  |->  ( ( U `  g )  o.  ( V `  g ) ) ) )
 
Theoremtendopl2 30966* Value of result of endomorphism sum operation. (Contributed by NM, 10-Jun-2013.)
 |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( U  e.  E  /\  V  e.  E  /\  F  e.  T )  ->  ( ( U P V ) `
  F )  =  ( ( U `  F )  o.  ( V `  F ) ) )
 
Theoremtendoplcl2 30967* Value of result of endomorphism sum operation. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  F  e.  T )  ->  ( ( U P V ) `  F )  e.  T )
 
Theoremtendoplco2 30968* Value of result of endomorphism sum operation on a translation composition. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) 
 /\  ( F  e.  T  /\  G  e.  T ) )  ->  ( ( U P V ) `
  ( F  o.  G ) )  =  ( ( ( U P V ) `  F )  o.  (
 ( U P V ) `  G ) ) )
 
Theoremtendopltp 30969* Trace-preserving property of endomorphism sum operation  P, based on theorem trlco 30916. Part of remark in [Crawley] p. 118, 2nd line, "it is clear from the second part of G (our trlco 30916) that Delta is a subring of E." (In our development, we will bypass their E and go directly to their Delta, whose base set is our  ( TEndo `  K
) `  W.) (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   &    |-  .<_  =  ( le `  K )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E )  /\  F  e.  T ) 
 ->  ( R `  (
 ( U P V ) `  F ) ) 
 .<_  ( R `  F ) )
 
Theoremtendoplcl 30970* Endomorphism sum is a trace-preserving endomorphism. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E  /\  V  e.  E )  ->  ( U P V )  e.  E )
 
Theoremtendoplcom 30971* The endomorphism sum operation is commutative. (Contributed by NM, 11-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E  /\  V  e.  E )  ->  ( U P V )  =  ( V P U ) )
 
Theoremtendoplass 30972* The endomorphism sum operation is associative. (Contributed by NM, 11-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( S  e.  E  /\  U  e.  E  /\  V  e.  E )
 )  ->  ( ( S P U ) P V )  =  ( S P ( U P V ) ) )
 
Theoremtendodi1 30973* Endomorphism composition distributes over sum. (Contributed by NM, 13-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( S  e.  E  /\  U  e.  E  /\  V  e.  E )
 )  ->  ( S  o.  ( U P V ) )  =  (
 ( S  o.  U ) P ( S  o.  V ) ) )
 
Theoremtendodi2 30974* Endomorphism composition distributes over sum. (Contributed by NM, 13-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( S  e.  E  /\  U  e.  E  /\  V  e.  E )
 )  ->  ( ( S P U )  o.  V )  =  ( ( S  o.  V ) P ( U  o.  V ) ) )
 
Theoremtendo0cbv 30975* Define additive identity for trace-perserving endomorphisms. Change bound variable to isolate it later. (Contributed by NM, 11-Jun-2013.)
 |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   =>    |-  O  =  ( g  e.  T  |->  (  _I  |`  B ) )
 
Theoremtendo02 30976* Value of additive identity endomorphism. (Contributed by NM, 11-Jun-2013.)
 |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   &    |-  B  =  ( Base `  K )   =>    |-  ( F  e.  T  ->  ( O `  F )  =  (  _I  |`  B ) )
 
Theoremtendo0co2 30977* The additive identity trace-perserving endormorphism preserves composition of translations. TODO: why isn't this a special case of tendospdi1 31210? (Contributed by NM, 11-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  ->  ( O `
  ( F  o.  G ) )  =  ( ( O `  F )  o.  ( O `  G ) ) )
 
Theoremtendo0tp 30978* Trace-preserving property of endomorphism additive identity. (Contributed by NM, 11-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   &    |- 
 .<_  =  ( le `  K )   &    |-  R  =  ( ( trL `  K ) `  W )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T )  ->  ( R `  ( O `  F ) )  .<_  ( R `  F ) )
 
Theoremtendo0cl 30979* The additive identity is a trace-perserving endormorphism. (Contributed by NM, 12-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   =>    |-  ( ( K  e.  HL  /\  W  e.  H )  ->  O  e.  E )
 
Theoremtendo0pl 30980* Property of the additive identity endormorphism. (Contributed by NM, 12-Jun-2013.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E )  ->  ( O P S )  =  S )
 
Theoremtendo0plr 30981* Property of the additive identity endormorphism. (Contributed by NM, 21-Feb-2014.)
 |-  B  =  ( Base `  K )   &    |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E )  ->  ( S P O )  =  S )
 
Theoremtendoicbv 30982* Define inverse function for trace-perserving endomorphisms. Change bound variable to isolate it later. (Contributed by NM, 12-Jun-2013.)
 |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   =>    |-  I  =  ( u  e.  E  |->  ( g  e.  T  |->  `' ( u `  g
 ) ) )
 
Theoremtendoi 30983* Value of inverse endomorphism. (Contributed by NM, 12-Jun-2013.)
 |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( S  e.  E  ->  ( I `  S )  =  (
 g  e.  T  |->  `' ( S `  g
 ) ) )
 
Theoremtendoi2 30984* Value of additive inverse endomorphism. (Contributed by NM, 12-Jun-2013.)
 |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   &    |-  T  =  ( ( LTrn `  K ) `  W )   =>    |-  ( ( S  e.  E  /\  F  e.  T )  ->  (
 ( I `  S ) `  F )  =  `' ( S `  F ) )
 
Theoremtendoicl 30985* Closure of the additive inverse endomorphism. (Contributed by NM, 12-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E ) 
 ->  ( I `  S )  e.  E )
 
Theoremtendoipl 30986* Property of the additive inverse endomorphism. (Contributed by NM, 12-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   &    |-  B  =  ( Base `  K )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E )  ->  (
 ( I `  S ) P S )  =  O )
 
Theoremtendoipl2 30987* Property of the additive inverse endomorphism. (Contributed by NM, 29-Sep-2014.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  I  =  ( s  e.  E  |->  ( f  e.  T  |->  `' ( s `  f
 ) ) )   &    |-  B  =  ( Base `  K )   &    |-  P  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  (
 t `  f )
 ) ) )   &    |-  O  =  ( f  e.  T  |->  (  _I  |`  B )
 )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  S  e.  E )  ->  ( S P ( I `  S ) )  =  O )
 
Theoremerngfset 30988* The division rings on trace-preserving endomorphisms for a lattice  K. (Contributed by NM, 8-Jun-2013.)
 |-  H  =  ( LHyp `  K )   =>    |-  ( K  e.  V  ->  (
 EDRing `  K )  =  ( w  e.  H  |->  {
 <. ( Base `  ndx ) ,  ( ( TEndo `  K ) `  w ) >. , 
 <. ( +g  `  ndx ) ,  ( s  e.  ( ( TEndo `  K ) `  w ) ,  t  e.  ( (
 TEndo `  K ) `  w )  |->  ( f  e.  ( ( LTrn `  K ) `  w )  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )
 >. ,  <. ( .r `  ndx ) ,  ( s  e.  ( ( TEndo `  K ) `  w ) ,  t  e.  ( ( TEndo `  K ) `  w )  |->  ( s  o.  t ) ) >. } ) )
 
Theoremerngset 30989* The division ring on trace-preserving endomorphisms for a fiducial co-atom  W. (Contributed by NM, 5-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  D  =  { <. ( Base `  ndx ) ,  E >. , 
 <. ( +g  `  ndx ) ,  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) )
 >. ,  <. ( .r `  ndx ) ,  ( s  e.  E ,  t  e.  E  |->  ( s  o.  t ) ) >. } )
 
Theoremerngbase 30990 The base set of the division ring on trace-preserving endomorphisms is the set of all trace-preserving endomorphisms (for a fiducial co-atom  W). TODO: the .t hypothesis isn't used. (Also look at others.) (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  C  =  ( Base `  D )   =>    |-  (
 ( K  e.  V  /\  W  e.  H ) 
 ->  C  =  E )
 
Theoremerngfplus 30991* Ring addition operation. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  .+  =  ( +g  `  D )   =>    |-  (
 ( K  e.  V  /\  W  e.  H ) 
 ->  .+  =  ( s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `
  f )  o.  ( t `  f
 ) ) ) ) )
 
Theoremerngplus 30992* Ring addition operation. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  .+  =  ( +g  `  D )   =>    |-  (
 ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E ) )  ->  ( U 
 .+  V )  =  ( f  e.  T  |->  ( ( U `  f )  o.  ( V `  f ) ) ) )
 
Theoremerngplus2 30993 Ring addition operation. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  .+  =  ( +g  `  D )   =>    |-  (
 ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  F  e.  T ) )  ->  ( ( U  .+  V ) `  F )  =  (
 ( U `  F )  o.  ( V `  F ) ) )
 
Theoremerngfmul 30994* Ring multiplication operation. (Contributed by NM, 9-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  .x.  =  ( .r `  D )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  .x.  =  (
 s  e.  E ,  t  e.  E  |->  ( s  o.  t ) ) )
 
Theoremerngmul 30995 Ring addition operation. (Contributed by NM, 10-Jun-2013.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing `  K ) `  W )   &    |-  .x.  =  ( .r `  D )   =>    |-  ( ( ( K  e.  X  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E )
 )  ->  ( U  .x.  V )  =  ( U  o.  V ) )
 
Theoremerngfset-rN 30996* The division rings on trace-preserving endomorphisms for a lattice  K. (Contributed by NM, 8-Jun-2013.) (New usage is discouraged.)
 |-  H  =  ( LHyp `  K )   =>    |-  ( K  e.  V  ->  (
 EDRing R `  K )  =  ( w  e.  H  |->  { <. ( Base `  ndx ) ,  ( ( TEndo `  K ) `  w ) >. ,  <. (
 +g  `  ndx ) ,  ( s  e.  (
 ( TEndo `  K ) `  w ) ,  t  e.  ( ( TEndo `  K ) `  w )  |->  ( f  e.  ( (
 LTrn `  K ) `  w )  |->  ( ( s `  f )  o.  ( t `  f ) ) ) ) >. ,  <. ( .r
 `  ndx ) ,  (
 s  e.  ( (
 TEndo `  K ) `  w ) ,  t  e.  ( ( TEndo `  K ) `  w )  |->  ( t  o.  s ) ) >. } ) )
 
Theoremerngset-rN 30997* The division ring on trace-preserving endomorphisms for a fiducial co-atom  W. (Contributed by NM, 5-Jun-2013.) (New usage is discouraged.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing R `  K ) `  W )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  D  =  { <. ( Base `  ndx ) ,  E >. ,  <. ( +g  ` 
 ndx ) ,  (
 s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  ( t `  f ) ) ) ) >. ,  <. ( .r
 `  ndx ) ,  (
 s  e.  E ,  t  e.  E  |->  ( t  o.  s ) )
 >. } )
 
Theoremerngbase-rN 30998 The base set of the division ring on trace-preserving endomorphisms is the set of all trace-preserving endomorphisms (for a fiducial co-atom  W). (Contributed by NM, 9-Jun-2013.) (New usage is discouraged.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing R `  K ) `  W )   &    |-  C  =  ( Base `  D )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  C  =  E )
 
Theoremerngfplus-rN 30999* Ring addition operation. (Contributed by NM, 9-Jun-2013.) (New usage is discouraged.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing R `  K ) `  W )   &    |- 
 .+  =  ( +g  `  D )   =>    |-  ( ( K  e.  V  /\  W  e.  H )  ->  .+  =  (
 s  e.  E ,  t  e.  E  |->  ( f  e.  T  |->  ( ( s `  f )  o.  ( t `  f ) ) ) ) )
 
Theoremerngplus-rN 31000* Ring addition operation. (Contributed by NM, 10-Jun-2013.) (New usage is discouraged.)
 |-  H  =  ( LHyp `  K )   &    |-  T  =  ( ( LTrn `  K ) `  W )   &    |-  E  =  ( ( TEndo `  K ) `  W )   &    |-  D  =  ( ( EDRing R `  K ) `  W )   &    |- 
 .+  =  ( +g  `  D )   =>    |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E )
 )  ->  ( U  .+  V )  =  ( f  e.  T  |->  ( ( U `  f
 )  o.  ( V `
  f ) ) ) )
    < 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-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32154
  Copyright terms: Public domain < Previous  Next >