| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sup00 | Structured version Visualization version GIF version | ||
| Description: The supremum under an empty base set is always the empty set. (Contributed by AV, 4-Sep-2020.) |
| Ref | Expression |
|---|---|
| sup00 | ⊢ sup(𝐵, ∅, 𝑅) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-sup 9357 | . 2 ⊢ sup(𝐵, ∅, 𝑅) = ∪ {𝑥 ∈ ∅ ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ ∅ (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} | |
| 2 | rab0 4340 | . . 3 ⊢ {𝑥 ∈ ∅ ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ ∅ (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = ∅ | |
| 3 | 2 | unieqi 4877 | . 2 ⊢ ∪ {𝑥 ∈ ∅ ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ ∅ (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = ∪ ∅ |
| 4 | uni0 4893 | . 2 ⊢ ∪ ∅ = ∅ | |
| 5 | 1, 3, 4 | 3eqtri 2764 | 1 ⊢ sup(𝐵, ∅, 𝑅) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∀wral 3052 ∃wrex 3062 {crab 3401 ∅c0 4287 ∪ cuni 4865 class class class wbr 5100 supcsup 9355 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-ss 3920 df-nul 4288 df-uni 4866 df-sup 9357 |
| This theorem is referenced by: inf00 9423 |
| Copyright terms: Public domain | W3C validator |