Metamath Proof Explorer


Theorem pclidN

Description: The projective subspace closure of a projective subspace is itself. (Contributed by NM, 8-Sep-2013) (New usage is discouraged.)

Ref Expression
Hypotheses pclid.s 𝑆 = ( PSubSp ‘ 𝐾 )
pclid.c 𝑈 = ( PCl ‘ 𝐾 )
Assertion pclidN ( ( 𝐾𝑉𝑋𝑆 ) → ( 𝑈𝑋 ) = 𝑋 )

Proof

Step Hyp Ref Expression
1 pclid.s 𝑆 = ( PSubSp ‘ 𝐾 )
2 pclid.c 𝑈 = ( PCl ‘ 𝐾 )
3 eqid ( Atoms ‘ 𝐾 ) = ( Atoms ‘ 𝐾 )
4 3 1 psubssat ( ( 𝐾𝑉𝑋𝑆 ) → 𝑋 ⊆ ( Atoms ‘ 𝐾 ) )
5 3 1 2 pclvalN ( ( 𝐾𝑉𝑋 ⊆ ( Atoms ‘ 𝐾 ) ) → ( 𝑈𝑋 ) = { 𝑦𝑆𝑋𝑦 } )
6 4 5 syldan ( ( 𝐾𝑉𝑋𝑆 ) → ( 𝑈𝑋 ) = { 𝑦𝑆𝑋𝑦 } )
7 intmin ( 𝑋𝑆 { 𝑦𝑆𝑋𝑦 } = 𝑋 )
8 7 adantl ( ( 𝐾𝑉𝑋𝑆 ) → { 𝑦𝑆𝑋𝑦 } = 𝑋 )
9 6 8 eqtrd ( ( 𝐾𝑉𝑋𝑆 ) → ( 𝑈𝑋 ) = 𝑋 )