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 40639
Description: Every nonzero element of an atomic lattice is greater than or equal to an atom. (hatomic 33019 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 2763 . . . . 5 (glb‘𝐾) = (glb‘𝐾)
3 atlex.l . . . . 5 ≤ = (le‘𝐾)
4 atlex.z . . . . 5 0 = (0.‘𝐾)
5 atlex.a . . . . 5 𝐴 = (Atoms‘𝐾)
61, 2, 3, 4, 5isatl 40622 . . . 4 (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ 𝐵 ∈ dom (glb‘𝐾) ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)))
76simp3bi 1165 . . 3 (𝐾 ∈ AtLat → ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))
8 neeq1 3021 . . . . 5 (𝑥 = 𝑋 → (𝑥 ≠ 0 ↔ 𝑋 ≠ 0 ))
9 breq2 5112 . . . . . 6 (𝑥 = 𝑋 → (𝑦 ≤ 𝑥 ↔ 𝑦 ≤ 𝑋))
109rexbidv 3190 . . . . 5 (𝑥 = 𝑋 → (∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋))
118, 10imbi12d 347 . . . 4 (𝑥 = 𝑋 → ((𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) ↔ (𝑋 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑋)))
1211rspccv 3577 . . 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 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   class class class wbr 5108  dom cdm 5658  ‘cfv 6566  Basecbs 17431  lecple 17479  glbcglb 18534  0.cp0 18645  Latclat 18655  Atomscatm 40586  AtLatcal 40587
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-dm 5668  df-iota 6520  df-fv 6574  df-atl 40621
This theorem is used by:  atnle  40640  atlatmstc  40642  cvratlem  40744  cvrat4  40766  2llnmat  40847  2lnat  41107
  Copyright terms: Public domain W3C validator