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

Theorem atmod3i1 30675
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 955 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  K  e.  HL )
2 simp21 988 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  P  e.  A )
3 simp23 990 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  Y  e.  B )
4 simp22 989 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  X  e.  B )
5 simp3 957 . . 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 30668 . . 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 1195 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( Y  ./\  X
) )  =  ( ( P  .\/  Y
)  ./\  X )
)
13 hllat 30175 . . . . 5  |-  ( K  e.  HL  ->  K  e.  Lat )
14133ad2ant1 976 . . . 4  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  K  e.  Lat )
156, 9latmcom 14197 . . . 4  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  ./\  Y
)  =  ( Y 
./\  X ) )
1614, 4, 3, 15syl3anc 1182 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( X  ./\ 
Y )  =  ( Y  ./\  X )
)
1716oveq2d 5890 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  ( X  ./\  Y
) )  =  ( P  .\/  ( Y 
./\  X ) ) )
186, 10atbase 30101 . . . . 5  |-  ( P  e.  A  ->  P  e.  B )
192, 18syl 15 . . . 4  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  P  e.  B )
206, 8latjcl 14172 . . . 4  |-  ( ( K  e.  Lat  /\  P  e.  B  /\  Y  e.  B )  ->  ( P  .\/  Y
)  e.  B )
2114, 19, 3, 20syl3anc 1182 . . 3  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( P  .\/  Y )  e.  B
)
226, 9latmcom 14197 . . 3  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  ( P  .\/  Y )  e.  B )  -> 
( X  ./\  ( P  .\/  Y ) )  =  ( ( P 
.\/  Y )  ./\  X ) )
2314, 4, 21, 22syl3anc 1182 . 2  |-  ( ( K  e.  HL  /\  ( P  e.  A  /\  X  e.  B  /\  Y  e.  B
)  /\  P  .<_  X )  ->  ( X  ./\  ( P  .\/  Y
) )  =  ( ( P  .\/  Y
)  ./\  X )
)
2412, 17, 233eqtr4d 2338 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 934    = wceq 1632    e. wcel 1696   class class class wbr 4039   ` cfv 5271  (class class class)co 5874   Basecbs 13164   lecple 13231   joincjn 14094   meetcmee 14095   Latclat 14167   Atomscatm 30075   HLchlt 30162
This theorem is referenced by:  dalawlem2  30683  dalawlem3  30684  dalawlem6  30687  lhpmcvr3  30836  cdleme0cp  31025  cdleme0cq  31026  cdleme1  31038  cdleme4  31049  cdleme5  31051  cdleme8  31061  cdleme9  31064  cdleme10  31065  cdleme15b  31086  cdleme22e  31155  cdleme22eALTN  31156  cdleme23c  31162  cdleme35b  31261  cdleme35e  31264  cdleme42a  31282  trlcoabs2N  31533  cdlemi1  31629  cdlemk4  31645  dia2dimlem1  31876  dia2dimlem2  31877  cdlemn10  32018  dihglbcpreN  32112
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-nel 2462  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-iin 3924  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-undef 6314  df-riota 6320  df-poset 14096  df-plt 14108  df-lub 14124  df-glb 14125  df-join 14126  df-meet 14127  df-p0 14161  df-lat 14168  df-clat 14230  df-oposet 29988  df-ol 29990  df-oml 29991  df-covers 30078  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163  df-psubsp 30314  df-pmap 30315  df-padd 30607
  Copyright terms: Public domain W3C validator