MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  clatl Structured version   Visualization version   GIF version

Theorem clatl 18474
Description: A complete lattice is a lattice. (Contributed by NM, 18-Sep-2011.) TODO: use eqrelrdv2 5751 to shorten proof and eliminate joindmss 18343 and meetdmss 18357?
Assertion
Ref Expression
clatl (𝐾 ∈ CLat → 𝐾 ∈ Lat)

Proof of Theorem clatl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2736 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
3 simpl 482 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
41, 2, 3joindmss 18343 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
5 relxp 5649 . . . . . . . 8 Rel ((Base‘𝐾) × (Base‘𝐾))
65a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
7 opelxp 5667 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)))
8 vex 3433 . . . . . . . . . . . . 13 𝑥 ∈ V
9 vex 3433 . . . . . . . . . . . . 13 𝑦 ∈ V
108, 9prss 4763 . . . . . . . . . . . 12 ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
117, 10sylbb 219 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
12 prex 5380 . . . . . . . . . . . 12 {𝑥, 𝑦} ∈ V
1312elpw 4545 . . . . . . . . . . 11 ({𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
1411, 13sylibr 234 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾))
15 eleq2 2825 . . . . . . . . . 10 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
1614, 15imbitrrid 246 . . . . . . . . 9 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
1716adantl 481 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
18 eqid 2736 . . . . . . . . 9 (lub‘𝐾) = (lub‘𝐾)
198a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
209a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
2118, 2, 3, 19, 20joindef 18340 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
2217, 21sylibrd 259 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾)))
236, 22relssdv 5744 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (join‘𝐾))
244, 23eqssd 3939 . . . . 5 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
2524ex 412 . . . 4 (𝐾 ∈ Poset → (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
26 eqid 2736 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
27 simpl 482 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
281, 26, 27meetdmss 18357 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
295a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
30 eleq2 2825 . . . . . . . . . 10 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
3114, 30imbitrrid 246 . . . . . . . . 9 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3231adantl 481 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
33 eqid 2736 . . . . . . . . 9 (glb‘𝐾) = (glb‘𝐾)
348a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
359a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
3633, 26, 27, 34, 35meetdef 18354 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3732, 36sylibrd 259 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾)))
3829, 37relssdv 5744 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (meet‘𝐾))
3928, 38eqssd 3939 . . . . 5 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
4039ex 412 . . . 4 (𝐾 ∈ Poset → (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
4125, 40anim12d 610 . . 3 (𝐾 ∈ Poset → ((dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4241imdistani 568 . 2 ((𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))) → (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
431, 18, 33isclat 18466 . 2 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))))
441, 2, 26islat 18399 . 2 (𝐾 ∈ Lat ↔ (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4542, 43, 443imtr4i 292 1 (𝐾 ∈ CLat → 𝐾 ∈ Lat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3429  wss 3889  𝒫 cpw 4541  {cpr 4569  cop 4573   × cxp 5629  dom cdm 5631  Rel wrel 5636  cfv 6498  Basecbs 17179  Posetcpo 18273  lubclub 18275  glbcglb 18276  joincjn 18277  meetcmee 18278  Latclat 18397  CLatccla 18464
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-oprab 7371  df-lub 18310  df-glb 18311  df-join 18312  df-meet 18313  df-lat 18398  df-clat 18465
This theorem is referenced by:  lubel  18480  lubun  18481  clatleglb  18484  topdlat  49479
  Copyright terms: Public domain W3C validator