Theorem pclcmpatN 41051

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	⊢ 𝐴 = (Atoms‘𝐾)
pclfin.c	⊢ 𝑈 = (PCl‘𝐾)

Assertion

Ref	Expression
pclcmpatN	⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑃 ∈ (𝑈‘𝑋)) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))

Distinct variable groups:   𝑦,𝐴   𝑦,𝑈   𝑦,𝐾   𝑦,𝑋   𝑦,𝑃

Proof of Theorem pclcmpatN

Step	Hyp	Ref	Expression
1		pclfin.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
2		pclfin.c	. . . . . 6 ⊢ 𝑈 = (PCl‘𝐾)
3	1, 2	pclfinN 41050	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) = ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦))
4	3	eleq2d 2846	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ 𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦)))
5		eliun 4954	. . . 4 ⊢ (𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦))
6	4, 5	bitrdi 290	. . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦)))
7		elin 4093	. . . . . . 7 ⊢ (𝑦 ∈ (Fin ∩ 𝒫 𝑋) ↔ (𝑦 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝑋))
8		elpwi 4563	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝑋 → 𝑦 ⊆ 𝑋)
9	8	anim2i 629	. . . . . . 7 ⊢ ((𝑦 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝑋) → (𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋))
10	7, 9	sylbi 220	. . . . . 6 ⊢ (𝑦 ∈ (Fin ∩ 𝒫 𝑋) → (𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋))
11	10	anim1i 627	. . . . 5 ⊢ ((𝑦 ∈ (Fin ∩ 𝒫 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) → ((𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)))
12		anass 474	. . . . 5 ⊢ (((𝑦 ∈ Fin ∧ 𝑦 ⊆ 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) ↔ (𝑦 ∈ Fin ∧ (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))))
13	11, 12	sylib 221	. . . 4 ⊢ ((𝑦 ∈ (Fin ∩ 𝒫 𝑋) ∧ 𝑃 ∈ (𝑈‘𝑦)) → (𝑦 ∈ Fin ∧ (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))))
14	13	reximi2 3095	. . 3 ⊢ (∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))
15	6, 14	biimtrdi 256	. 2 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦))))
16	15	3impia 1135	1 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑃 ∈ (𝑈‘𝑋)) → ∃𝑦 ∈ Fin (𝑦 ⊆ 𝑋 ∧ 𝑃 ∈ (𝑈‘𝑦)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  ∪ ciun 4950  ‘cfv 6538  Fincfn 8976  Atomscatm 40413  AtLatcal 40414  PClcpclN 41037

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-om 7878  df-1o 8479  df-en 8977  df-fin 8980  df-proset 18473  df-poset 18492  df-plt 18507  df-lub 18523  df-glb 18524  df-join 18525  df-meet 18526  df-p0 18602  df-lat 18611  df-covers 40416  df-ats 40417  df-atl 40448  df-psubsp 40653  df-pclN 41038

This theorem is used by: (None)