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

Theorem ltrncoval 31016
Description: Two ways to express value of translation composition. (Contributed by NM, 31-May-2013.)
Hypotheses
Ref Expression
ltrnel.l  |-  .<_  =  ( le `  K )
ltrnel.a  |-  A  =  ( Atoms `  K )
ltrnel.h  |-  H  =  ( LHyp `  K
)
ltrnel.t  |-  T  =  ( ( LTrn `  K
) `  W )
Assertion
Ref Expression
ltrncoval  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  (
( F  o.  G
) `  P )  =  ( F `  ( G `  P ) ) )

Proof of Theorem ltrncoval
StepHypRef Expression
1 simp1 958 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 simp2r 985 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  G  e.  T )
3 eqid 2438 . . . . 5  |-  ( Base `  K )  =  (
Base `  K )
4 ltrnel.h . . . . 5  |-  H  =  ( LHyp `  K
)
5 ltrnel.t . . . . 5  |-  T  =  ( ( LTrn `  K
) `  W )
63, 4, 5ltrn1o 30995 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  G  e.  T
)  ->  G :
( Base `  K ) -1-1-onto-> ( Base `  K ) )
71, 2, 6syl2anc 644 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  G : ( Base `  K
)
-1-1-onto-> ( Base `  K )
)
8 f1of 5677 . . 3  |-  ( G : ( Base `  K
)
-1-1-onto-> ( Base `  K )  ->  G : ( Base `  K ) --> ( Base `  K ) )
97, 8syl 16 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  G : ( Base `  K
) --> ( Base `  K
) )
10 ltrnel.a . . . 4  |-  A  =  ( Atoms `  K )
113, 10atbase 30161 . . 3  |-  ( P  e.  A  ->  P  e.  ( Base `  K
) )
12113ad2ant3 981 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  P  e.  ( Base `  K
) )
13 fvco3 5803 . 2  |-  ( ( G : ( Base `  K ) --> ( Base `  K )  /\  P  e.  ( Base `  K
) )  ->  (
( F  o.  G
) `  P )  =  ( F `  ( G `  P ) ) )
149, 12, 13syl2anc 644 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  (
( F  o.  G
) `  P )  =  ( F `  ( G `  P ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1726    o. ccom 4885   -->wf 5453   -1-1-onto->wf1o 5456   ` cfv 5457   Basecbs 13474   lecple 13541   Atomscatm 30135   HLchlt 30222   LHypclh 30855   LTrncltrn 30972
This theorem is referenced by:  cdlemg41  31589  trlcoabs  31592  trlcoabs2N  31593  trlcolem  31597  cdlemg44  31604  cdlemi2  31690  cdlemk2  31703  cdlemk4  31705  cdlemk8  31709  dia2dimlem4  31939  dihjatcclem3  32292
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-rep 4323  ax-sep 4333  ax-nul 4341  ax-pow 4380  ax-pr 4406  ax-un 4704
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-iun 4097  df-br 4216  df-opab 4270  df-mpt 4271  df-id 4501  df-xp 4887  df-rel 4888  df-cnv 4889  df-co 4890  df-dm 4891  df-rn 4892  df-res 4893  df-ima 4894  df-iota 5421  df-fun 5459  df-fn 5460  df-f 5461  df-f1 5462  df-fo 5463  df-f1o 5464  df-fv 5465  df-ov 6087  df-oprab 6088  df-mpt2 6089  df-map 7023  df-ats 30139  df-laut 30860  df-ldil 30975  df-ltrn 30976
  Copyright terms: Public domain W3C validator