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

Theorem supmaxti 7171
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 531 . . 3  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  -> 
y R C )
6 breq2 4087 . . . 4  |-  ( x  =  C  ->  (
y R x  <->  y R C ) )
76rspcev 2907 . . 3  |-  ( ( C  e.  B  /\  y R C )  ->  E. x  e.  B  y R x )
84, 5, 7syl2an2r 597 . 2  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  ->  E. x  e.  B  y R x )
91, 2, 3, 8eqsuptid 7164 1  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   E.wrex 2509   class class class wbr 4083   supcsup 7149
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-iota 5278  df-riota 5954  df-sup 7151
This theorem is referenced by:  supsnti  7172  sup3exmid  9104  maxleim  11716  xrmaxleim  11755  supfz  16439
  Copyright terms: Public domain W3C validator