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

Theorem clatl 17476
Description: A complete lattice is a lattice. (Contributed by NM, 18-Sep-2011.) TODO: use eqrelrdv2 5457 to shorten proof and eliminate joindmss 17367 and meetdmss 17381?
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 2825 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2825 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
3 simpl 476 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
41, 2, 3joindmss 17367 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
5 relxp 5364 . . . . . . . 8 Rel ((Base‘𝐾) × (Base‘𝐾))
65a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
7 opelxp 5382 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)))
8 vex 3417 . . . . . . . . . . . . 13 𝑥 ∈ V
9 vex 3417 . . . . . . . . . . . . 13 𝑦 ∈ V
108, 9prss 4571 . . . . . . . . . . . 12 ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
117, 10sylbb 211 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
12 prex 5132 . . . . . . . . . . . 12 {𝑥, 𝑦} ∈ V
1312elpw 4386 . . . . . . . . . . 11 ({𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
1411, 13sylibr 226 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾))
15 eleq2 2895 . . . . . . . . . 10 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (lub‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
1614, 15syl5ibr 238 . . . . . . . . 9 (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
1716adantl 475 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
18 eqid 2825 . . . . . . . . 9 (lub‘𝐾) = (lub‘𝐾)
198a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
209a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
2118, 2, 3, 19, 20joindef 17364 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (lub‘𝐾)))
2217, 21sylibrd 251 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (join‘𝐾)))
236, 22relssdv 5450 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (join‘𝐾))
244, 23eqssd 3844 . . . . 5 ((𝐾 ∈ Poset ∧ dom (lub‘𝐾) = 𝒫 (Base‘𝐾)) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
2524ex 403 . . . 4 (𝐾 ∈ Poset → (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) → dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
26 eqid 2825 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
27 simpl 476 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝐾 ∈ Poset)
281, 26, 27meetdmss 17381 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) ⊆ ((Base‘𝐾) × (Base‘𝐾)))
295a1i 11 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → Rel ((Base‘𝐾) × (Base‘𝐾)))
30 eleq2 2895 . . . . . . . . . 10 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → ({𝑥, 𝑦} ∈ dom (glb‘𝐾) ↔ {𝑥, 𝑦} ∈ 𝒫 (Base‘𝐾)))
3114, 30syl5ibr 238 . . . . . . . . 9 (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3231adantl 475 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
33 eqid 2825 . . . . . . . . 9 (glb‘𝐾) = (glb‘𝐾)
348a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑥 ∈ V)
359a1i 11 . . . . . . . . 9 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → 𝑦 ∈ V)
3633, 26, 27, 34, 35meetdef 17378 . . . . . . . 8 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾) ↔ {𝑥, 𝑦} ∈ dom (glb‘𝐾)))
3732, 36sylibrd 251 . . . . . . 7 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐾) × (Base‘𝐾)) → ⟨𝑥, 𝑦⟩ ∈ dom (meet‘𝐾)))
3829, 37relssdv 5450 . . . . . 6 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → ((Base‘𝐾) × (Base‘𝐾)) ⊆ dom (meet‘𝐾))
3928, 38eqssd 3844 . . . . 5 ((𝐾 ∈ Poset ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))
4039ex 403 . . . 4 (𝐾 ∈ Poset → (dom (glb‘𝐾) = 𝒫 (Base‘𝐾) → dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾))))
4125, 40anim12d 602 . . 3 (𝐾 ∈ Poset → ((dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾)) → (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4241imdistani 564 . 2 ((𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))) → (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
431, 18, 33isclat 17469 . 2 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))))
441, 2, 26islat 17407 . 2 (𝐾 ∈ Lat ↔ (𝐾 ∈ Poset ∧ (dom (join‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)) ∧ dom (meet‘𝐾) = ((Base‘𝐾) × (Base‘𝐾)))))
4542, 43, 443imtr4i 284 1 (𝐾 ∈ CLat → 𝐾 ∈ Lat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 386   = wceq 1656  wcel 2164  Vcvv 3414  wss 3798  𝒫 cpw 4380  {cpr 4401  cop 4405   × cxp 5344  dom cdm 5346  Rel wrel 5351  cfv 6127  Basecbs 16229  Posetcpo 17300  lubclub 17302  glbcglb 17303  joincjn 17304  meetcmee 17305  Latclat 17405  CLatccla 17467
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-8 2166  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-rep 4996  ax-sep 5007  ax-nul 5015  ax-pow 5067  ax-pr 5129  ax-un 7214
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4147  df-if 4309  df-pw 4382  df-sn 4400  df-pr 4402  df-op 4406  df-uni 4661  df-iun 4744  df-br 4876  df-opab 4938  df-mpt 4955  df-id 5252  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-f1 6132  df-fo 6133  df-f1o 6134  df-fv 6135  df-riota 6871  df-oprab 6914  df-lub 17334  df-glb 17335  df-join 17336  df-meet 17337  df-lat 17406  df-clat 17468
This theorem is referenced by:  lubel  17482  lubun  17483  clatleglb  17486
  Copyright terms: Public domain W3C validator