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

Theorem ltrncoidN 30317
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 30313 . . . . . . . 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 5502 . . . . . . 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 4846 . . . . 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 30313 . . . . . . 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 5472 . . . . . 6  |-  ( F : B -1-1-onto-> B  ->  F : B
--> B )
15 fcoi1 5415 . . . . . 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 2316 . . . 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 5191 . . . 4  |-  ( ( F  o.  `' G
)  o.  G )  =  ( F  o.  ( `' G  o.  G
) )
1917, 18syl6eqr 2333 . . 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 4845 . . . 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 5472 . . . . 5  |-  ( G : B -1-1-onto-> B  ->  G : B
--> B )
23 fcoi2 5416 . . . . 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 2315 . . 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 2315 . 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 4845 . . 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 5500 . . . 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 2315 . 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 1623    e. wcel 1684    _I cid 4304   `'ccnv 4688    |` cres 4691    o. ccom 4693   -->wf 5251   -1-1-onto->wf1o 5254   ` cfv 5255   Basecbs 13148   HLchlt 29540   LHypclh 30173   LTrncltrn 30290
This theorem is referenced by:  tendospcanN  31213
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-map 6774  df-laut 30178  df-ldil 30293  df-ltrn 30294
  Copyright terms: Public domain W3C validator