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

Theorem inf00 9475
Description: The infimum regarding an empty base set is always the empty set. (Contributed by AV, 4-Sep-2020.)
Assertion
Ref Expression
inf00 inf(𝐵, ∅, 𝑅) = ∅

Proof of Theorem inf00
StepHypRef Expression
1 df-inf 9410 . 2 inf(𝐵, ∅, 𝑅) = sup(𝐵, ∅, 𝑅)
2 sup00 9432 . 2 sup(𝐵, ∅, 𝑅) = ∅
31, 2eqtri 2788 1 inf(𝐵, ∅, 𝑅) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  c0 4286  ccnv 5662  supcsup 9407  infcinf 9408
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-ss 3923  df-nul 4287  df-uni 4875  df-sup 9409  df-inf 9410
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator