Theorem isatl 40450

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.

Step	Hyp	Ref	Expression
1		fveq2 6886	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
2		isatlat.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
3	1, 2	eqtr4di 2813	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
4		fveq2 6886	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (glb‘𝑘) = (glb‘𝐾))
5		isatlat.g	. . . . . . 7 ⊢ 𝐺 = (glb‘𝐾)
6	4, 5	eqtr4di 2813	. . . . . 6 ⊢ (𝑘 = 𝐾 → (glb‘𝑘) = 𝐺)
7	6	dmeqd 5886	. . . . 5 ⊢ (𝑘 = 𝐾 → dom (glb‘𝑘) = dom 𝐺)
8	3, 7	eleq12d 2854	. . . 4 ⊢ (𝑘 = 𝐾 → ((Base‘𝑘) ∈ dom (glb‘𝑘) ↔ 𝐵 ∈ dom 𝐺))
9		fveq2 6886	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (0.‘𝑘) = (0.‘𝐾))
10		isatlat.z	. . . . . . . 8 ⊢ 0 = (0.‘𝐾)
11	9, 10	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (0.‘𝑘) = 0 )
12	11	neeq2d 3015	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑥 ≠ (0.‘𝑘) ↔ 𝑥 ≠ 0 ))
13		fveq2 6886	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
14		isatlat.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
15	13, 14	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
16		fveq2 6886	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
17		isatlat.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
18	16, 17	eqtr4di 2813	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
19	18	breqd 5113	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑦(le‘𝑘)𝑥 ↔ 𝑦 ≤ 𝑥))
20	15, 19	rexeqbidv 3335	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥 ↔ ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))
21	12, 20	imbi12d 347	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥) ↔ (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)))
22	3, 21	raleqbidv 3334	. . . 4 ⊢ (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)))
23	8, 22	anbi12d 644	. . 3 ⊢ (𝑘 = 𝐾 → (((Base‘𝑘) ∈ dom (glb‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥)) ↔ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))))
24		df-atl 40449	. . 3 ⊢ AtLat = {𝑘 ∈ Lat ∣ ((Base‘𝑘) ∈ dom (glb‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)(𝑥 ≠ (0.‘𝑘) → ∃𝑦 ∈ (Atoms‘𝑘)𝑦(le‘𝑘)𝑥))}
25	23, 24	elrab2 3648	. 2 ⊢ (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))))
26		3anass 1111	. 2 ⊢ ((𝐾 ∈ Lat ∧ 𝐵 ∈ dom 𝐺 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) ↔ (𝐾 ∈ Lat ∧ (𝐵 ∈ dom 𝐺 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥))))
27	25, 26	bitr4i 281	1 ⊢ (𝐾 ∈ AtLat ↔ (𝐾 ∈ Lat ∧ 𝐵 ∈ dom 𝐺 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≠ 0 → ∃𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ 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:  atllat  40451  atl0dm  40453  atlex  40467