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

Theorem infnlbti 6439
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 6438 . . . . 5  |-  ( ph  ->  ( ( C  e.  A  /\ inf ( B ,  A ,  R ) R C )  ->  E. z  e.  B  z R C ) )
43expdimp 255 . . . 4  |-  ( (
ph  /\  C  e.  A )  ->  (inf ( B ,  A ,  R ) R C  ->  E. z  e.  B  z R C ) )
5 rexalim 2361 . . . 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 586 . 2  |-  ( (
ph  /\  C  e.  A )  ->  ( A. z  e.  B  -.  z R C  ->  -. inf ( B ,  A ,  R ) R C ) )
87expimpd 355 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 102    <-> wb 103    e. wcel 1433   A.wral 2348   E.wrex 2349   class class class wbr 3785  infcinf 6396
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-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
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-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-cnv 4371  df-iota 4887  df-riota 5488  df-sup 6397  df-inf 6398
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator