| 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 9449 | . 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 2144 Vcvv 3450 Or wor 5557 supcsup 9436 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 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-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-po 5558 df-so 5559 df-sup 9438 |
| This theorem is used by: limsupgval 15649 limsupgre 15654 gcdval 16672 pczpre 17031 prmreclem1 17100 prdsdsfn 17642 prdsdsval 17655 xrge0tsms2 25161 mbfsup 25991 mbfinf 25992 itg2val 26055 itg2monolem1 26077 itg2mono 26080 mdegval 26387 mdegxrf 26392 plyeq0lem 26535 dgrval 26553 nmooval 31371 nmopval 32464 nmfnval 32484 lmdvg 34632 esumval 34725 erdszelem3 36045 erdszelem6 36048 supcnvlimsup 46844 limsuplt2 46857 liminfval 46863 limsupge 46865 liminflelimsuplem 46879 fourierdlem79 47289 sge0val 47470 sge0tsms 47484 smflimsuplem1 47924 smflimsuplem2 47925 smflimsuplem4 47927 fsupdm2 47947 |
| Copyright terms: Public domain | W3C validator |