Theorem supeq1i 6953

Description: Equality inference for supremum. (Contributed by Paul Chapman, 22-Jun-2011.)

Hypothesis

Ref	Expression
supeq1i.1	|- B = C

Assertion

Ref	Expression
supeq1i	|- sup ( B , A , R ) = sup ( C , A , R )

Proof of Theorem supeq1i

Step	Hyp	Ref	Expression
1		supeq1i.1	. 2 |- B = C
2		supeq1 6951	. 2 |- ( B = C -> sup ( B , A , R ) = sup ( C , A , R ) )
3	1, 2	ax-mp 5	1 |- sup ( B , A , R ) = sup ( C , A , R )

Syntax hints:   = wceq 1343   supcsup 6947

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-uni 3790  df-sup 6949

This theorem is referenced by:  infrenegsupex  9532  maxcom  11145  xrmax2sup  11195  xrmaxltsup  11199  xrmaxadd  11202  infxrnegsupex  11204  gcdcom  11906  gcdass  11948