| 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 9469 | . 2 ⊢ inf(𝐵, ∅, 𝑅) = sup(𝐵, ∅, ◡𝑅) | |
| 2 | sup00 9491 | . 2 ⊢ sup(𝐵, ∅, ◡𝑅) = ∅ | |
| 3 | 1, 2 | eqtri 2787 | 1 ⊢ inf(𝐵, ∅, 𝑅) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∅c0 4278 ◡ccnv 5654 supcsup 9466 infcinf 9467 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2150 ax-9 2158 ax-12 2217 ax-ext 2736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2743 df-cleq 2756 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3414 df-v 3453 df-ss 3898 df-dif 4047 df-nul 4279 df-uni 4870 df-sup 9468 df-inf 9469 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |