| 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 9359 | . 2 ⊢ (𝑅 Or 𝐴 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ sup(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 Vcvv 3430 Or wor 5531 supcsup 9346 |
| 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-ext 2709 ax-sep 5231 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rmo 3343 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-po 5532 df-so 5533 df-sup 9348 |
| This theorem is referenced by: limsupgval 15429 limsupgre 15434 gcdval 16456 pczpre 16809 prmreclem1 16878 prdsdsfn 17419 prdsdsval 17432 xrge0tsms2 24811 mbfsup 25641 mbfinf 25642 itg2val 25705 itg2monolem1 25727 itg2mono 25730 mdegval 26038 mdegxrf 26043 plyeq0lem 26185 dgrval 26203 nmooval 30849 nmopval 31942 nmfnval 31962 lmdvg 34113 esumval 34206 erdszelem3 35391 erdszelem6 35394 supcnvlimsup 46186 limsuplt2 46199 liminfval 46205 limsupge 46207 liminflelimsuplem 46221 fourierdlem79 46631 sge0val 46812 sge0tsms 46826 smflimsuplem1 47266 smflimsuplem2 47267 smflimsuplem4 47269 fsupdm2 47289 |
| Copyright terms: Public domain | W3C validator |