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

Theorem dicopelval2 31371
Description: Membership in value of 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 )
dicelval2.f  |-  F  e. 
_V
dicelval2.s  |-  S  e. 
_V
Assertion
Ref Expression
dicopelval2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( <. F ,  S >.  e.  ( I `  Q )  <->  ( F  =  ( S `  G )  /\  S  e.  E ) ) )
Distinct variable groups:    g, K    T, g    g, W    Q, g
Allowed substitution hints:    A( g)    P( g)    S( g)    E( g)    F( g)    G( g)    H( g)    I( g)    .<_ ( g)    V( g)

Proof of Theorem dicopelval2
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 )
8 dicelval2.f . . 3  |-  F  e. 
_V
9 dicelval2.s . . 3  |-  S  e. 
_V
101, 2, 3, 4, 5, 6, 7, 8, 9dicopelval 31367 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( <. F ,  S >.  e.  ( I `  Q )  <->  ( F  =  ( S `  ( iota_ g  e.  T
( g `  P
)  =  Q ) )  /\  S  e.  E ) ) )
11 dicval2.g . . . . 5  |-  G  =  ( iota_ g  e.  T
( g `  P
)  =  Q )
1211fveq2i 5528 . . . 4  |-  ( S `
 G )  =  ( S `  ( iota_ g  e.  T ( g `  P )  =  Q ) )
1312eqeq2i 2293 . . 3  |-  ( F  =  ( S `  G )  <->  F  =  ( S `  ( iota_ g  e.  T ( g `
 P )  =  Q ) ) )
1413anbi1i 676 . 2  |-  ( ( F  =  ( S `
 G )  /\  S  e.  E )  <->  ( F  =  ( S `
 ( iota_ g  e.  T ( g `  P )  =  Q ) )  /\  S  e.  E ) )
1510, 14syl6bbr 254 1  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  -> 
( <. F ,  S >.  e.  ( I `  Q )  <->  ( F  =  ( S `  G )  /\  S  e.  E ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   _Vcvv 2788   <.cop 3643   class class class wbr 4023   ` cfv 5255   iota_crio 6297   lecple 13215   occoc 13216   Atomscatm 29453   LHypclh 30173   LTrncltrn 30290   TEndoctendo 30941   DIsoCcdic 31362
This theorem is referenced by:  diclspsn  31384  cdlemn11a  31397  dihopelvalcqat  31436  dihopelvalcpre  31438  dihord6apre  31446
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-riota 6304  df-dic 31363
  Copyright terms: Public domain W3C validator