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

Theorem pmap0 40638
Description: Value of the projective map of a Hilbert lattice at lattice zero. Part of Theorem 15.5.1 of [MaedaMaeda] p. 62. (Contributed by NM, 17-Oct-2011.)
Hypotheses
Ref Expression
pmap0.z 0 = (0.‘𝐾)
pmap0.m 𝑀 = (pmap‘𝐾)
Assertion
Ref Expression
pmap0 (𝐾 ∈ AtLat → (𝑀0 ) = ∅)

Proof of Theorem pmap0
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 pmap0.z . . . 4 0 = (0.‘𝐾)
31, 2atl0cl 40176 . . 3 (𝐾 ∈ AtLat → 0 ∈ (Base‘𝐾))
4 eqid 2760 . . . 4 (le‘𝐾) = (le‘𝐾)
5 eqid 2760 . . . 4 (Atoms‘𝐾) = (Atoms‘𝐾)
6 pmap0.m . . . 4 𝑀 = (pmap‘𝐾)
71, 4, 5, 6pmapval 40630 . . 3 ((𝐾 ∈ AtLat ∧ 0 ∈ (Base‘𝐾)) → (𝑀0 ) = {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 })
83, 7mpdan 700 . 2 (𝐾 ∈ AtLat → (𝑀0 ) = {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 })
94, 2, 5atnle0 40182 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑎 ∈ (Atoms‘𝐾)) → ¬ 𝑎(le‘𝐾) 0 )
109nrexdv 3157 . . . 4 (𝐾 ∈ AtLat → ¬ ∃𝑎 ∈ (Atoms‘𝐾)𝑎(le‘𝐾) 0 )
11 rabn0 4339 . . . 4 ({𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅ ↔ ∃𝑎 ∈ (Atoms‘𝐾)𝑎(le‘𝐾) 0 )
1210, 11sylnibr 332 . . 3 (𝐾 ∈ AtLat → ¬ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅)
13 nne 2959 . . 3 (¬ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅ ↔ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } = ∅)
1412, 13sylib 221 . 2 (𝐾 ∈ AtLat → {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } = ∅)
158, 14eqtrd 2795 1 (𝐾 ∈ AtLat → (𝑀0 ) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wcel 2145  wne 2955  wrex 3086  {crab 3412  c0 4279   class class class wbr 5103  cfv 6533  Basecbs 17301  lecple 17349  0.cp0 18509  Atomscatm 40136  AtLatcal 40137  pmapcpmap 40370
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 7736
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-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 7370  df-proset 18382  df-poset 18401  df-plt 18416  df-glb 18433  df-p0 18511  df-lat 18520  df-covers 40139  df-ats 40140  df-atl 40171  df-pmap 40377
This theorem is used by:  pmapeq0  40639  pmapjat1  40726  pol1N  40783  pnonsingN  40806
  Copyright terms: Public domain W3C validator