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

Theorem glb0N 39298
Description: The greatest lower bound of the empty set is the unity element. (Contributed by NM, 5-Dec-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
glb0.g 𝐺 = (glb‘𝐾)
glb0.u 1 = (1.‘𝐾)
Assertion
Ref Expression
glb0N (𝐾 ∈ OP → (𝐺‘∅) = 1 )

Proof of Theorem glb0N
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2731 . . 3 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2731 . . 3 (le‘𝐾) = (le‘𝐾)
3 glb0.g . . 3 𝐺 = (glb‘𝐾)
4 biid 261 . . 3 ((∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥)) ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥)))
5 id 22 . . 3 (𝐾 ∈ OP → 𝐾 ∈ OP)
6 0ss 4349 . . . 4 ∅ ⊆ (Base‘𝐾)
76a1i 11 . . 3 (𝐾 ∈ OP → ∅ ⊆ (Base‘𝐾))
81, 2, 3, 4, 5, 7glbval 18279 . 2 (𝐾 ∈ OP → (𝐺‘∅) = (𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥))))
9 glb0.u . . . 4 1 = (1.‘𝐾)
101, 9op1cl 39290 . . 3 (𝐾 ∈ OP → 1 ∈ (Base‘𝐾))
11 ral0 4462 . . . . . . 7 𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦
1211a1bi 362 . . . . . 6 (𝑧(le‘𝐾)𝑥 ↔ (∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥))
1312ralbii 3078 . . . . 5 (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥))
14 ral0 4462 . . . . . 6 𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦
1514biantrur 530 . . . . 5 (∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥) ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥)))
1613, 15bitri 275 . . . 4 (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥)))
1710adantr 480 . . . . . . 7 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → 1 ∈ (Base‘𝐾))
18 breq1 5096 . . . . . . . 8 (𝑧 = 1 → (𝑧(le‘𝐾)𝑥1 (le‘𝐾)𝑥))
1918rspcv 3568 . . . . . . 7 ( 1 ∈ (Base‘𝐾) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥1 (le‘𝐾)𝑥))
2017, 19syl 17 . . . . . 6 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥1 (le‘𝐾)𝑥))
211, 2, 9op1le 39297 . . . . . 6 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ( 1 (le‘𝐾)𝑥𝑥 = 1 ))
2220, 21sylibd 239 . . . . 5 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥𝑥 = 1 ))
231, 2, 9ople1 39296 . . . . . . . . . 10 ((𝐾 ∈ OP ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
2423adantlr 715 . . . . . . . . 9 (((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
2524ex 412 . . . . . . . 8 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → 𝑧(le‘𝐾) 1 ))
26 breq2 5097 . . . . . . . . 9 (𝑥 = 1 → (𝑧(le‘𝐾)𝑥𝑧(le‘𝐾) 1 ))
2726biimprcd 250 . . . . . . . 8 (𝑧(le‘𝐾) 1 → (𝑥 = 1𝑧(le‘𝐾)𝑥))
2825, 27syl6 35 . . . . . . 7 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → (𝑥 = 1𝑧(le‘𝐾)𝑥)))
2928com23 86 . . . . . 6 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 1 → (𝑧 ∈ (Base‘𝐾) → 𝑧(le‘𝐾)𝑥)))
3029ralrimdv 3130 . . . . 5 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 1 → ∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥))
3122, 30impbid 212 . . . 4 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥𝑥 = 1 ))
3216, 31bitr3id 285 . . 3 ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ((∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥)) ↔ 𝑥 = 1 ))
3310, 32riota5 7338 . 2 (𝐾 ∈ OP → (𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦𝑧(le‘𝐾)𝑥))) = 1 )
348, 33eqtrd 2766 1 (𝐾 ∈ OP → (𝐺‘∅) = 1 )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  wral 3047  wss 3897  c0 4282   class class class wbr 5093  cfv 6487  crio 7308  Basecbs 17126  lecple 17174  glbcglb 18222  1.cp1 18334  OPcops 39277
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7309  df-ov 7355  df-proset 18206  df-poset 18225  df-lub 18256  df-glb 18257  df-p1 18336  df-oposet 39281
This theorem is referenced by:  pmapglb2N  39876  pmapglb2xN  39877
  Copyright terms: Public domain W3C validator