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

Theorem clatl 16939
 Description: A complete lattice is a lattice. (Contributed by NM, 18-Sep-2011.) TODO: use eqrelrdv2 5142 to shorten proof and eliminate joindmss 16830 and meetdmss 16844?
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 2610 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2610 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
3 simpl 472 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
41, 2, 3joindmss 16830 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
5 relxp 5150 . . . . . . . 8 Rel ((Base‘𝐾) × (Base‘𝐾))
65a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
7 opelxp 5070 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)))
8 vex 3176 . . . . . . . . . . . . 13 𝑥 ∈ V
9 vex 3176 . . . . . . . . . . . . 13 𝑦 ∈ V
108, 9prss 4291 . . . . . . . . . . . 12 ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
117, 10sylbb 208 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
12 prex 4836 . . . . . . . . . . . 12 {𝑥, 𝑦} ∈ V
1312elpw 4114 . . . . . . . . . . 11 ({𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
1411, 13sylibr 223 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾))
15 eleq2 2677 . . . . . . . . . 10 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
1614, 15syl5ibr 235 . . . . . . . . 9 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
1716adantl 481 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
18 eqid 2610 . . . . . . . . 9 (lub‘𝐾) = (lub‘𝐾)
198a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
209a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
2118, 2, 3, 19, 20joindef 16827 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
2217, 21sylibrd 248 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾)))
236, 22relssdv 5135 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (join‘𝐾))
244, 23eqssd 3585 . . . . 5 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
2524ex 449 . . . 4 (𝐾 ∈ Poset → (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
26 eqid 2610 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
27 simpl 472 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
281, 26, 27meetdmss 16844 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
295a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
30 eleq2 2677 . . . . . . . . . 10 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
3114, 30syl5ibr 235 . . . . . . . . 9 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3231adantl 481 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
33 eqid 2610 . . . . . . . . 9 (glb‘𝐾) = (glb‘𝐾)
348a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
359a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
3633, 26, 27, 34, 35meetdef 16841 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3732, 36sylibrd 248 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾)))
3829, 37relssdv 5135 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (meet‘𝐾))
3928, 38eqssd 3585 . . . . 5 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
4039ex 449 . . . 4 (𝐾 ∈ Poset → (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
4125, 40anim12d 584 . . 3 (𝐾 ∈ Poset → ((dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4241imdistani 722 . 2 ((𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))) → (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
431, 18, 33isclat 16932 . 2 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))))
441, 2, 26islat 16870 . 2 (𝐾 ∈ Lat ↔ (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4542, 43, 443imtr4i 280 1 (𝐾 ∈ CLat → 𝐾 ∈ Lat)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ⊆ wss 3540  𝒫 cpw 4108  {cpr 4127  ⟨cop 4131   × cxp 5036  dom cdm 5038  Rel wrel 5043  ‘cfv 5804  Basecbs 15695  Posetcpo 16763  lubclub 16765  glbcglb 16766  joincjn 16767  meetcmee 16768  Latclat 16868  CLatccla 16930 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-oprab 6553  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-lat 16869  df-clat 16931 This theorem is referenced by:  lubel  16945  lubun  16946  clatleglb  16949
 Copyright terms: Public domain W3C validator