| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > supex | Structured version Visualization version GIF version | ||
| Description: A supremum is a set. (Contributed by NM, 22-May-1999.) |
| Ref | Expression |
|---|---|
| supex.1 | ⊢ 𝑅 Or 𝐴 |
| Ref | Expression |
|---|---|
| supex | ⊢ sup(𝐵, 𝐴, 𝑅) ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supex.1 | . 2 ⊢ 𝑅 Or 𝐴 | |
| 2 | id 22 | . . 3 ⊢ (𝑅 Or 𝐴 → 𝑅 Or 𝐴) | |
| 3 | 2 | supexd 9392 | . 2 ⊢ (𝑅 Or 𝐴 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ sup(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2141 Vcvv 3453 Or wor 5550 supcsup 9379 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 ax-un 7712 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-mo 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rmo 3366 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-po 5551 df-so 5552 df-sup 9381 |
| This theorem is referenced by: limsupgval 15493 limsupgre 15498 gcdval 16520 pczpre 16873 prmreclem1 16942 prdsdsfn 17484 prdsdsval 17497 xrge0tsms2 24883 mbfsup 25713 mbfinf 25714 itg2val 25777 itg2monolem1 25799 itg2mono 25802 mdegval 26110 mdegxrf 26115 plyeq0lem 26257 dgrval 26275 nmooval 30922 nmopval 32015 nmfnval 32035 lmdvg 34210 esumval 34303 erdszelem3 35503 erdszelem6 35506 supcnvlimsup 46274 limsuplt2 46287 liminfval 46293 limsupge 46295 liminflelimsuplem 46309 fourierdlem79 46719 sge0val 46900 sge0tsms 46914 smflimsuplem1 47354 smflimsuplem2 47355 smflimsuplem4 47357 fsupdm2 47377 |
| Copyright terms: Public domain | W3C validator |