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

Theorem supsn 4563
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 4562 . . . 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 2410 . . . 4 |- {B} = {B, B}
5 supeq1 4549 . . . 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 1511 . 2 |- (B e. A -> sup({B}, A, R) = if(BRB, B, B))
8 ifid 2366 . 2 |- if(BRB, B, B) = B
97, 8syl6eq 1515 1 |- (B e. A -> sup({B}, A, R) = B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 953   e. wcel 955  ifcif 2351  {csn 2399  {cpr 2400   class class class wbr 2609   Or wor 2830  supcsup 4547
This theorem is referenced by:  supxrmnf 6034  sqr0 6602  nmo0 8383  nmop0 9826  nmfn0 9827
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-reu 1643  df-rab 1644  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-if 2352  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406  df-uni 2494  df-br 2610  df-po 2831  df-so 2841  df-sup 4548
Copyright terms: Public domain