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

Theorem ltrncoval 33789
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 988 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 simp2r 1015 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  G  e.  T )
3 eqid 2443 . . . . 5  |-  ( Base `  K )  =  (
Base `  K )
4 ltrnel.h . . . . 5  |-  H  =  ( LHyp `  K
)
5 ltrnel.t . . . . 5  |-  T  =  ( ( LTrn `  K
) `  W )
63, 4, 5ltrn1o 33768 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  G  e.  T
)  ->  G :
( Base `  K ) -1-1-onto-> ( Base `  K ) )
71, 2, 6syl2anc 661 . . 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 5641 . . 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 32934 . . 3  |-  ( P  e.  A  ->  P  e.  ( Base `  K
) )
12113ad2ant3 1011 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  G  e.  T )  /\  P  e.  A )  ->  P  e.  ( Base `  K
) )
13 fvco3 5768 . 2  |-  ( ( G : ( Base `  K ) --> ( Base `  K )  /\  P  e.  ( Base `  K
) )  ->  (
( F  o.  G
) `  P )  =  ( F `  ( G `  P ) ) )
149, 12, 13syl2anc 661 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 setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756    o. ccom 4844   -->wf 5414   -1-1-onto->wf1o 5417   ` cfv 5418   Basecbs 14174   lecple 14245   Atomscatm 32908   HLchlt 32995   LHypclh 33628   LTrncltrn 33745
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4403  ax-sep 4413  ax-nul 4421  ax-pow 4470  ax-pr 4531  ax-un 6372
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-ne 2608  df-ral 2720  df-rex 2721  df-reu 2722  df-rab 2724  df-v 2974  df-sbc 3187  df-csb 3289  df-dif 3331  df-un 3333  df-in 3335  df-ss 3342  df-nul 3638  df-if 3792  df-pw 3862  df-sn 3878  df-pr 3880  df-op 3884  df-uni 4092  df-iun 4173  df-br 4293  df-opab 4351  df-mpt 4352  df-id 4636  df-xp 4846  df-rel 4847  df-cnv 4848  df-co 4849  df-dm 4850  df-rn 4851  df-res 4852  df-ima 4853  df-iota 5381  df-fun 5420  df-fn 5421  df-f 5422  df-f1 5423  df-fo 5424  df-f1o 5425  df-fv 5426  df-ov 6094  df-oprab 6095  df-mpt2 6096  df-map 7216  df-ats 32912  df-laut 33633  df-ldil 33748  df-ltrn 33749
This theorem is referenced by:  cdlemg41  34362  trlcoabs  34365  trlcoabs2N  34366  trlcolem  34370  cdlemg44  34377  cdlemi2  34463  cdlemk2  34476  cdlemk4  34478  cdlemk8  34482  dia2dimlem4  34712  dihjatcclem3  35065
  Copyright terms: Public domain W3C validator