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

Theorem atlex 40467
Description: Every nonzero element of an atomic lattice is greater than or equal to an atom. (hatomic 32968 analog.) (Contributed by NM, 21-Oct-2011.)
Hypotheses
Ref Expression
atlex.b 𝐵 = (Base‘𝐾)
atlex.l ≤ = (le‘𝐾)
atlex.z 0 = (0.‘𝐾)
atlex.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
atlex ((𝐾 ∈ AtLat ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)
Distinct variable groups:   𝑦,𝐴   𝑦,𝐾   𝑦,𝑋
Allowed substitution hints:   𝐵(𝑦)   ≤ (𝑦)   0 (𝑦)

Proof of Theorem atlex
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 atlex.b . . . . 5 𝐵 = (Base‘𝐾)
2 eqid 2760 . . . . 5 (glb‘𝐾) = (glb‘𝐾)
3 atlex.l . . . . 5 ≤ = (le‘𝐾)
4 atlex.z . . . . 5 0 = (0.‘𝐾)
5 atlex.a . . . . 5 𝐴 = (Atoms‘𝐾)
61, 2, 3, 4, 5isatl 40450 . . . 4 (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ 𝐵 ∈ dom (glb‘𝐾) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)))
76simp3bi 1165 . . 3 (𝐾 ∈ AtLat → ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))
8 neeq1 3017 . . . . 5 (𝑥 = 𝑋 → (𝑥 ≠ 0 ↔ 𝑋 ≠ 0 ))
9 breq2 5106 . . . . . 6 (𝑥 = 𝑋 → (𝑦 ≤ 𝑥 ↔ 𝑦 ≤ 𝑋))
109rexbidv 3186 . . . . 5 (𝑥 = 𝑋 → (∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋))
118, 10imbi12d 347 . . . 4 (𝑥 = 𝑋 → ((𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ↔ (𝑋 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)))
1211rspccv 3573 . . 3 (∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → (𝑋 ∈ 𝐵 → (𝑋 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)))
137, 12syl 18 . 2 (𝐾 ∈ AtLat → (𝑋 ∈ 𝐵 → (𝑋 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)))
14133imp 1128 1 ((𝐾 ∈ AtLat ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086   class class class wbr 5102  dom cdm 5650  ‘cfv 6539  Basecbs 17393  lecple 17441  glbcglb 18490  0.cp0 18601  Latclat 18611  Atomscatm 40414  AtLatcal 40415
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-dm 5660  df-iota 6494  df-fv 6547  df-atl 40449
This theorem is used by:  atnle  40468  atlatmstc  40470  cvratlem  40572  cvrat4  40594  2llnmat  40675  2lnat  40935
  Copyright terms: Public domain W3C validator