HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem supsn 4591
Description: The supremum of a singleton.
Hypothesis
Ref Expression
suppr.1 |- R Or A
Assertion
Ref Expression
supsn |- (B e. A -> sup({B}, A, R) = B)

Proof of Theorem supsn
StepHypRef Expression
1 suppr.1 . . . . 5 |- R Or A
21suppr 4590 . . . 4 |- ((B e. A /\ B e. A) -> sup({B, B}, A, R) = if(BRB, B, B))
32anidms 434 . . 3 |- (B e. A -> sup({B, B}, A, R) = if(BRB, B, B))
4 dfsn2 2420 . . . 4 |- {B} = {B, B}
5 supeq1 4575 . . . 4 |- ({B} = {B, B} -> sup({B}, A, R) = sup({B, B}, A, R))
64, 5ax-mp 7 . . 3 |- sup({B}, A, R) = sup({B, B}, A, R)
73, 6syl5eq 1519 . 2 |- (B e. A -> sup({B}, A, R) = if(BRB, B, B))
8 ifid 2376 . 2 |- if(BRB, B, B) = B
97, 8syl6eq 1523 1 |- (B e. A -> sup({B}, A, R) = B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 956   e. wcel 958  ifcif 2361  {csn 2409  {cpr 2410   class class class wbr 2619   Or wor 2839  supcsup 4573
This theorem is referenced by:  supxrmnf 6087  sqr0 6672  nmo0 8451  nmop0 9910  nmfn0 9911
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-reu 1651  df-rab 1652  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-if 2362  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-po 2840  df-so 2850  df-sup 4574
Copyright terms: Public domain