ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  supmaxti Unicode version

Theorem supmaxti 6417
Description: The greatest element of a set is its supremum. Note that the converse is not true; the supremum might not be an element of the set considered. (Contributed by Jim Kingdon, 24-Nov-2021.)
Hypotheses
Ref Expression
supmaxti.ti  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
supmaxti.2  |-  ( ph  ->  C  e.  A )
supmaxti.3  |-  ( ph  ->  C  e.  B )
supmaxti.4  |-  ( (
ph  /\  y  e.  B )  ->  -.  C R y )
Assertion
Ref Expression
supmaxti  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Distinct variable groups:    u, A, v, y    u, B, v, y    u, C, v, y    u, R, v, y    ph, u, v, y

Proof of Theorem supmaxti
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 supmaxti.ti . 2  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
2 supmaxti.2 . 2  |-  ( ph  ->  C  e.  A )
3 supmaxti.4 . 2  |-  ( (
ph  /\  y  e.  B )  ->  -.  C R y )
4 supmaxti.3 . . 3  |-  ( ph  ->  C  e.  B )
5 simprr 498 . . 3  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  -> 
y R C )
6 breq2 3789 . . . 4  |-  ( x  =  C  ->  (
y R x  <->  y R C ) )
76rspcev 2701 . . 3  |-  ( ( C  e.  B  /\  y R C )  ->  E. x  e.  B  y R x )
84, 5, 7syl2an2r 559 . 2  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  ->  E. x  e.  B  y R x )
91, 2, 3, 8eqsuptid 6410 1  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    e. wcel 1433   E.wrex 2349   class class class wbr 3785   supcsup 6395
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-reu 2355  df-rmo 2356  df-rab 2357  df-v 2603  df-sbc 2816  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-iota 4887  df-riota 5488  df-sup 6397
This theorem is referenced by:  supsnti  6418  maxleim  10091
  Copyright terms: Public domain W3C validator