Theorem pclssidN 40776

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 4929	. 2 ⊢ 𝑋 ⊆ ∩ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋 ⊆ 𝑦}
2		pclss.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		eqid 2762	. . 3 ⊢ (PSubSp‘𝐾) = (PSubSp‘𝐾)
4		pclss.c	. . 3 ⊢ 𝑈 = (PCl‘𝐾)
5	2, 3, 4	pclvalN 40771	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ⊆ 𝐴) → (𝑈‘𝑋) = ∩ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋 ⊆ 𝑦})
6	1, 5	sseqtrrid 3977	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ (𝑈‘𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3414   ⊆ wss 3902  ∩ cint 4910  ‘cfv 6537  Atomscatm 40144  PSubSpcpsubsp 40377  PClcpclN 40768

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-psubsp 40384  df-pclN 40769

This theorem is used by:  pclunN  40779  pcl0bN  40804  pclfinclN  40831