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

Theorem iscvlat 35170
Description: The predicate "is an atomic lattice with the covering (or exchange) property". (Contributed by NM, 5-Nov-2012.)
Hypotheses
Ref Expression
iscvlat.b  |-  B  =  ( Base `  K
)
iscvlat.l  |-  .<_  =  ( le `  K )
iscvlat.j  |-  .\/  =  ( join `  K )
iscvlat.a  |-  A  =  ( Atoms `  K )
Assertion
Ref Expression
iscvlat  |-  ( K  e.  CvLat 
<->  ( K  e.  AtLat  /\ 
A. p  e.  A  A. q  e.  A  A. x  e.  B  ( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
Distinct variable groups:    q, p, A    x, B    x, p, K, q
Allowed substitution hints:    A( x)    B( q, p)    .\/ ( x, q, p)    .<_ ( x, q, p)

Proof of Theorem iscvlat
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 fveq2 5872 . . . 4  |-  ( k  =  K  ->  ( Atoms `  k )  =  ( Atoms `  K )
)
2 iscvlat.a . . . 4  |-  A  =  ( Atoms `  K )
31, 2syl6eqr 2516 . . 3  |-  ( k  =  K  ->  ( Atoms `  k )  =  A )
4 fveq2 5872 . . . . . 6  |-  ( k  =  K  ->  ( Base `  k )  =  ( Base `  K
) )
5 iscvlat.b . . . . . 6  |-  B  =  ( Base `  K
)
64, 5syl6eqr 2516 . . . . 5  |-  ( k  =  K  ->  ( Base `  k )  =  B )
7 fveq2 5872 . . . . . . . . . 10  |-  ( k  =  K  ->  ( le `  k )  =  ( le `  K
) )
8 iscvlat.l . . . . . . . . . 10  |-  .<_  =  ( le `  K )
97, 8syl6eqr 2516 . . . . . . . . 9  |-  ( k  =  K  ->  ( le `  k )  = 
.<_  )
109breqd 4467 . . . . . . . 8  |-  ( k  =  K  ->  (
p ( le `  k ) x  <->  p  .<_  x ) )
1110notbid 294 . . . . . . 7  |-  ( k  =  K  ->  ( -.  p ( le `  k ) x  <->  -.  p  .<_  x ) )
12 eqidd 2458 . . . . . . . 8  |-  ( k  =  K  ->  p  =  p )
13 fveq2 5872 . . . . . . . . . 10  |-  ( k  =  K  ->  ( join `  k )  =  ( join `  K
) )
14 iscvlat.j . . . . . . . . . 10  |-  .\/  =  ( join `  K )
1513, 14syl6eqr 2516 . . . . . . . . 9  |-  ( k  =  K  ->  ( join `  k )  = 
.\/  )
1615oveqd 6313 . . . . . . . 8  |-  ( k  =  K  ->  (
x ( join `  k
) q )  =  ( x  .\/  q
) )
1712, 9, 16breq123d 4470 . . . . . . 7  |-  ( k  =  K  ->  (
p ( le `  k ) ( x ( join `  k
) q )  <->  p  .<_  ( x  .\/  q ) ) )
1811, 17anbi12d 710 . . . . . 6  |-  ( k  =  K  ->  (
( -.  p ( le `  k ) x  /\  p ( le `  k ) ( x ( join `  k ) q ) )  <->  ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) ) ) )
19 eqidd 2458 . . . . . . 7  |-  ( k  =  K  ->  q  =  q )
2015oveqd 6313 . . . . . . 7  |-  ( k  =  K  ->  (
x ( join `  k
) p )  =  ( x  .\/  p
) )
2119, 9, 20breq123d 4470 . . . . . 6  |-  ( k  =  K  ->  (
q ( le `  k ) ( x ( join `  k
) p )  <->  q  .<_  ( x  .\/  p ) ) )
2218, 21imbi12d 320 . . . . 5  |-  ( k  =  K  ->  (
( ( -.  p
( le `  k
) x  /\  p
( le `  k
) ( x (
join `  k )
q ) )  -> 
q ( le `  k ) ( x ( join `  k
) p ) )  <-> 
( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
236, 22raleqbidv 3068 . . . 4  |-  ( k  =  K  ->  ( A. x  e.  ( Base `  k ) ( ( -.  p ( le `  k ) x  /\  p ( le `  k ) ( x ( join `  k ) q ) )  ->  q ( le `  k ) ( x ( join `  k
) p ) )  <->  A. x  e.  B  ( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
243, 23raleqbidv 3068 . . 3  |-  ( k  =  K  ->  ( A. q  e.  ( Atoms `  k ) A. x  e.  ( Base `  k ) ( ( -.  p ( le
`  k ) x  /\  p ( le
`  k ) ( x ( join `  k
) q ) )  ->  q ( le
`  k ) ( x ( join `  k
) p ) )  <->  A. q  e.  A  A. x  e.  B  ( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
253, 24raleqbidv 3068 . 2  |-  ( k  =  K  ->  ( A. p  e.  ( Atoms `  k ) A. q  e.  ( Atoms `  k ) A. x  e.  ( Base `  k
) ( ( -.  p ( le `  k ) x  /\  p ( le `  k ) ( x ( join `  k
) q ) )  ->  q ( le
`  k ) ( x ( join `  k
) p ) )  <->  A. p  e.  A  A. q  e.  A  A. x  e.  B  ( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
26 df-cvlat 35169 . 2  |-  CvLat  =  {
k  e.  AtLat  |  A. p  e.  ( Atoms `  k ) A. q  e.  ( Atoms `  k ) A. x  e.  ( Base `  k ) ( ( -.  p ( le `  k ) x  /\  p ( le `  k ) ( x ( join `  k ) q ) )  ->  q ( le `  k ) ( x ( join `  k
) p ) ) }
2725, 26elrab2 3259 1  |-  ( K  e.  CvLat 
<->  ( K  e.  AtLat  /\ 
A. p  e.  A  A. q  e.  A  A. x  e.  B  ( ( -.  p  .<_  x  /\  p  .<_  ( x  .\/  q ) )  ->  q  .<_  ( x  .\/  p ) ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1395    e. wcel 1819   A.wral 2807   class class class wbr 4456   ` cfv 5594  (class class class)co 6296   Basecbs 14644   lecple 14719   joincjn 15700   Atomscatm 35110   AtLatcal 35111   CvLatclc 35112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-iota 5557  df-fv 5602  df-ov 6299  df-cvlat 35169
This theorem is referenced by:  iscvlat2N  35171  cvlatl  35172  cvlexch1  35175  ishlat2  35200
  Copyright terms: Public domain W3C validator