Theorem pclcmpatN 41150

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 41149	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) = ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦))
4	3	eleq2d 2850	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ 𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦)))
5		eliun 4958	. . . 4 ⊢ (𝑃 ∈ ∪ 𝑦 ∈ (Fin ∩ 𝒫 𝑋)(𝑈‘𝑦) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦))
6	4, 5	bitrdi 290	. . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ⊆ 𝐴) → (𝑃 ∈ (𝑈‘𝑋) ↔ ∃𝑦 ∈ (Fin ∩ 𝒫 𝑋)𝑃 ∈ (𝑈‘𝑦)))
7		elin 4096	. . . . . . 7 ⊢ (𝑦 ∈ (Fin ∩ 𝒫 𝑋) ↔ (𝑦 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝑋))
8		elpwi 4567	. . . . . . . 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 3099	. . 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 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ ciun 4954  ‘cfv 6558  Fincfn 9001  Atomscatm 40512  AtLatcal 40513  PClcpclN 41136

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-om 7902  df-1o 8504  df-en 9002  df-fin 9005  df-proset 18497  df-poset 18516  df-plt 18531  df-lub 18547  df-glb 18548  df-join 18549  df-meet 18550  df-p0 18626  df-lat 18635  df-covers 40515  df-ats 40516  df-atl 40547  df-psubsp 40752  df-pclN 41137

This theorem is used by: (None)