Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > supsn | Structured version Visualization version GIF version |
Description: The supremum of a singleton. (Contributed by NM, 2-Oct-2007.) |
Ref | Expression |
---|---|
supsn | ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → sup({𝐵}, 𝐴, 𝑅) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfsn2 4540 | . . . 4 ⊢ {𝐵} = {𝐵, 𝐵} | |
2 | 1 | supeq1i 9041 | . . 3 ⊢ sup({𝐵}, 𝐴, 𝑅) = sup({𝐵, 𝐵}, 𝐴, 𝑅) |
3 | suppr 9065 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → sup({𝐵, 𝐵}, 𝐴, 𝑅) = if(𝐵𝑅𝐵, 𝐵, 𝐵)) | |
4 | 3 | 3anidm23 1423 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → sup({𝐵, 𝐵}, 𝐴, 𝑅) = if(𝐵𝑅𝐵, 𝐵, 𝐵)) |
5 | 2, 4 | syl5eq 2783 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → sup({𝐵}, 𝐴, 𝑅) = if(𝐵𝑅𝐵, 𝐵, 𝐵)) |
6 | ifid 4465 | . 2 ⊢ if(𝐵𝑅𝐵, 𝐵, 𝐵) = 𝐵 | |
7 | 5, 6 | eqtrdi 2787 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → sup({𝐵}, 𝐴, 𝑅) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2112 ifcif 4425 {csn 4527 {cpr 4529 class class class wbr 5039 Or wor 5452 supcsup 9034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-reu 3058 df-rmo 3059 df-rab 3060 df-v 3400 df-sbc 3684 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-po 5453 df-so 5454 df-iota 6316 df-riota 7148 df-sup 9036 |
This theorem is referenced by: supxrmnf 12872 ramz 16541 xpsdsval 23233 ovolctb 24341 nmoo0 28826 nmop0 30021 nmfn0 30022 esumnul 31682 esum0 31683 ovoliunnfl 35505 voliunnfl 35507 volsupnfl 35508 liminf10ex 42933 fourierdlem79 43344 sge0z 43531 sge00 43532 |
Copyright terms: Public domain | W3C validator |