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

Theorem atmod3i1 29979
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 29972 . . 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 29479 . . . . 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 14432 . . . 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 6037 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( X  ./\  Y
) )  =  ( P  .\/  ( Y 
./\  X ) ) )
186, 10atbase 29405 . . . . 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 14407 . . . 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 14432 . . 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 2430 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 4154   ` cfv 5395  (class class class)co 6021   Basecbs 13397   lecple 13464   joincjn 14329   meetcmee 14330   Latclat 14402   Atomscatm 29379   HLchlt 29466
This theorem is referenced by:  dalawlem2  29987  dalawlem3  29988  dalawlem6  29991  lhpmcvr3  30140  cdleme0cp  30329  cdleme0cq  30330  cdleme1  30342  cdleme4  30353  cdleme5  30355  cdleme8  30365  cdleme9  30368  cdleme10  30369  cdleme15b  30390  cdleme22e  30459  cdleme22eALTN  30460  cdleme23c  30466  cdleme35b  30565  cdleme35e  30568  cdleme42a  30586  trlcoabs2N  30837  cdlemi1  30933  cdlemk4  30949  dia2dimlem1  31180  dia2dimlem2  31181  cdlemn10  31322  dihglbcpreN  31416
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 2369  ax-rep 4262  ax-sep 4272  ax-nul 4280  ax-pow 4319  ax-pr 4345  ax-un 4642
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 2243  df-mo 2244  df-clab 2375  df-cleq 2381  df-clel 2384  df-nfc 2513  df-ne 2553  df-nel 2554  df-ral 2655  df-rex 2656  df-reu 2657  df-rab 2659  df-v 2902  df-sbc 3106  df-csb 3196  df-dif 3267  df-un 3269  df-in 3271  df-ss 3278  df-nul 3573  df-if 3684  df-pw 3745  df-sn 3764  df-pr 3765  df-op 3767  df-uni 3959  df-iun 4038  df-iin 4039  df-br 4155  df-opab 4209  df-mpt 4210  df-id 4440  df-xp 4825  df-rel 4826  df-cnv 4827  df-co 4828  df-dm 4829  df-rn 4830  df-res 4831  df-ima 4832  df-iota 5359  df-fun 5397  df-fn 5398  df-f 5399  df-f1 5400  df-fo 5401  df-f1o 5402  df-fv 5403  df-ov 6024  df-oprab 6025  df-mpt2 6026  df-1st 6289  df-2nd 6290  df-undef 6480  df-riota 6486  df-poset 14331  df-plt 14343  df-lub 14359  df-glb 14360  df-join 14361  df-meet 14362  df-p0 14396  df-lat 14403  df-clat 14465  df-oposet 29292  df-ol 29294  df-oml 29295  df-covers 29382  df-ats 29383  df-atl 29414  df-cvlat 29438  df-hlat 29467  df-psubsp 29618  df-pmap 29619  df-padd 29911
  Copyright terms: Public domain W3C validator