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

Theorem linepsubclN 40827
Description: A line is a closed projective subspace. (Contributed by NM, 25-Jan-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
linepsubcl.n 𝑁 = (Lines‘𝐾)
linepsubcl.c 𝐶 = (PSubCl‘𝐾)
Assertion
Ref Expression
linepsubclN ((𝐾 ∈ HL ∧ 𝑋𝑁) → 𝑋𝐶)

Proof of Theorem linepsubclN
Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 hllat 40239 . . . 4 (𝐾 ∈ HL → 𝐾 ∈ Lat)
2 eqid 2760 . . . . 5 (join‘𝐾) = (join‘𝐾)
3 eqid 2760 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
4 linepsubcl.n . . . . 5 𝑁 = (Lines‘𝐾)
5 eqid 2760 . . . . 5 (pmap‘𝐾) = (pmap‘𝐾)
62, 3, 4, 5isline2 40650 . . . 4 (𝐾 ∈ Lat → (𝑋𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)))))
71, 6syl 18 . . 3 (𝐾 ∈ HL → (𝑋𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)))))
81adantr 486 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → 𝐾 ∈ Lat)
9 eqid 2760 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
109, 3atbase 40165 . . . . . . . . 9 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
1110ad2antrl 741 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → 𝑝 ∈ (Base‘𝐾))
129, 3atbase 40165 . . . . . . . . 9 (𝑞 ∈ (Atoms‘𝐾) → 𝑞 ∈ (Base‘𝐾))
1312ad2antll 742 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → 𝑞 ∈ (Base‘𝐾))
149, 2latjcl 18530 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑝 ∈ (Base‘𝐾) ∧ 𝑞 ∈ (Base‘𝐾)) → (𝑝(join‘𝐾)𝑞) ∈ (Base‘𝐾))
158, 11, 13, 14syl3anc 1398 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → (𝑝(join‘𝐾)𝑞) ∈ (Base‘𝐾))
16 linepsubcl.c . . . . . . . 8 𝐶 = (PSubCl‘𝐾)
179, 5, 16pmapsubclN 40822 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑝(join‘𝐾)𝑞) ∈ (Base‘𝐾)) → ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)) ∈ 𝐶)
1815, 17syldan 603 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)) ∈ 𝐶)
19 eleq1a 2855 . . . . . 6 (((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)) ∈ 𝐶 → (𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)) → 𝑋𝐶))
2018, 19syl 18 . . . . 5 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → (𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞)) → 𝑋𝐶))
2120adantld 496 . . . 4 ((𝐾 ∈ HL ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ((𝑝𝑞𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞))) → 𝑋𝐶))
2221rexlimdvva 3219 . . 3 (𝐾 ∈ HL → (∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = ((pmap‘𝐾)‘(𝑝(join‘𝐾)𝑞))) → 𝑋𝐶))
237, 22sylbid 243 . 2 (𝐾 ∈ HL → (𝑋𝑁𝑋𝐶))
2423imp 412 1 ((𝐾 ∈ HL ∧ 𝑋𝑁) → 𝑋𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wne 2955  wrex 3086  cfv 6533  (class class class)co 7414  Basecbs 17304  joincjn 18402  Latclat 18522  Atomscatm 40139  HLchlt 40226  Linesclines 40370  pmapcpmap 40373  PSubClcpscN 40810
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  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-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-proset 18385  df-poset 18404  df-plt 18419  df-lub 18435  df-glb 18436  df-join 18437  df-meet 18438  df-p0 18514  df-p1 18515  df-lat 18523  df-clat 18590  df-oposet 40052  df-ol 40054  df-oml 40055  df-covers 40142  df-ats 40143  df-atl 40174  df-cvlat 40198  df-hlat 40227  df-lines 40377  df-pmap 40380  df-polarityN 40779  df-psubclN 40811
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator