Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pclun2N Structured version   Visualization version   GIF version

Theorem pclun2N 40714
Description: The projective subspace closure of the union of two subspaces equals their projective sum. (Contributed by NM, 12-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
pclun2.s 𝑆 = (PSubSp‘𝐾)
pclun2.p + = (+𝑃𝐾)
pclun2.c 𝑈 = (PCl‘𝐾)
Assertion
Ref Expression
pclun2N ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑈‘(𝑋𝑌)) = (𝑋 + 𝑌))

Proof of Theorem pclun2N
StepHypRef Expression
1 simp1 1154 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝐾 ∈ HL)
2 eqid 2766 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
3 pclun2.s . . . . 5 𝑆 = (PSubSp‘𝐾)
42, 3psubssat 40569 . . . 4 ((𝐾 ∈ HL ∧ 𝑋𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
543adant3 1150 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
62, 3psubssat 40569 . . . 4 ((𝐾 ∈ HL ∧ 𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
763adant2 1149 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
8 pclun2.p . . . 4 + = (+𝑃𝐾)
9 pclun2.c . . . 4 𝑈 = (PCl‘𝐾)
102, 8, 9pclunN 40713 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑈‘(𝑋𝑌)) = (𝑈‘(𝑋 + 𝑌)))
111, 5, 7, 10syl3anc 1398 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑈‘(𝑋𝑌)) = (𝑈‘(𝑋 + 𝑌)))
123, 8paddclN 40657 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ∈ 𝑆)
133, 9pclidN 40711 . . 3 ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌))
141, 12, 13syl2anc 596 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌))
1511, 14eqtrd 2801 1 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑈‘(𝑋𝑌)) = (𝑋 + 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  w3a 1103   = wceq 1570  wcel 2146  cun 3906  wss 3908  cfv 6543  (class class class)co 7423  Atomscatm 40078  HLchlt 40165  PSubSpcpsubsp 40311  +𝑃cpadd 40610  PClcpclN 40702
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-proset 18375  df-poset 18394  df-plt 18409  df-lub 18425  df-glb 18426  df-join 18427  df-meet 18428  df-p0 18504  df-lat 18513  df-clat 18580  df-oposet 39991  df-ol 39993  df-oml 39994  df-covers 40081  df-ats 40082  df-atl 40113  df-cvlat 40137  df-hlat 40166  df-psubsp 40318  df-padd 40611  df-pclN 40703
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator