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

Theorem op01dm 39646
Description: Conditions necessary for zero and unity elements to exist. (Contributed by NM, 14-Sep-2018.)
Hypotheses
Ref Expression
op01dm.b 𝐵 = (Base‘𝐾)
op01dm.u 𝑈 = (lub‘𝐾)
op01dm.g 𝐺 = (glb‘𝐾)
Assertion
Ref Expression
op01dm (𝐾 ∈ OP → (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺))

Proof of Theorem op01dm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 op01dm.b . . 3 𝐵 = (Base‘𝐾)
2 op01dm.u . . 3 𝑈 = (lub‘𝐾)
3 op01dm.g . . 3 𝐺 = (glb‘𝐾)
4 eqid 2737 . . 3 (le‘𝐾) = (le‘𝐾)
5 eqid 2737 . . 3 (oc‘𝐾) = (oc‘𝐾)
6 eqid 2737 . . 3 (join‘𝐾) = (join‘𝐾)
7 eqid 2737 . . 3 (meet‘𝐾) = (meet‘𝐾)
8 eqid 2737 . . 3 (0.‘𝐾) = (0.‘𝐾)
9 eqid 2737 . . 3 (1.‘𝐾) = (1.‘𝐾)
101, 2, 3, 4, 5, 6, 7, 8, 9isopos 39643 . 2 (𝐾 ∈ OP ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))))
11 simpl 482 . . 3 (((𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))) → (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺))
12113adantl1 1168 . 2 (((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))) → (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺))
1310, 12sylbi 217 1 (𝐾 ∈ OP → (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052   class class class wbr 5086  dom cdm 5625  cfv 6493  (class class class)co 7361  Basecbs 17173  lecple 17221  occoc 17222  Posetcpo 18267  lubclub 18269  glbcglb 18270  joincjn 18271  meetcmee 18272  0.cp0 18381  1.cp1 18382  OPcops 39635
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-ext 2709  ax-nul 5242
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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-dm 5635  df-iota 6449  df-fv 6501  df-ov 7364  df-oposet 39639
This theorem is referenced by:  op0cl  39647  op1cl  39648  op0le  39649  ople1  39654  lhp2lt  40464
  Copyright terms: Public domain W3C validator