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 40572
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 2765 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 pmap0.z . . . 4 0 = (0.‘𝐾)
31, 2atl0cl 40110 . . 3 (𝐾 ∈ AtLat → 0 ∈ (Base‘𝐾))
4 eqid 2765 . . . 4 (le‘𝐾) = (le‘𝐾)
5 eqid 2765 . . . 4 (Atoms‘𝐾) = (Atoms‘𝐾)
6 pmap0.m . . . 4 𝑀 = (pmap‘𝐾)
71, 4, 5, 6pmapval 40564 . . 3 ((𝐾 ∈ AtLat ∧ 0 ∈ (Base‘𝐾)) → (𝑀0 ) = {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 })
83, 7mpdan 700 . 2 (𝐾 ∈ AtLat → (𝑀0 ) = {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 })
94, 2, 5atnle0 40116 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑎 ∈ (Atoms‘𝐾)) → ¬ 𝑎(le‘𝐾) 0 )
109nrexdv 3162 . . . 4 (𝐾 ∈ AtLat → ¬ ∃𝑎 ∈ (Atoms‘𝐾)𝑎(le‘𝐾) 0 )
11 rabn0 4346 . . . 4 ({𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅ ↔ ∃𝑎 ∈ (Atoms‘𝐾)𝑎(le‘𝐾) 0 )
1210, 11sylnibr 332 . . 3 (𝐾 ∈ AtLat → ¬ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅)
13 nne 2964 . . 3 (¬ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } ≠ ∅ ↔ {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } = ∅)
1412, 13sylib 221 . 2 (𝐾 ∈ AtLat → {𝑎 ∈ (Atoms‘𝐾) ∣ 𝑎(le‘𝐾) 0 } = ∅)
158, 14eqtrd 2800 1 (𝐾 ∈ AtLat → (𝑀0 ) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wcel 2146  wne 2960  wrex 3091  {crab 3418  c0 4286   class class class wbr 5111  cfv 6540  Basecbs 17287  lecple 17335  0.cp0 18495  Atomscatm 40070  AtLatcal 40071  pmapcpmap 40304
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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-proset 18368  df-poset 18387  df-plt 18402  df-glb 18419  df-p0 18497  df-lat 18506  df-covers 40073  df-ats 40074  df-atl 40105  df-pmap 40311
This theorem is used by:  pmapeq0  40573  pmapjat1  40660  pol1N  40717  pnonsingN  40740
  Copyright terms: Public domain W3C validator