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

Theorem snatpsubN 38559
Description: The singleton of an atom is a projective subspace. (Contributed by NM, 9-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
snpsub.a 𝐴 = (Atoms‘𝐾)
snpsub.s 𝑆 = (PSubSp‘𝐾)
Assertion
Ref Expression
snatpsubN ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → {𝑃} ∈ 𝑆)

Proof of Theorem snatpsubN
Dummy variables 𝑞 𝑝 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snssi 4810 . . . . . 6 (𝑃𝐴 → {𝑃} ⊆ 𝐴)
21adantl 483 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → {𝑃} ⊆ 𝐴)
3 atllat 38108 . . . . . . . . . . . . . . 15 (𝐾 ∈ AtLat → 𝐾 ∈ Lat)
4 eqid 2733 . . . . . . . . . . . . . . . 16 (Base‘𝐾) = (Base‘𝐾)
5 snpsub.a . . . . . . . . . . . . . . . 16 𝐴 = (Atoms‘𝐾)
64, 5atbase 38097 . . . . . . . . . . . . . . 15 (𝑃𝐴𝑃 ∈ (Base‘𝐾))
7 eqid 2733 . . . . . . . . . . . . . . . 16 (join‘𝐾) = (join‘𝐾)
84, 7latjidm 18411 . . . . . . . . . . . . . . 15 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾)) → (𝑃(join‘𝐾)𝑃) = 𝑃)
93, 6, 8syl2an 597 . . . . . . . . . . . . . 14 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
109adantr 482 . . . . . . . . . . . . 13 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
1110breq2d 5159 . . . . . . . . . . . 12 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃) ↔ 𝑟(le‘𝐾)𝑃))
12 eqid 2733 . . . . . . . . . . . . . . . 16 (le‘𝐾) = (le‘𝐾)
1312, 5atcmp 38119 . . . . . . . . . . . . . . 15 ((𝐾 ∈ AtLat ∧ 𝑟𝐴𝑃𝐴) → (𝑟(le‘𝐾)𝑃𝑟 = 𝑃))
14133com23 1127 . . . . . . . . . . . . . 14 ((𝐾 ∈ AtLat ∧ 𝑃𝐴𝑟𝐴) → (𝑟(le‘𝐾)𝑃𝑟 = 𝑃))
15143expa 1119 . . . . . . . . . . . . 13 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (𝑟(le‘𝐾)𝑃𝑟 = 𝑃))
1615biimpd 228 . . . . . . . . . . . 12 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (𝑟(le‘𝐾)𝑃𝑟 = 𝑃))
1711, 16sylbid 239 . . . . . . . . . . 11 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃) → 𝑟 = 𝑃))
1817adantld 492 . . . . . . . . . 10 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (((𝑝 = 𝑃𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)) → 𝑟 = 𝑃))
19 velsn 4643 . . . . . . . . . . . . 13 (𝑝 ∈ {𝑃} ↔ 𝑝 = 𝑃)
20 velsn 4643 . . . . . . . . . . . . 13 (𝑞 ∈ {𝑃} ↔ 𝑞 = 𝑃)
2119, 20anbi12i 628 . . . . . . . . . . . 12 ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ↔ (𝑝 = 𝑃𝑞 = 𝑃))
2221anbi1i 625 . . . . . . . . . . 11 (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)))
23 oveq12 7413 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑞 = 𝑃) → (𝑝(join‘𝐾)𝑞) = (𝑃(join‘𝐾)𝑃))
2423breq2d 5159 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑞 = 𝑃) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ↔ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
2524pm5.32i 576 . . . . . . . . . . 11 (((𝑝 = 𝑃𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
2622, 25bitri 275 . . . . . . . . . 10 (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) ↔ ((𝑝 = 𝑃𝑞 = 𝑃) ∧ 𝑟(le‘𝐾)(𝑃(join‘𝐾)𝑃)))
27 velsn 4643 . . . . . . . . . 10 (𝑟 ∈ {𝑃} ↔ 𝑟 = 𝑃)
2818, 26, 273imtr4g 296 . . . . . . . . 9 (((𝐾 ∈ AtLat ∧ 𝑃𝐴) ∧ 𝑟𝐴) → (((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) ∧ 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞)) → 𝑟 ∈ {𝑃}))
2928exp4b 432 . . . . . . . 8 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → (𝑟𝐴 → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
3029com23 86 . . . . . . 7 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → (𝑟𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
3130ralrimdv 3153 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → ((𝑝 ∈ {𝑃} ∧ 𝑞 ∈ {𝑃}) → ∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃})))
3231ralrimivv 3199 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))
332, 32jca 513 . . . 4 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃})))
3433ex 414 . . 3 (𝐾 ∈ AtLat → (𝑃𝐴 → ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
35 snpsub.s . . . 4 𝑆 = (PSubSp‘𝐾)
3612, 7, 5, 35ispsubsp 38554 . . 3 (𝐾 ∈ AtLat → ({𝑃} ∈ 𝑆 ↔ ({𝑃} ⊆ 𝐴 ∧ ∀𝑝 ∈ {𝑃}∀𝑞 ∈ {𝑃}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑃}))))
3734, 36sylibrd 259 . 2 (𝐾 ∈ AtLat → (𝑃𝐴 → {𝑃} ∈ 𝑆))
3837imp 408 1 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → {𝑃} ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3062  wss 3947  {csn 4627   class class class wbr 5147  cfv 6540  (class class class)co 7404  Basecbs 17140  lecple 17200  joincjn 18260  Latclat 18380  Atomscatm 38071  AtLatcal 38072  PSubSpcpsubsp 38305
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7720
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7360  df-ov 7407  df-oprab 7408  df-proset 18244  df-poset 18262  df-plt 18279  df-lub 18295  df-glb 18296  df-join 18297  df-meet 18298  df-p0 18374  df-lat 18381  df-covers 38074  df-ats 38075  df-atl 38106  df-psubsp 38312
This theorem is referenced by:  pointpsubN  38560  pclfinN  38709  pclfinclN  38759
  Copyright terms: Public domain W3C validator