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

Theorem infnlbti 7317
Description: A lower bound is not greater than the infimum. (Contributed by Jim Kingdon, 18-Dec-2021.)
Hypotheses
Ref Expression
infclti.ti  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
infclti.ex  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  y R x  /\  A. y  e.  A  ( x R y  ->  E. z  e.  B  z R y ) ) )
Assertion
Ref Expression
infnlbti  |-  ( ph  ->  ( ( C  e.  A  /\  A. z  e.  B  -.  z R C )  ->  -. inf ( B ,  A ,  R ) R C ) )
Distinct variable groups:    u, A, v, x, y, z    u, B, v, x, y, z   
u, R, v, x, y, z    ph, u, v, x, y, z    z, C
Allowed substitution hints:    C( x, y, v, u)

Proof of Theorem infnlbti
StepHypRef Expression
1 infclti.ti . . . . . 6  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
2 infclti.ex . . . . . 6  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  y R x  /\  A. y  e.  A  ( x R y  ->  E. z  e.  B  z R y ) ) )
31, 2infglbti 7316 . . . . 5  |-  ( ph  ->  ( ( C  e.  A  /\ inf ( B ,  A ,  R ) R C )  ->  E. z  e.  B  z R C ) )
43expdimp 259 . . . 4  |-  ( (
ph  /\  C  e.  A )  ->  (inf ( B ,  A ,  R ) R C  ->  E. z  e.  B  z R C ) )
5 rexalim 2535 . . . 4  |-  ( E. z  e.  B  z R C  ->  -.  A. z  e.  B  -.  z R C )
64, 5syl6 33 . . 3  |-  ( (
ph  /\  C  e.  A )  ->  (inf ( B ,  A ,  R ) R C  ->  -.  A. z  e.  B  -.  z R C ) )
76con2d 629 . 2  |-  ( (
ph  /\  C  e.  A )  ->  ( A. z  e.  B  -.  z R C  ->  -. inf ( B ,  A ,  R ) R C ) )
87expimpd 363 1  |-  ( ph  ->  ( ( C  e.  A  /\  A. z  e.  B  -.  z R C )  ->  -. inf ( B ,  A ,  R ) R C ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2203   A.wral 2520   E.wrex 2521   class class class wbr 4109  infcinf 7274
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-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-cnv 4757  df-iota 5312  df-riota 6003  df-sup 7275  df-inf 7276
This theorem is referenced by:  infregelbex  9930
  Copyright terms: Public domain W3C validator