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

Theorem atmod3i1 29978
Description: Version of modular law that holds in a Hilbert lattice, when one element is an atom. (Contributed by NM, 4-Jun-2012.) (Revised by Mario Carneiro, 10-May-2013.)
Hypotheses
Ref Expression
atmod.b  |-  B  =  ( Base `  K
)
atmod.l  |-  .<_  =  ( le `  K )
atmod.j  |-  .\/  =  ( join `  K )
atmod.m  |-  ./\  =  ( meet `  K )
atmod.a  |-  A  =  ( Atoms `  K )
Assertion
Ref Expression
atmod3i1  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( X  ./\  Y
) )  =  ( X  ./\  ( P  .\/  Y ) ) )

Proof of Theorem atmod3i1
StepHypRef Expression
1 simp1 957 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  K  e.  HL )
2 simp21 990 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  P  e.  A )
3 simp23 992 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  Y  e.  B )
4 simp22 991 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  X  e.  B )
5 simp3 959 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  P  .<_  X )
6 atmod.b . . . 4  |-  B  =  ( Base `  K
)
7 atmod.l . . . 4  |-  .<_  =  ( le `  K )
8 atmod.j . . . 4  |-  .\/  =  ( join `  K )
9 atmod.m . . . 4  |-  ./\  =  ( meet `  K )
10 atmod.a . . . 4  |-  A  =  ( Atoms `  K )
116, 7, 8, 9, 10atmod1i1 29971 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  Y  e.  B  /\  X  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( Y  ./\  X
) )  =  ( ( P  .\/  Y
)  ./\  X )
)
121, 2, 3, 4, 5, 11syl131anc 1197 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( Y  ./\  X
) )  =  ( ( P  .\/  Y
)  ./\  X )
)
13 hllat 29478 . . . . 5  |-  ( K  e.  HL  ->  K  e.  Lat )
14133ad2ant1 978 . . . 4  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  K  e.  Lat )
156, 9latmcom 14431 . . . 4  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  ./\  Y
)  =  ( Y 
./\  X ) )
1614, 4, 3, 15syl3anc 1184 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( X  ./\ 
Y )  =  ( Y  ./\  X )
)
1716oveq2d 6036 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( X  ./\  Y
) )  =  ( P  .\/  ( Y 
./\  X ) ) )
186, 10atbase 29404 . . . . 5  |-  ( P  e.  A  ->  P  e.  B )
192, 18syl 16 . . . 4  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  P  e.  B )
206, 8latjcl 14406 . . . 4  |-  ( ( K  e.  Lat  /\  P  e.  B  /\  Y  e.  B )  ->  ( P  .\/  Y
)  e.  B )
2114, 19, 3, 20syl3anc 1184 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  Y )  e.  B
)
226, 9latmcom 14431 . . 3  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  ( P  .\/  Y )  e.  B )  -> 
( X  ./\  ( P  .\/  Y ) )  =  ( ( P 
.\/  Y )  ./\  X ) )
2314, 4, 21, 22syl3anc 1184 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( X  ./\  ( P  .\/  Y
) )  =  ( ( P  .\/  Y
)  ./\  X )
)
2412, 17, 233eqtr4d 2429 1  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( X  ./\  Y
) )  =  ( X  ./\  ( P  .\/  Y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 936    = wceq 1649    e. wcel 1717   class class class wbr 4153   ` cfv 5394  (class class class)co 6020   Basecbs 13396   lecple 13463   joincjn 14328   meetcmee 14329   Latclat 14401   Atomscatm 29378   HLchlt 29465
This theorem is referenced by:  dalawlem2  29986  dalawlem3  29987  dalawlem6  29990  lhpmcvr3  30139  cdleme0cp  30328  cdleme0cq  30329  cdleme1  30341  cdleme4  30352  cdleme5  30354  cdleme8  30364  cdleme9  30367  cdleme10  30368  cdleme15b  30389  cdleme22e  30458  cdleme22eALTN  30459  cdleme23c  30465  cdleme35b  30564  cdleme35e  30567  cdleme42a  30585  trlcoabs2N  30836  cdlemi1  30932  cdlemk4  30948  dia2dimlem1  31179  dia2dimlem2  31180  cdlemn10  31321  dihglbcpreN  31415
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 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-rep 4261  ax-sep 4271  ax-nul 4279  ax-pow 4318  ax-pr 4344  ax-un 4641
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 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-nel 2553  df-ral 2654  df-rex 2655  df-reu 2656  df-rab 2658  df-v 2901  df-sbc 3105  df-csb 3195  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-pw 3744  df-sn 3763  df-pr 3764  df-op 3766  df-uni 3958  df-iun 4037  df-iin 4038  df-br 4154  df-opab 4208  df-mpt 4209  df-id 4439  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-dm 4828  df-rn 4829  df-res 4830  df-ima 4831  df-iota 5358  df-fun 5396  df-fn 5397  df-f 5398  df-f1 5399  df-fo 5400  df-f1o 5401  df-fv 5402  df-ov 6023  df-oprab 6024  df-mpt2 6025  df-1st 6288  df-2nd 6289  df-undef 6479  df-riota 6485  df-poset 14330  df-plt 14342  df-lub 14358  df-glb 14359  df-join 14360  df-meet 14361  df-p0 14395  df-lat 14402  df-clat 14464  df-oposet 29291  df-ol 29293  df-oml 29294  df-covers 29381  df-ats 29382  df-atl 29413  df-cvlat 29437  df-hlat 29466  df-psubsp 29617  df-pmap 29618  df-padd 29910
  Copyright terms: Public domain W3C validator