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

Theorem dibval 31332
Description: The partial isomorphism B for a lattice  K. (Contributed by NM, 8-Dec-2013.)
Hypotheses
Ref Expression
dibval.b  |-  B  =  ( Base `  K
)
dibval.h  |-  H  =  ( LHyp `  K
)
dibval.t  |-  T  =  ( ( LTrn `  K
) `  W )
dibval.o  |-  .0.  =  ( f  e.  T  |->  (  _I  |`  B ) )
dibval.j  |-  J  =  ( ( DIsoA `  K
) `  W )
dibval.i  |-  I  =  ( ( DIsoB `  K
) `  W )
Assertion
Ref Expression
dibval  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  (
I `  X )  =  ( ( J `
 X )  X. 
{  .0.  } ) )
Distinct variable groups:    f, K    f, W
Allowed substitution hints:    B( f)    T( f)    H( f)    I( f)    J( f)    V( f)    X( f)    .0. ( f)

Proof of Theorem dibval
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 dibval.b . . . . 5  |-  B  =  ( Base `  K
)
2 dibval.h . . . . 5  |-  H  =  ( LHyp `  K
)
3 dibval.t . . . . 5  |-  T  =  ( ( LTrn `  K
) `  W )
4 dibval.o . . . . 5  |-  .0.  =  ( f  e.  T  |->  (  _I  |`  B ) )
5 dibval.j . . . . 5  |-  J  =  ( ( DIsoA `  K
) `  W )
6 dibval.i . . . . 5  |-  I  =  ( ( DIsoB `  K
) `  W )
71, 2, 3, 4, 5, 6dibfval 31331 . . . 4  |-  ( ( K  e.  V  /\  W  e.  H )  ->  I  =  ( x  e.  dom  J  |->  ( ( J `  x
)  X.  {  .0.  } ) ) )
87adantr 451 . . 3  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  I  =  ( x  e. 
dom  J  |->  ( ( J `  x )  X.  {  .0.  }
) ) )
98fveq1d 5527 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  (
I `  X )  =  ( ( x  e.  dom  J  |->  ( ( J `  x
)  X.  {  .0.  } ) ) `  X
) )
10 fveq2 5525 . . . . 5  |-  ( x  =  X  ->  ( J `  x )  =  ( J `  X ) )
1110xpeq1d 4712 . . . 4  |-  ( x  =  X  ->  (
( J `  x
)  X.  {  .0.  } )  =  ( ( J `  X )  X.  {  .0.  }
) )
12 eqid 2283 . . . 4  |-  ( x  e.  dom  J  |->  ( ( J `  x
)  X.  {  .0.  } ) )  =  ( x  e.  dom  J  |->  ( ( J `  x )  X.  {  .0.  } ) )
13 fvex 5539 . . . . 5  |-  ( J `
 X )  e. 
_V
14 snex 4216 . . . . 5  |-  {  .0.  }  e.  _V
1513, 14xpex 4801 . . . 4  |-  ( ( J `  X )  X.  {  .0.  }
)  e.  _V
1611, 12, 15fvmpt 5602 . . 3  |-  ( X  e.  dom  J  -> 
( ( x  e. 
dom  J  |->  ( ( J `  x )  X.  {  .0.  }
) ) `  X
)  =  ( ( J `  X )  X.  {  .0.  }
) )
1716adantl 452 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  (
( x  e.  dom  J 
|->  ( ( J `  x )  X.  {  .0.  } ) ) `  X )  =  ( ( J `  X
)  X.  {  .0.  } ) )
189, 17eqtrd 2315 1  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  (
I `  X )  =  ( ( J `
 X )  X. 
{  .0.  } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   {csn 3640    e. cmpt 4077    _I cid 4304    X. cxp 4687   dom cdm 4689    |` cres 4691   ` cfv 5255   Basecbs 13148   LHypclh 30173   LTrncltrn 30290   DIsoAcdia 31218   DIsoBcdib 31328
This theorem is referenced by:  dibopelvalN  31333  dibval2  31334  dibvalrel  31353
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-dib 31329
  Copyright terms: Public domain W3C validator