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 40349
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 2760 . . 3 (le‘𝐾) = (le‘𝐾)
5 eqid 2760 . . 3 (oc‘𝐾) = (oc‘𝐾)
6 eqid 2760 . . 3 (join‘𝐾) = (join‘𝐾)
7 eqid 2760 . . 3 (meet‘𝐾) = (meet‘𝐾)
8 eqid 2760 . . 3 (0.‘𝐾) = (0.‘𝐾)
9 eqid 2760 . . 3 (1.‘𝐾) = (1.‘𝐾)
101, 2, 3, 4, 5, 6, 7, 8, 9isopos 40346 . 2 (𝐾 ∈ OP ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))))
11 simpl 488 . . 3 (((𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))) → (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺))
12113adantl1 1185 . 2 (((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((((oc‘𝐾)‘𝑥) ∈ 𝐵 ∧ ((oc‘𝐾)‘((oc‘𝐾)‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝐾)𝑦 → ((oc‘𝐾)‘𝑦)(le‘𝐾)((oc‘𝐾)‘𝑥))) ∧ (𝑥(join‘𝐾)((oc‘𝐾)‘𝑥)) = (1.‘𝐾) ∧ (𝑥(meet‘𝐾)((oc‘𝐾)‘𝑥)) = (0.‘𝐾))) → (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺))
1310, 12sylbi 220 1 (𝐾 ∈ OP → (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   class class class wbr 5102  dom cdm 5651  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  lecple 17444  occoc 17445  Posetcpo 18490  lubclub 18492  glbcglb 18493  joincjn 18494  meetcmee 18495  0.cp0 18604  1.cp1 18605  OPcops 40338
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  ax-nul 5259
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-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-dm 5661  df-iota 6497  df-fv 6551  df-ov 7427  df-oposet 40342
This theorem is used by:  op0cl  40350  op1cl  40351  op0le  40352  ople1  40357  lhp2lt  41167
  Copyright terms: Public domain W3C validator