| 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 9438 | . 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 3451 Or wor 5558 supcsup 9425 |
| 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 2733 ax-sep 5249 ax-pr 5391 ax-un 7749 |
| 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 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rmo 3366 df-rab 3414 df-v 3453 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 5559 df-so 5560 df-sup 9427 |
| This theorem is used by: limsupgval 15636 limsupgre 15641 gcdval 16659 pczpre 17018 prmreclem1 17087 prdsdsfn 17629 prdsdsval 17642 xrge0tsms2 25148 mbfsup 25978 mbfinf 25979 itg2val 26042 itg2monolem1 26064 itg2mono 26067 mdegval 26374 mdegxrf 26379 plyeq0lem 26522 dgrval 26540 nmooval 31358 nmopval 32451 nmfnval 32471 lmdvg 34578 esumval 34671 erdszelem3 35937 erdszelem6 35940 supcnvlimsup 46719 limsuplt2 46732 liminfval 46738 limsupge 46740 liminflelimsuplem 46754 fourierdlem79 47164 sge0val 47345 sge0tsms 47359 smflimsuplem1 47799 smflimsuplem2 47800 smflimsuplem4 47802 fsupdm2 47822 |
| Copyright terms: Public domain | W3C validator |