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

Theorem isatl 39806
Description: The predicate "is an atomic lattice." Every nonzero element is less than or equal to an atom. (Contributed by NM, 18-Sep-2011.) (Revised by NM, 14-Sep-2018.)
Hypotheses
Ref Expression
isatlat.b 𝐵 = (Base‘𝐾)
isatlat.g 𝐺 = (glb‘𝐾)
isatlat.l = (le‘𝐾)
isatlat.z 0 = (0.‘𝐾)
isatlat.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
isatl (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ 𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥)))
Distinct variable groups:   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦,𝐾
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)   𝐺(𝑥,𝑦)   (𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem isatl
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6831 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
2 isatlat.b . . . . . 6 𝐵 = (Base‘𝐾)
31, 2eqtr4di 2794 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
4 fveq2 6831 . . . . . . 7 (𝑘 = 𝐾 → (glb‘𝑘) = (glb‘𝐾))
5 isatlat.g . . . . . . 7 𝐺 = (glb‘𝐾)
64, 5eqtr4di 2794 . . . . . 6 (𝑘 = 𝐾 → (glb‘𝑘) = 𝐺)
76dmeqd 5854 . . . . 5 (𝑘 = 𝐾 → dom (glb‘𝑘) = dom 𝐺)
83, 7eleq12d 2835 . . . 4 (𝑘 = 𝐾 → ((Base‘𝑘) ∈ dom (glb‘𝑘) ↔ 𝐵 ∈ dom 𝐺))
9 fveq2 6831 . . . . . . . 8 (𝑘 = 𝐾 → (0.‘𝑘) = (0.‘𝐾))
10 isatlat.z . . . . . . . 8 0 = (0.‘𝐾)
119, 10eqtr4di 2794 . . . . . . 7 (𝑘 = 𝐾 → (0.‘𝑘) = 0 )
1211neeq2d 2996 . . . . . 6 (𝑘 = 𝐾 → (𝑥 ≠ (0.‘𝑘) ↔ 𝑥0 ))
13 fveq2 6831 . . . . . . . 8 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
14 isatlat.a . . . . . . . 8 𝐴 = (Atoms‘𝐾)
1513, 14eqtr4di 2794 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
16 fveq2 6831 . . . . . . . . 9 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
17 isatlat.l . . . . . . . . 9 = (le‘𝐾)
1816, 17eqtr4di 2794 . . . . . . . 8 (𝑘 = 𝐾 → (le‘𝑘) = )
1918breqd 5086 . . . . . . 7 (𝑘 = 𝐾 → (𝑦(le‘𝑘)𝑥𝑦 𝑥))
2015, 19rexeqbidv 3316 . . . . . 6 (𝑘 = 𝐾 → (∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥 ↔ ∃𝑦𝐴 𝑦 𝑥))
2112, 20imbi12d 346 . . . . 5 (𝑘 = 𝐾 → ((𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥) ↔ (𝑥0 → ∃𝑦𝐴 𝑦 𝑥)))
223, 21raleqbidv 3315 . . . 4 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥) ↔ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥)))
238, 22anbi12d 639 . . 3 (𝑘 = 𝐾 → (((Base‘𝑘) ∈ dom (glb‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥)) ↔ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥))))
24 df-atl 39805 . . 3 AtLat = {𝑘 ∈ Lat ∣ ((Base‘𝑘) ∈ dom (glb‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥))}
2523, 24elrab2 3634 . 2 (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥))))
26 3anass 1101 . 2 ((𝐾 ∈ Lat ∧ 𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥)) ↔ (𝐾 ∈ Lat ∧ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥))))
2725, 26bitr4i 280 1 (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ 𝐵 ∈ dom 𝐺 ∧ ∀𝑥𝐵 (𝑥0 → ∃𝑦𝐴 𝑦 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397  w3a 1093   = wceq 1548  wcel 2121  wne 2936  wral 3055  wrex 3065   class class class wbr 5075  dom cdm 5621  cfv 6489  Basecbs 17174  lecple 17222  glbcglb 18271  0.cp0 18382  Latclat 18392  Atomscatm 39770  AtLatcal 39771
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-dm 5631  df-iota 6445  df-fv 6497  df-atl 39805
This theorem is referenced by:  atllat  39807  atl0dm  39809  atlex  39823
  Copyright terms: Public domain W3C validator