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

Theorem eqsuptid 7290
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 2617 . 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 2617 . 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 7289 . 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 1377 1  |-  ( ph  ->  sup ( B ,  A ,  R )  =  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   class class class wbr 4111   supcsup 7275
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-un 3217  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-iota 5314  df-riota 6005  df-sup 7277
This theorem is referenced by:  supmaxti  7297  supisoti  7303  xrmaxaddlem  11949  dfgcd2  12714
  Copyright terms: Public domain W3C validator