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

Theorem eqsuptid 7014
Description: Sufficient condition for an element to be equal to the supremum. (Contributed by Jim Kingdon, 24-Nov-2021.)
Hypotheses
Ref Expression
supmoti.ti  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
eqsuptid.2  |-  ( ph  ->  C  e.  A )
eqsuptid.3  |-  ( (
ph  /\  y  e.  B )  ->  -.  C R y )
eqsuptid.4  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  ->  E. z  e.  B  y R z )
Assertion
Ref Expression
eqsuptid  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Distinct variable groups:    u, A, v, y, z    y, B, z    u, R, v, y, z    ph, u, v, y    y, C, u, v    u, B, v, z    ph, y
Allowed substitution hints:    ph( z)    C( z)

Proof of Theorem eqsuptid
StepHypRef Expression
1 eqsuptid.2 . 2  |-  ( ph  ->  C  e.  A )
2 eqsuptid.3 . . 3  |-  ( (
ph  /\  y  e.  B )  ->  -.  C R y )
32ralrimiva 2563 . 2  |-  ( ph  ->  A. y  e.  B  -.  C R y )
4 eqsuptid.4 . . . 4  |-  ( (
ph  /\  ( y  e.  A  /\  y R C ) )  ->  E. z  e.  B  y R z )
54expr 375 . . 3  |-  ( (
ph  /\  y  e.  A )  ->  (
y R C  ->  E. z  e.  B  y R z ) )
65ralrimiva 2563 . 2  |-  ( ph  ->  A. y  e.  A  ( y R C  ->  E. z  e.  B  y R z ) )
7 supmoti.ti . . 3  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
87eqsupti 7013 . 2  |-  ( ph  ->  ( ( C  e.  A  /\  A. y  e.  B  -.  C R y  /\  A. y  e.  A  (
y R C  ->  E. z  e.  B  y R z ) )  ->  sup ( B ,  A ,  R )  =  C ) )
91, 3, 6, 8mp3and 1351 1  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2160   A.wral 2468   E.wrex 2469   class class class wbr 4018   supcsup 6999
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-un 3148  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-iota 5193  df-riota 5847  df-sup 7001
This theorem is referenced by:  supmaxti  7021  supisoti  7027  xrmaxaddlem  11286  dfgcd2  12033
  Copyright terms: Public domain W3C validator