MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  suppr Structured version   Unicode version

Theorem suppr 7465
Description: The supremum of a pair. (Contributed by NM, 17-Jun-2007.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
Assertion
Ref Expression
suppr  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  sup ( { B ,  C } ,  A ,  R )  =  if ( C R B ,  B ,  C
) )

Proof of Theorem suppr
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 simp1 957 . 2  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  R  Or  A )
2 ifcl 3767 . . 3  |-  ( ( B  e.  A  /\  C  e.  A )  ->  if ( C R B ,  B ,  C )  e.  A
)
323adant1 975 . 2  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  if ( C R B ,  B ,  C )  e.  A
)
4 ifpr 3848 . . 3  |-  ( ( B  e.  A  /\  C  e.  A )  ->  if ( C R B ,  B ,  C )  e.  { B ,  C }
)
543adant1 975 . 2  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  if ( C R B ,  B ,  C )  e.  { B ,  C }
)
6 breq1 4207 . . . . . 6  |-  ( B  =  if ( C R B ,  B ,  C )  ->  ( B R B  <->  if ( C R B ,  B ,  C ) R B ) )
76notbid 286 . . . . 5  |-  ( B  =  if ( C R B ,  B ,  C )  ->  ( -.  B R B  <->  -.  if ( C R B ,  B ,  C ) R B ) )
8 breq1 4207 . . . . . 6  |-  ( C  =  if ( C R B ,  B ,  C )  ->  ( C R B  <->  if ( C R B ,  B ,  C ) R B ) )
98notbid 286 . . . . 5  |-  ( C  =  if ( C R B ,  B ,  C )  ->  ( -.  C R B  <->  -.  if ( C R B ,  B ,  C ) R B ) )
10 sonr 4516 . . . . . . 7  |-  ( ( R  Or  A  /\  B  e.  A )  ->  -.  B R B )
11103adant3 977 . . . . . 6  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  -.  B R B )
1211adantr 452 . . . . 5  |-  ( ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A
)  /\  C R B )  ->  -.  B R B )
13 simpr 448 . . . . 5  |-  ( ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A
)  /\  -.  C R B )  ->  -.  C R B )
147, 9, 12, 13ifbothda 3761 . . . 4  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  -.  if ( C R B ,  B ,  C ) R B )
15 breq1 4207 . . . . . 6  |-  ( B  =  if ( C R B ,  B ,  C )  ->  ( B R C  <->  if ( C R B ,  B ,  C ) R C ) )
1615notbid 286 . . . . 5  |-  ( B  =  if ( C R B ,  B ,  C )  ->  ( -.  B R C  <->  -.  if ( C R B ,  B ,  C ) R C ) )
17 breq1 4207 . . . . . 6  |-  ( C  =  if ( C R B ,  B ,  C )  ->  ( C R C  <->  if ( C R B ,  B ,  C ) R C ) )
1817notbid 286 . . . . 5  |-  ( C  =  if ( C R B ,  B ,  C )  ->  ( -.  C R C  <->  -.  if ( C R B ,  B ,  C ) R C ) )
19 so2nr 4519 . . . . . . . . 9  |-  ( ( R  Or  A  /\  ( C  e.  A  /\  B  e.  A
) )  ->  -.  ( C R B  /\  B R C ) )
20193impb 1149 . . . . . . . 8  |-  ( ( R  Or  A  /\  C  e.  A  /\  B  e.  A )  ->  -.  ( C R B  /\  B R C ) )
21203com23 1159 . . . . . . 7  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  -.  ( C R B  /\  B R C ) )
22 imnan 412 . . . . . . 7  |-  ( ( C R B  ->  -.  B R C )  <->  -.  ( C R B  /\  B R C ) )
2321, 22sylibr 204 . . . . . 6  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  ( C R B  ->  -.  B R C ) )
2423imp 419 . . . . 5  |-  ( ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A
)  /\  C R B )  ->  -.  B R C )
25 sonr 4516 . . . . . . 7  |-  ( ( R  Or  A  /\  C  e.  A )  ->  -.  C R C )
26253adant2 976 . . . . . 6  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  -.  C R C )
2726adantr 452 . . . . 5  |-  ( ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A
)  /\  -.  C R B )  ->  -.  C R C )
2816, 18, 24, 27ifbothda 3761 . . . 4  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  -.  if ( C R B ,  B ,  C ) R C )
29 breq2 4208 . . . . . . 7  |-  ( y  =  B  ->  ( if ( C R B ,  B ,  C
) R y  <->  if ( C R B ,  B ,  C ) R B ) )
3029notbid 286 . . . . . 6  |-  ( y  =  B  ->  ( -.  if ( C R B ,  B ,  C ) R y  <->  -.  if ( C R B ,  B ,  C ) R B ) )
31 breq2 4208 . . . . . . 7  |-  ( y  =  C  ->  ( if ( C R B ,  B ,  C
) R y  <->  if ( C R B ,  B ,  C ) R C ) )
3231notbid 286 . . . . . 6  |-  ( y  =  C  ->  ( -.  if ( C R B ,  B ,  C ) R y  <->  -.  if ( C R B ,  B ,  C ) R C ) )
3330, 32ralprg 3849 . . . . 5  |-  ( ( B  e.  A  /\  C  e.  A )  ->  ( A. y  e. 
{ B ,  C }  -.  if ( C R B ,  B ,  C ) R y  <-> 
( -.  if ( C R B ,  B ,  C ) R B  /\  -.  if ( C R B ,  B ,  C ) R C ) ) )
34333adant1 975 . . . 4  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  ( A. y  e. 
{ B ,  C }  -.  if ( C R B ,  B ,  C ) R y  <-> 
( -.  if ( C R B ,  B ,  C ) R B  /\  -.  if ( C R B ,  B ,  C ) R C ) ) )
3514, 28, 34mpbir2and 889 . . 3  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  A. y  e.  { B ,  C }  -.  if ( C R B ,  B ,  C ) R y )
3635r19.21bi 2796 . 2  |-  ( ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A
)  /\  y  e.  { B ,  C }
)  ->  -.  if ( C R B ,  B ,  C ) R y )
371, 3, 5, 36supmax 7462 1  |-  ( ( R  Or  A  /\  B  e.  A  /\  C  e.  A )  ->  sup ( { B ,  C } ,  A ,  R )  =  if ( C R B ,  B ,  C
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    /\ w3a 936    = wceq 1652    e. wcel 1725   A.wral 2697   ifcif 3731   {cpr 3807   class class class wbr 4204    Or wor 4494   supcsup 7437
This theorem is referenced by:  supsn  7466  tmsxpsval2  18561  esumsn  24448
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ral 2702  df-rex 2703  df-reu 2704  df-rmo 2705  df-rab 2706  df-v 2950  df-sbc 3154  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-po 4495  df-so 4496  df-iota 5410  df-riota 6541  df-sup 7438
  Copyright terms: Public domain W3C validator