Theorem pclssidN 40920

Description: A set of atoms is included in its projective subspace closure. (Contributed by NM, 12-Sep-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
pclss.a	⊢ 𝐴 = (Atoms‘𝐾)
pclss.c	⊢ 𝑈 = (PCl‘𝐾)

Assertion

Ref	Expression
pclssidN	⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ (𝑈‘𝑋))

Proof of Theorem pclssidN

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssintub 4926	. 2 ⊢ 𝑋 ⊆ ∩ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋 ⊆ 𝑦}
2		pclss.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		eqid 2761	. . 3 ⊢ (PSubSp‘𝐾) = (PSubSp‘𝐾)
4		pclss.c	. . 3 ⊢ 𝑈 = (PCl‘𝐾)
5	2, 3, 4	pclvalN 40915	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) = ∩ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋 ⊆ 𝑦})
6	1, 5	sseqtrrid 3974	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ (𝑈‘𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413   ⊆ wss 3899  ∩ cint 4907  ‘cfv 6531  Atomscatm 40288  PSubSpcpsubsp 40521  PClcpclN 40912

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-psubsp 40528  df-pclN 40913

This theorem is used by:  pclunN  40923  pcl0bN  40948  pclfinclN  40975