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

Theorem dicval2 36468
Description: The partial isomorphism C for a lattice  K. (Contributed by NM, 20-Feb-2014.)
Hypotheses
Ref Expression
dicval.l  |-  .<_  =  ( le `  K )
dicval.a  |-  A  =  ( Atoms `  K )
dicval.h  |-  H  =  ( LHyp `  K
)
dicval.p  |-  P  =  ( ( oc `  K ) `  W
)
dicval.t  |-  T  =  ( ( LTrn `  K
) `  W )
dicval.e  |-  E  =  ( ( TEndo `  K
) `  W )
dicval.i  |-  I  =  ( ( DIsoC `  K
) `  W )
dicval2.g  |-  G  =  ( iota_ g  e.  T  ( g `  P
)  =  Q )
Assertion
Ref Expression
dicval2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( I `  Q
)  =  { <. f ,  s >.  |  ( f  =  ( s `
 G )  /\  s  e.  E ) } )
Distinct variable groups:    f, g,
s, K    T, g    f, W, g, s    f, E, s    P, f    Q, f, g, s    T, f
Allowed substitution hints:    A( f, g, s)    P( g, s)    T( s)    E( g)    G( f, g, s)    H( f, g, s)    I( f, g, s)    .<_ ( f, g, s)    V( f, g, s)

Proof of Theorem dicval2
StepHypRef Expression
1 dicval.l . . 3  |-  .<_  =  ( le `  K )
2 dicval.a . . 3  |-  A  =  ( Atoms `  K )
3 dicval.h . . 3  |-  H  =  ( LHyp `  K
)
4 dicval.p . . 3  |-  P  =  ( ( oc `  K ) `  W
)
5 dicval.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
6 dicval.e . . 3  |-  E  =  ( ( TEndo `  K
) `  W )
7 dicval.i . . 3  |-  I  =  ( ( DIsoC `  K
) `  W )
81, 2, 3, 4, 5, 6, 7dicval 36465 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( I `  Q
)  =  { <. f ,  s >.  |  ( f  =  ( s `
 ( iota_ g  e.  T  ( g `  P )  =  Q ) )  /\  s  e.  E ) } )
9 dicval2.g . . . . . 6  |-  G  =  ( iota_ g  e.  T  ( g `  P
)  =  Q )
109fveq2i 6194 . . . . 5  |-  ( s `
 G )  =  ( s `  ( iota_ g  e.  T  ( g `  P )  =  Q ) )
1110eqeq2i 2634 . . . 4  |-  ( f  =  ( s `  G )  <->  f  =  ( s `  ( iota_ g  e.  T  ( g `  P )  =  Q ) ) )
1211anbi1i 731 . . 3  |-  ( ( f  =  ( s `
 G )  /\  s  e.  E )  <->  ( f  =  ( s `
 ( iota_ g  e.  T  ( g `  P )  =  Q ) )  /\  s  e.  E ) )
1312opabbii 4717 . 2  |-  { <. f ,  s >.  |  ( f  =  ( s `
 G )  /\  s  e.  E ) }  =  { <. f ,  s >.  |  ( f  =  ( s `
 ( iota_ g  e.  T  ( g `  P )  =  Q ) )  /\  s  e.  E ) }
148, 13syl6eqr 2674 1  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( I `  Q
)  =  { <. f ,  s >.  |  ( f  =  ( s `
 G )  /\  s  e.  E ) } )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   class class class wbr 4653   {copab 4712   ` cfv 5888   iota_crio 6610   lecple 15948   occoc 15949   Atomscatm 34550   LHypclh 35270   LTrncltrn 35387   TEndoctendo 36040   DIsoCcdic 36461
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-riota 6611  df-dic 36462
This theorem is referenced by:  dicelval3  36469  diclspsn  36483  dih1dimatlem  36618
  Copyright terms: Public domain W3C validator