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

Theorem pclcmpatN 35187
Description: The set of projective subspaces is compactly atomistic: if an atom is in the projective subspace closure of a set of atoms, it also belongs to the projective subspace closure of a finite subset of that set. Analogous to Lemma 3.3.10 of [PtakPulmannova] p. 74. (Contributed by NM, 10-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
pclfin.a  |-  A  =  ( Atoms `  K )
pclfin.c  |-  U  =  ( PCl `  K
)
Assertion
Ref Expression
pclcmpatN  |-  ( ( K  e.  AtLat  /\  X  C_  A  /\  P  e.  ( U `  X
) )  ->  E. y  e.  Fin  ( y  C_  X  /\  P  e.  ( U `  y ) ) )
Distinct variable groups:    y, A    y, U    y, K    y, X    y, P

Proof of Theorem pclcmpatN
StepHypRef Expression
1 pclfin.a . . . . . 6  |-  A  =  ( Atoms `  K )
2 pclfin.c . . . . . 6  |-  U  =  ( PCl `  K
)
31, 2pclfinN 35186 . . . . 5  |-  ( ( K  e.  AtLat  /\  X  C_  A )  ->  ( U `  X )  =  U_ y  e.  ( Fin  i^i  ~P X
) ( U `  y ) )
43eleq2d 2687 . . . 4  |-  ( ( K  e.  AtLat  /\  X  C_  A )  ->  ( P  e.  ( U `  X )  <->  P  e.  U_ y  e.  ( Fin 
i^i  ~P X ) ( U `  y ) ) )
5 eliun 4524 . . . 4  |-  ( P  e.  U_ y  e.  ( Fin  i^i  ~P X ) ( U `
 y )  <->  E. y  e.  ( Fin  i^i  ~P X ) P  e.  ( U `  y
) )
64, 5syl6bb 276 . . 3  |-  ( ( K  e.  AtLat  /\  X  C_  A )  ->  ( P  e.  ( U `  X )  <->  E. y  e.  ( Fin  i^i  ~P X ) P  e.  ( U `  y
) ) )
7 elin 3796 . . . . . . 7  |-  ( y  e.  ( Fin  i^i  ~P X )  <->  ( y  e.  Fin  /\  y  e. 
~P X ) )
8 elpwi 4168 . . . . . . . 8  |-  ( y  e.  ~P X  -> 
y  C_  X )
98anim2i 593 . . . . . . 7  |-  ( ( y  e.  Fin  /\  y  e.  ~P X
)  ->  ( y  e.  Fin  /\  y  C_  X ) )
107, 9sylbi 207 . . . . . 6  |-  ( y  e.  ( Fin  i^i  ~P X )  ->  (
y  e.  Fin  /\  y  C_  X ) )
1110anim1i 592 . . . . 5  |-  ( ( y  e.  ( Fin 
i^i  ~P X )  /\  P  e.  ( U `  y ) )  -> 
( ( y  e. 
Fin  /\  y  C_  X )  /\  P  e.  ( U `  y
) ) )
12 anass 681 . . . . 5  |-  ( ( ( y  e.  Fin  /\  y  C_  X )  /\  P  e.  ( U `  y )
)  <->  ( y  e. 
Fin  /\  ( y  C_  X  /\  P  e.  ( U `  y
) ) ) )
1311, 12sylib 208 . . . 4  |-  ( ( y  e.  ( Fin 
i^i  ~P X )  /\  P  e.  ( U `  y ) )  -> 
( y  e.  Fin  /\  ( y  C_  X  /\  P  e.  ( U `  y )
) ) )
1413reximi2 3010 . . 3  |-  ( E. y  e.  ( Fin 
i^i  ~P X ) P  e.  ( U `  y )  ->  E. y  e.  Fin  ( y  C_  X  /\  P  e.  ( U `  y ) ) )
156, 14syl6bi 243 . 2  |-  ( ( K  e.  AtLat  /\  X  C_  A )  ->  ( P  e.  ( U `  X )  ->  E. y  e.  Fin  ( y  C_  X  /\  P  e.  ( U `  y ) ) ) )
16153impia 1261 1  |-  ( ( K  e.  AtLat  /\  X  C_  A  /\  P  e.  ( U `  X
) )  ->  E. y  e.  Fin  ( y  C_  X  /\  P  e.  ( U `  y ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   E.wrex 2913    i^i cin 3573    C_ wss 3574   ~Pcpw 4158   U_ciun 4520   ` cfv 5888   Fincfn 7955   Atomscatm 34550   AtLatcal 34551   PClcpclN 35173
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-fin 7959  df-preset 16928  df-poset 16946  df-plt 16958  df-lub 16974  df-glb 16975  df-join 16976  df-meet 16977  df-p0 17039  df-lat 17046  df-covers 34553  df-ats 34554  df-atl 34585  df-psubsp 34789  df-pclN 35174
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator