| 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 9343 | . 2 ⊢ (𝑅 Or 𝐴 → sup(𝐵, 𝐴, 𝑅) ∈ V) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ sup(𝐵, 𝐴, 𝑅) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2109 Vcvv 3436 Or wor 5526 supcsup 9330 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rmo 3343 df-rab 3395 df-v 3438 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-po 5527 df-so 5528 df-sup 9332 |
| This theorem is referenced by: limsupgval 15383 limsupgre 15388 gcdval 16407 pczpre 16759 prmreclem1 16828 prdsdsfn 17369 prdsdsval 17382 xrge0tsms2 24722 mbfsup 25563 mbfinf 25564 itg2val 25627 itg2monolem1 25649 itg2mono 25652 mdegval 25966 mdegxrf 25971 plyeq0lem 26113 dgrval 26131 nmooval 30707 nmopval 31800 nmfnval 31820 lmdvg 33920 esumval 34013 erdszelem3 35166 erdszelem6 35169 supcnvlimsup 45721 limsuplt2 45734 liminfval 45740 limsupge 45742 liminflelimsuplem 45756 fourierdlem79 46166 sge0val 46347 sge0tsms 46361 smflimsuplem1 46801 smflimsuplem2 46802 smflimsuplem4 46804 fsupdm2 46824 |
| Copyright terms: Public domain | W3C validator |