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

Theorem pexmidlem7N 30787
Description: Lemma for pexmidN 30780. Contradict pexmidlem6N 30786. (Contributed by NM, 3-Feb-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
pexmidlem.l  |-  .<_  =  ( le `  K )
pexmidlem.j  |-  .\/  =  ( join `  K )
pexmidlem.a  |-  A  =  ( Atoms `  K )
pexmidlem.p  |-  .+  =  ( + P `  K
)
pexmidlem.o  |-  ._|_  =  ( _|_ P `  K
)
pexmidlem.m  |-  M  =  ( X  .+  {
p } )
Assertion
Ref Expression
pexmidlem7N  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  M  =/=  X )

Proof of Theorem pexmidlem7N
StepHypRef Expression
1 simpl1 958 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  K  e.  HL )
2 simpl3 960 . . . . . 6  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  p  e.  A )
32snssd 3776 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  { p }  C_  A )
4 simpl2 959 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  X  C_  A )
5 pexmidlem.a . . . . . 6  |-  A  =  ( Atoms `  K )
6 pexmidlem.p . . . . . 6  |-  .+  =  ( + P `  K
)
75, 6sspadd2 30627 . . . . 5  |-  ( ( K  e.  HL  /\  { p }  C_  A  /\  X  C_  A )  ->  { p }  C_  ( X  .+  {
p } ) )
81, 3, 4, 7syl3anc 1182 . . . 4  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  { p }  C_  ( X  .+  { p } ) )
9 vex 2804 . . . . 5  |-  p  e. 
_V
109snss 3761 . . . 4  |-  ( p  e.  ( X  .+  { p } )  <->  { p }  C_  ( X  .+  { p } ) )
118, 10sylibr 203 . . 3  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  p  e.  ( X  .+  {
p } ) )
12 pexmidlem.m . . 3  |-  M  =  ( X  .+  {
p } )
1311, 12syl6eleqr 2387 . 2  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  p  e.  M )
14 simpr3 963 . . 3  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) )
15 pexmidlem.o . . . . . . 7  |-  ._|_  =  ( _|_ P `  K
)
165, 15polssatN 30719 . . . . . 6  |-  ( ( K  e.  HL  /\  X  C_  A )  -> 
(  ._|_  `  X )  C_  A )
171, 4, 16syl2anc 642 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  (  ._|_  `  X )  C_  A )
185, 6sspadd1 30626 . . . . 5  |-  ( ( K  e.  HL  /\  X  C_  A  /\  (  ._|_  `  X )  C_  A )  ->  X  C_  ( X  .+  (  ._|_  `  X ) ) )
191, 4, 17, 18syl3anc 1182 . . . 4  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  X  C_  ( X  .+  (  ._|_  `  X ) ) )
2019sseld 3192 . . 3  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  (
p  e.  X  ->  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )
2114, 20mtod 168 . 2  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  -.  p  e.  X )
22 nelne1 2548 . 2  |-  ( ( p  e.  M  /\  -.  p  e.  X
)  ->  M  =/=  X )
2313, 21, 22syl2anc 642 1  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  M  =/=  X )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    =/= wne 2459    C_ wss 3165   (/)c0 3468   {csn 3653   ` cfv 5271  (class class class)co 5874   lecple 13231   joincjn 14094   Atomscatm 30075   HLchlt 30162   + Pcpadd 30606   _|_ PcpolN 30713
This theorem is referenced by:  pexmidlem8N  30788
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-rmo 2564  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-lub 14124  df-glb 14125  df-join 14126  df-meet 14127  df-p1 14162  df-lat 14168  df-clat 14230  df-oposet 29988  df-ol 29990  df-oml 29991  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163  df-psubsp 30314  df-pmap 30315  df-padd 30607  df-polarityN 30714
  Copyright terms: Public domain W3C validator