Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ltrncoidN Unicode version

Theorem ltrncoidN 30939
Description: Two translations are equal if the composition of one with the converse of the other is the zero translation. This is an analog of vector subtraction. (Contributed by NM, 7-Apr-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
ltrn1o.b  |-  B  =  ( Base `  K
)
ltrn1o.h  |-  H  =  ( LHyp `  K
)
ltrn1o.t  |-  T  =  ( ( LTrn `  K
) `  W )
Assertion
Ref Expression
ltrncoidN  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T
)  ->  ( ( F  o.  `' G
)  =  (  _I  |`  B )  <->  F  =  G ) )

Proof of Theorem ltrncoidN
StepHypRef Expression
1 simpl1 958 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( K  e.  HL  /\  W  e.  H ) )
2 simpl3 960 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  G  e.  T )
3 ltrn1o.b . . . . . . . . 9  |-  B  =  ( Base `  K
)
4 ltrn1o.h . . . . . . . . 9  |-  H  =  ( LHyp `  K
)
5 ltrn1o.t . . . . . . . . 9  |-  T  =  ( ( LTrn `  K
) `  W )
63, 4, 5ltrn1o 30935 . . . . . . . 8  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  G  e.  T
)  ->  G : B
-1-1-onto-> B )
71, 2, 6syl2anc 642 . . . . . . 7  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  G : B -1-1-onto-> B )
8 f1ococnv1 5518 . . . . . . 7  |-  ( G : B -1-1-onto-> B  ->  ( `' G  o.  G )  =  (  _I  |`  B ) )
97, 8syl 15 . . . . . 6  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( `' G  o.  G )  =  (  _I  |`  B )
)
109coeq2d 4862 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( F  o.  ( `' G  o.  G
) )  =  ( F  o.  (  _I  |`  B ) ) )
11 simpl2 959 . . . . . . 7  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  e.  T )
123, 4, 5ltrn1o 30935 . . . . . . 7  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T
)  ->  F : B
-1-1-onto-> B )
131, 11, 12syl2anc 642 . . . . . 6  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F : B -1-1-onto-> B )
14 f1of 5488 . . . . . 6  |-  ( F : B -1-1-onto-> B  ->  F : B
--> B )
15 fcoi1 5431 . . . . . 6  |-  ( F : B --> B  -> 
( F  o.  (  _I  |`  B ) )  =  F )
1613, 14, 153syl 18 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( F  o.  (  _I  |`  B ) )  =  F )
1710, 16eqtr2d 2329 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  =  ( F  o.  ( `' G  o.  G ) ) )
18 coass 5207 . . . 4  |-  ( ( F  o.  `' G
)  o.  G )  =  ( F  o.  ( `' G  o.  G
) )
1917, 18syl6eqr 2346 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  =  ( ( F  o.  `' G
)  o.  G ) )
20 simpr 447 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( F  o.  `' G )  =  (  _I  |`  B )
)
2120coeq1d 4861 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( ( F  o.  `' G )  o.  G
)  =  ( (  _I  |`  B )  o.  G ) )
22 f1of 5488 . . . . 5  |-  ( G : B -1-1-onto-> B  ->  G : B
--> B )
23 fcoi2 5432 . . . . 5  |-  ( G : B --> B  -> 
( (  _I  |`  B )  o.  G )  =  G )
247, 22, 233syl 18 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( (  _I  |`  B )  o.  G )  =  G )
2521, 24eqtrd 2328 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  -> 
( ( F  o.  `' G )  o.  G
)  =  G )
2619, 25eqtrd 2328 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  =  G )
27 simpr 447 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  F  =  G )
2827coeq1d 4861 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  ( F  o.  `' G
)  =  ( G  o.  `' G ) )
29 simpl1 958 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  ( K  e.  HL  /\  W  e.  H ) )
30 simpl3 960 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  G  e.  T )
3129, 30, 6syl2anc 642 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  G : B -1-1-onto-> B )
32 f1ococnv2 5516 . . . 4  |-  ( G : B -1-1-onto-> B  ->  ( G  o.  `' G )  =  (  _I  |`  B )
)
3331, 32syl 15 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  ( G  o.  `' G
)  =  (  _I  |`  B ) )
3428, 33eqtrd 2328 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  F  =  G )  ->  ( F  o.  `' G
)  =  (  _I  |`  B ) )
3526, 34impbida 805 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T
)  ->  ( ( F  o.  `' G
)  =  (  _I  |`  B )  <->  F  =  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    _I cid 4320   `'ccnv 4704    |` cres 4707    o. ccom 4709   -->wf 5267   -1-1-onto->wf1o 5270   ` cfv 5271   Basecbs 13164   HLchlt 30162   LHypclh 30795   LTrncltrn 30912
This theorem is referenced by:  tendospcanN  31835
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-map 6790  df-laut 30800  df-ldil 30915  df-ltrn 30916
  Copyright terms: Public domain W3C validator