| 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 23 | . . 3 ⊢ (𝑅 Or 𝐴 → 𝑅 Or 𝐴) | |
| 3 | 2 | supexd 9423 | . 2 ⊢ (𝑅 Or 𝐴 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ sup(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 Vcvv 3450 Or wor 5562 supcsup 9410 |
| 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-ext 2732 ax-sep 5251 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rmo 3365 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-po 5563 df-so 5564 df-sup 9412 |
| This theorem is used by: limsupgval 15563 limsupgre 15568 gcdval 16586 pczpre 16939 prmreclem1 17008 prdsdsfn 17550 prdsdsval 17563 xrge0tsms2 25062 mbfsup 25892 mbfinf 25893 itg2val 25956 itg2monolem1 25978 itg2mono 25981 mdegval 26288 mdegxrf 26293 plyeq0lem 26436 dgrval 26454 nmooval 31244 nmopval 32337 nmfnval 32357 lmdvg 34463 esumval 34556 erdszelem3 35772 erdszelem6 35775 supcnvlimsup 46568 limsuplt2 46581 liminfval 46587 limsupge 46589 liminflelimsuplem 46603 fourierdlem79 47013 sge0val 47194 sge0tsms 47208 smflimsuplem1 47648 smflimsuplem2 47649 smflimsuplem4 47651 fsupdm2 47671 |
| Copyright terms: Public domain | W3C validator |