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

Theorem infclti 7089
Description: An infimum belongs to its base class (closure law). See also inflbti 7090 and infglbti 7091. (Contributed by Jim Kingdon, 17-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
infclti  |-  ( ph  -> inf ( B ,  A ,  R )  e.  A
)
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

Proof of Theorem infclti
StepHypRef Expression
1 df-inf 7051 . 2  |- inf ( B ,  A ,  R
)  =  sup ( B ,  A ,  `' R )
2 infclti.ti . . . 4  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
32cnvti 7085 . . 3  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u `' R v  /\  -.  v `' R u ) ) )
4 infclti.ex . . . 4  |-  ( 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 ) ) )
54cnvinfex 7084 . . 3  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  B  -.  x `' R y  /\  A. y  e.  A  ( y `' R x  ->  E. z  e.  B  y `' R z ) ) )
63, 5supclti 7064 . 2  |-  ( ph  ->  sup ( B ,  A ,  `' R
)  e.  A )
71, 6eqeltrid 2283 1  |-  ( ph  -> inf ( B ,  A ,  R )  e.  A
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2167   A.wral 2475   E.wrex 2476   class class class wbr 4033   `'ccnv 4662   supcsup 7048  infcinf 7049
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-cnv 4671  df-iota 5219  df-riota 5877  df-sup 7050  df-inf 7051
This theorem is referenced by:  infrenegsupex  9668  supminfex  9671  infregelbex  9672  infssuzledc  10324  infxrnegsupex  11428
  Copyright terms: Public domain W3C validator