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

Theorem dicval2 31674
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 31671 . 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 5698 . . . . 5  |-  ( s `
 G )  =  ( s `  ( iota_ g  e.  T ( g `  P )  =  Q ) )
1110eqeq2i 2422 . . . 4  |-  ( f  =  ( s `  G )  <->  f  =  ( s `  ( iota_ g  e.  T ( g `  P )  =  Q ) ) )
1211anbi1i 677 . . 3  |-  ( ( f  =  ( s `
 G )  /\  s  e.  E )  <->  ( f  =  ( s `
 ( iota_ g  e.  T ( g `  P )  =  Q ) )  /\  s  e.  E ) )
1312opabbii 4240 . 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 2462 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 set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1721   class class class wbr 4180   {copab 4233   ` cfv 5421   iota_crio 6509   lecple 13499   occoc 13500   Atomscatm 29758   LHypclh 30478   LTrncltrn 30595   TEndoctendo 31246   DIsoCcdic 31667
This theorem is referenced by:  dicelval3  31675  diclspsn  31689  dih1dimatlem  31824
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393  ax-rep 4288  ax-sep 4298  ax-nul 4306  ax-pow 4345  ax-pr 4371  ax-un 4668
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2266  df-mo 2267  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ne 2577  df-ral 2679  df-rex 2680  df-reu 2681  df-rab 2683  df-v 2926  df-sbc 3130  df-csb 3220  df-dif 3291  df-un 3293  df-in 3295  df-ss 3302  df-nul 3597  df-if 3708  df-pw 3769  df-sn 3788  df-pr 3789  df-op 3791  df-uni 3984  df-iun 4063  df-br 4181  df-opab 4235  df-mpt 4236  df-id 4466  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-rn 4856  df-res 4857  df-ima 4858  df-iota 5385  df-fun 5423  df-fn 5424  df-f 5425  df-f1 5426  df-fo 5427  df-f1o 5428  df-fv 5429  df-riota 6516  df-dic 31668
  Copyright terms: Public domain W3C validator