| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inf00 | Structured version Visualization version GIF version | ||
| Description: The infimum regarding an empty base set is always the empty set. (Contributed by AV, 4-Sep-2020.) |
| Ref | Expression |
|---|---|
| inf00 | ⊢ inf(𝐵, ∅, 𝑅) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-inf 9416 | . 2 ⊢ inf(𝐵, ∅, 𝑅) = sup(𝐵, ∅, ◡𝑅) | |
| 2 | sup00 9438 | . 2 ⊢ sup(𝐵, ∅, ◡𝑅) = ∅ | |
| 3 | 1, 2 | eqtri 2783 | 1 ⊢ inf(𝐵, ∅, 𝑅) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∅c0 4279 ◡ccnv 5654 supcsup 9413 infcinf 9414 |
| 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 2732 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-ss 3916 df-nul 4280 df-uni 4868 df-sup 9415 df-inf 9416 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |