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

Theorem pexmidlem7N 30165
Description: Lemma for pexmidN 30158. Contradict pexmidlem6N 30164. (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 3760 . . . . 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 30005 . . . . 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 2791 . . . . 5  |-  p  e. 
_V
109snss 3748 . . . 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 2374 . 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 30097 . . . . . 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 30004 . . . . 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 3179 . . 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 2535 . 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 1623    e. wcel 1684    =/= wne 2446    C_ wss 3152   (/)c0 3455   {csn 3640   ` cfv 5255  (class class class)co 5858   lecple 13215   joincjn 14078   Atomscatm 29453   HLchlt 29540   + Pcpadd 29984   _|_ PcpolN 30091
This theorem is referenced by:  pexmidlem8N  30166
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-iin 3908  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-undef 6298  df-riota 6304  df-poset 14080  df-lub 14108  df-glb 14109  df-join 14110  df-meet 14111  df-p1 14146  df-lat 14152  df-clat 14214  df-oposet 29366  df-ol 29368  df-oml 29369  df-ats 29457  df-atl 29488  df-cvlat 29512  df-hlat 29541  df-psubsp 29692  df-pmap 29693  df-padd 29985  df-polarityN 30092
  Copyright terms: Public domain W3C validator