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

Theorem pexmidlem8N 35403
Description: Lemma for pexmidN 35395. The contradiction of pexmidlem6N 35401 and pexmidlem7N 35402 shows that there can be no atom  p that is not in  X  .+  (  ._|_  `  X ), which is therefore the whole atom space. (Contributed by NM, 3-Feb-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
pexmidALT.a  |-  A  =  ( Atoms `  K )
pexmidALT.p  |-  .+  =  ( +P `  K
)
pexmidALT.o  |-  ._|_  =  ( _|_P `  K
)
Assertion
Ref Expression
pexmidlem8N  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( X  .+  (  ._|_  `  X ) )  =  A )

Proof of Theorem pexmidlem8N
Dummy variable  p is distinct from all other variables.
StepHypRef Expression
1 nonconne 2649 . 2  |-  -.  ( X  =  X  /\  X  =/=  X )
2 simpll 753 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  ->  K  e.  HL )
3 simplr 754 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  ->  X  C_  A )
4 pexmidALT.a . . . . . . 7  |-  A  =  ( Atoms `  K )
5 pexmidALT.o . . . . . . 7  |-  ._|_  =  ( _|_P `  K
)
64, 5polssatN 35334 . . . . . 6  |-  ( ( K  e.  HL  /\  X  C_  A )  -> 
(  ._|_  `  X )  C_  A )
76adantr 465 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
(  ._|_  `  X )  C_  A )
8 pexmidALT.p . . . . . 6  |-  .+  =  ( +P `  K
)
94, 8paddssat 35240 . . . . 5  |-  ( ( K  e.  HL  /\  X  C_  A  /\  (  ._|_  `  X )  C_  A )  ->  ( X  .+  (  ._|_  `  X
) )  C_  A
)
102, 3, 7, 9syl3anc 1227 . . . 4  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( X  .+  (  ._|_  `  X ) ) 
C_  A )
11 df-pss 3474 . . . . . . 7  |-  ( ( X  .+  (  ._|_  `  X ) )  C.  A 
<->  ( ( X  .+  (  ._|_  `  X )
)  C_  A  /\  ( X  .+  (  ._|_  `  X ) )  =/= 
A ) )
12 pssnel 3875 . . . . . . 7  |-  ( ( X  .+  (  ._|_  `  X ) )  C.  A  ->  E. p ( p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )
1311, 12sylbir 213 . . . . . 6  |-  ( ( ( X  .+  (  ._|_  `  X ) ) 
C_  A  /\  ( X  .+  (  ._|_  `  X
) )  =/=  A
)  ->  E. p
( p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )
14 df-rex 2797 . . . . . 6  |-  ( E. p  e.  A  -.  p  e.  ( X  .+  (  ._|_  `  X
) )  <->  E. p
( p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )
1513, 14sylibr 212 . . . . 5  |-  ( ( ( X  .+  (  ._|_  `  X ) ) 
C_  A  /\  ( X  .+  (  ._|_  `  X
) )  =/=  A
)  ->  E. p  e.  A  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) )
16 simplll 757 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  K  e.  HL )
17 simpllr 758 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  X  C_  A
)
18 simprl 755 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  p  e.  A
)
19 simplrl 759 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  (  ._|_  `  (  ._|_  `  X ) )  =  X )
20 simplrr 760 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  X  =/=  (/) )
21 simprr 756 . . . . . . . 8  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) )
22 eqid 2441 . . . . . . . . . 10  |-  ( le
`  K )  =  ( le `  K
)
23 eqid 2441 . . . . . . . . . 10  |-  ( join `  K )  =  (
join `  K )
24 eqid 2441 . . . . . . . . . 10  |-  ( X 
.+  { p }
)  =  ( X 
.+  { p }
)
2522, 23, 4, 8, 5, 24pexmidlem6N 35401 . . . . . . . . 9  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  ( X  .+  { p }
)  =  X )
2622, 23, 4, 8, 5, 24pexmidlem7N 35402 . . . . . . . . 9  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  ( X  .+  { p }
)  =/=  X )
2725, 26jca 532 . . . . . . . 8  |-  ( ( ( K  e.  HL  /\  X  C_  A  /\  p  e.  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/)  /\  -.  p  e.  ( X  .+  (  ._|_  `  X ) ) ) )  ->  (
( X  .+  {
p } )  =  X  /\  ( X 
.+  { p }
)  =/=  X ) )
2816, 17, 18, 19, 20, 21, 27syl33anc 1242 . . . . . . 7  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  ( ( X 
.+  { p }
)  =  X  /\  ( X  .+  { p } )  =/=  X
) )
29 nonconne 2649 . . . . . . . 8  |-  -.  (
( X  .+  {
p } )  =  X  /\  ( X 
.+  { p }
)  =/=  X )
3029, 12false 350 . . . . . . 7  |-  ( ( ( X  .+  {
p } )  =  X  /\  ( X 
.+  { p }
)  =/=  X )  <-> 
( X  =  X  /\  X  =/=  X
) )
3128, 30sylib 196 . . . . . 6  |-  ( ( ( ( K  e.  HL  /\  X  C_  A )  /\  (
(  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  /\  (
p  e.  A  /\  -.  p  e.  ( X  .+  (  ._|_  `  X
) ) ) )  ->  ( X  =  X  /\  X  =/= 
X ) )
3231rexlimdvaa 2934 . . . . 5  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( E. p  e.  A  -.  p  e.  ( X  .+  (  ._|_  `  X ) )  ->  ( X  =  X  /\  X  =/= 
X ) ) )
3315, 32syl5 32 . . . 4  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( ( ( X 
.+  (  ._|_  `  X
) )  C_  A  /\  ( X  .+  (  ._|_  `  X ) )  =/=  A )  -> 
( X  =  X  /\  X  =/=  X
) ) )
3410, 33mpand 675 . . 3  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( ( X  .+  (  ._|_  `  X )
)  =/=  A  -> 
( X  =  X  /\  X  =/=  X
) ) )
3534necon1bd 2659 . 2  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( -.  ( X  =  X  /\  X  =/=  X )  ->  ( X  .+  (  ._|_  `  X
) )  =  A ) )
361, 35mpi 17 1  |-  ( ( ( K  e.  HL  /\  X  C_  A )  /\  ( (  ._|_  `  (  ._|_  `  X ) )  =  X  /\  X  =/=  (/) ) )  -> 
( X  .+  (  ._|_  `  X ) )  =  A )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    /\ w3a 972    = wceq 1381   E.wex 1597    e. wcel 1802    =/= wne 2636   E.wrex 2792    C_ wss 3458    C. wpss 3459   (/)c0 3767   {csn 4010   ` cfv 5574  (class class class)co 6277   lecple 14576   joincjn 15442   Atomscatm 34690   HLchlt 34777   +Pcpadd 35221   _|_PcpolN 35328
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-8 1804  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-rep 4544  ax-sep 4554  ax-nul 4562  ax-pow 4611  ax-pr 4672  ax-un 6573  ax-riotaBAD 34386
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 974  df-tru 1384  df-fal 1387  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-nel 2639  df-ral 2796  df-rex 2797  df-reu 2798  df-rmo 2799  df-rab 2800  df-v 3095  df-sbc 3312  df-csb 3418  df-dif 3461  df-un 3463  df-in 3465  df-ss 3472  df-pss 3474  df-nul 3768  df-if 3923  df-pw 3995  df-sn 4011  df-pr 4013  df-op 4017  df-uni 4231  df-iun 4313  df-iin 4314  df-br 4434  df-opab 4492  df-mpt 4493  df-id 4781  df-xp 4991  df-rel 4992  df-cnv 4993  df-co 4994  df-dm 4995  df-rn 4996  df-res 4997  df-ima 4998  df-iota 5537  df-fun 5576  df-fn 5577  df-f 5578  df-f1 5579  df-fo 5580  df-f1o 5581  df-fv 5582  df-riota 6238  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-1st 6781  df-2nd 6782  df-undef 7000  df-preset 15426  df-poset 15444  df-plt 15457  df-lub 15473  df-glb 15474  df-join 15475  df-meet 15476  df-p0 15538  df-p1 15539  df-lat 15545  df-clat 15607  df-oposet 34603  df-ol 34605  df-oml 34606  df-covers 34693  df-ats 34694  df-atl 34725  df-cvlat 34749  df-hlat 34778  df-psubsp 34929  df-pmap 34930  df-padd 35222  df-polarityN 35329  df-psubclN 35361
This theorem is referenced by:  pexmidALTN  35404
  Copyright terms: Public domain W3C validator