| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pclcmpatN | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| pclfin.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| pclfin.c | ⊢ 𝑈 = (PCl‘𝐾) |
| Ref | Expression |
|---|---|
| pclcmpatN | ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑃 ∈ (𝑈‘𝑋)) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pclfin.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 2 | pclfin.c | . . . . . 6 ⊢ 𝑈 = (PCl‘𝐾) | |
| 3 | 1, 2 | pclfinN 40536 | . . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) = ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦)) |
| 4 | 3 | eleq2d 2851 | . . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ 𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦))) |
| 5 | eliun 4956 | . . . 4 ⊢ (𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦)) | |
| 6 | 4, 5 | bitrdi 290 | . . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦))) |
| 7 | elin 3923 | . . . . . . 7 ⊢ (𝑦 ∈ (Fin ∩ 𝒫 𝑋) ↔ (𝑦 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝑋)) | |
| 8 | elpwi 4565 | . . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝑋 → 𝑦 ⊆ 𝑋) | |
| 9 | 8 | anim2i 628 | . . . . . . 7 ⊢ ((𝑦 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝑋) → (𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋)) |
| 10 | 7, 9 | sylbi 220 | . . . . . 6 ⊢ (𝑦 ∈ (Fin ∩ 𝒫 𝑋) → (𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋)) |
| 11 | 10 | anim1i 626 | . . . . 5 ⊢ ((𝑦 ∈ (Fin ∩ 𝒫 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) → ((𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦))) |
| 12 | anass 473 | . . . . 5 ⊢ (((𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) ↔ (𝑦 ∈ Fin ∧ (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))) | |
| 13 | 11, 12 | sylib 221 | . . . 4 ⊢ ((𝑦 ∈ (Fin ∩ 𝒫 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) → (𝑦 ∈ Fin ∧ (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))) |
| 14 | 13 | reximi2 3098 | . . 3 ⊢ (∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))) |
| 15 | 6, 14 | biimtrdi 256 | . 2 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))) |
| 16 | 15 | 3impia 1133 | 1 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑃 ∈ (𝑈‘𝑋)) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ∃wrex 3089 ∩ cin 3906 ⊆ wss 3907 𝒫 cpw 4558 ∪ ciun 4952 ‘cfv 6525 Fincfn 8931 Atomscatm 39899 AtLatcal 39900 PClcpclN 40523 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-om 7851 df-1o 8441 df-en 8932 df-fin 8935 df-proset 18340 df-poset 18359 df-plt 18374 df-lub 18390 df-glb 18391 df-join 18392 df-meet 18393 df-p0 18469 df-lat 18478 df-covers 39902 df-ats 39903 df-atl 39934 df-psubsp 40139 df-pclN 40524 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |