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

Theorem inf00 9500
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 9435 . 2 inf(𝐵, ∅, 𝑅) = sup(𝐵, ∅, ◡𝑅)
2 sup00 9457 . 2 sup(𝐵, ∅, ◡𝑅) = ∅
31, 2eqtri 2784 1 inf(𝐵, ∅, 𝑅) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  ∅c0 4279  ◡ccnv 5650  supcsup 9432  infcinf 9433
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 2147  ax-9 2155  ax-12 2213  ax-ext 2733
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-ss 3916  df-nul 4280  df-uni 4868  df-sup 9434  df-inf 9435
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator