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

Theorem dibval3N 36435
Description: Value of the partial isomorphism B for a lattice  K. (Contributed by NM, 24-Feb-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
dibval3.b  |-  B  =  ( Base `  K
)
dibval3.l  |-  .<_  =  ( le `  K )
dibval3.h  |-  H  =  ( LHyp `  K
)
dibval3.t  |-  T  =  ( ( LTrn `  K
) `  W )
dibval3.r  |-  R  =  ( ( trL `  K
) `  W )
dibval3.o  |-  .0.  =  ( g  e.  T  |->  (  _I  |`  B ) )
dibval3.i  |-  I  =  ( ( DIsoB `  K
) `  W )
Assertion
Ref Expression
dibval3N  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( X  e.  B  /\  X  .<_  W ) )  ->  (
I `  X )  =  ( { f  e.  T  |  ( R `  f ) 
.<_  X }  X.  {  .0.  } ) )
Distinct variable groups:    f, K    g, K    T, f    f, W   
g, W    f, X
Allowed substitution hints:    B( f, g)    R( f, g)    T( g)    H( f, g)    I( f, g)    .<_ ( f, g)    V( f, g)    X( g)    .0. ( f, g)

Proof of Theorem dibval3N
StepHypRef Expression
1 dibval3.b . . 3  |-  B  =  ( Base `  K
)
2 dibval3.l . . 3  |-  .<_  =  ( le `  K )
3 dibval3.h . . 3  |-  H  =  ( LHyp `  K
)
4 dibval3.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
5 dibval3.o . . 3  |-  .0.  =  ( g  e.  T  |->  (  _I  |`  B ) )
6 eqid 2622 . . 3  |-  ( (
DIsoA `  K ) `  W )  =  ( ( DIsoA `  K ) `  W )
7 dibval3.i . . 3  |-  I  =  ( ( DIsoB `  K
) `  W )
81, 2, 3, 4, 5, 6, 7dibval2 36433 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( X  e.  B  /\  X  .<_  W ) )  ->  (
I `  X )  =  ( ( ( ( DIsoA `  K ) `  W ) `  X
)  X.  {  .0.  } ) )
9 dibval3.r . . . 4  |-  R  =  ( ( trL `  K
) `  W )
101, 2, 3, 4, 9, 6diaval 36321 . . 3  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( X  e.  B  /\  X  .<_  W ) )  ->  (
( ( DIsoA `  K
) `  W ) `  X )  =  {
f  e.  T  | 
( R `  f
)  .<_  X } )
1110xpeq1d 5138 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( X  e.  B  /\  X  .<_  W ) )  ->  (
( ( ( DIsoA `  K ) `  W
) `  X )  X.  {  .0.  } )  =  ( { f  e.  T  |  ( R `  f ) 
.<_  X }  X.  {  .0.  } ) )
128, 11eqtrd 2656 1  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( X  e.  B  /\  X  .<_  W ) )  ->  (
I `  X )  =  ( { f  e.  T  |  ( R `  f ) 
.<_  X }  X.  {  .0.  } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   {crab 2916   {csn 4177   class class class wbr 4653    |-> cmpt 4729    _I cid 5023    X. cxp 5112    |` cres 5116   ` cfv 5888   Basecbs 15857   lecple 15948   LHypclh 35270   LTrncltrn 35387   trLctrl 35445   DIsoAcdia 36317   DIsoBcdib 36427
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-disoa 36318  df-dib 36428
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator