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

Theorem paddasslem11 34982
Description: Lemma for paddass 34990. The case when  p  =  z. (Contributed by NM, 11-Jan-2012.)
Hypotheses
Ref Expression
paddasslem.l  |-  .<_  =  ( le `  K )
paddasslem.j  |-  .\/  =  ( join `  K )
paddasslem.a  |-  A  =  ( Atoms `  K )
paddasslem.p  |-  .+  =  ( +P `  K
)
Assertion
Ref Expression
paddasslem11  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  p  e.  ( ( X  .+  Y ) 
.+  Z ) )

Proof of Theorem paddasslem11
StepHypRef Expression
1 simplll 757 . . 3  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  K  e.  HL )
2 simplr3 1040 . . 3  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  Z  C_  A )
3 simplr1 1038 . . . 4  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  X  C_  A )
4 simplr2 1039 . . . 4  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  Y  C_  A )
5 paddasslem.a . . . . 5  |-  A  =  ( Atoms `  K )
6 paddasslem.p . . . . 5  |-  .+  =  ( +P `  K
)
75, 6paddssat 34966 . . . 4  |-  ( ( K  e.  HL  /\  X  C_  A  /\  Y  C_  A )  ->  ( X  .+  Y )  C_  A )
81, 3, 4, 7syl3anc 1228 . . 3  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  ( X  .+  Y
)  C_  A )
95, 6sspadd2 34968 . . 3  |-  ( ( K  e.  HL  /\  Z  C_  A  /\  ( X  .+  Y )  C_  A )  ->  Z  C_  ( ( X  .+  Y )  .+  Z
) )
101, 2, 8, 9syl3anc 1228 . 2  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  Z  C_  ( ( X  .+  Y )  .+  Z ) )
11 simpllr 758 . . 3  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  p  =  z )
12 simpr 461 . . 3  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  z  e.  Z )
1311, 12eqeltrd 2555 . 2  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  p  e.  Z )
1410, 13sseldd 3510 1  |-  ( ( ( ( K  e.  HL  /\  p  =  z )  /\  ( X  C_  A  /\  Y  C_  A  /\  Z  C_  A ) )  /\  z  e.  Z )  ->  p  e.  ( ( X  .+  Y ) 
.+  Z ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767    C_ wss 3481   ` cfv 5594  (class class class)co 6295   lecple 14579   joincjn 15448   Atomscatm 34416   HLchlt 34503   +Pcpadd 34947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4564  ax-sep 4574  ax-nul 4582  ax-pow 4631  ax-pr 4692  ax-un 6587
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-pw 4018  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-iun 4333  df-br 4454  df-opab 4512  df-mpt 4513  df-id 4801  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-res 5017  df-ima 5018  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-ov 6298  df-oprab 6299  df-mpt2 6300  df-1st 6795  df-2nd 6796  df-padd 34948
This theorem is referenced by:  paddasslem14  34985
  Copyright terms: Public domain W3C validator