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

Theorem infisoti 7291
Description: Image of an infimum under an isomorphism. (Contributed by Jim Kingdon, 19-Dec-2021.)
Hypotheses
Ref Expression
infisoti.1  |-  ( ph  ->  F  Isom  R ,  S  ( A ,  B ) )
infisoti.2  |-  ( ph  ->  C  C_  A )
infisoti.3  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  C  -.  y R x  /\  A. y  e.  A  ( x R y  ->  E. z  e.  C  z R y ) ) )
infisoti.ti  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
Assertion
Ref Expression
infisoti  |-  ( ph  -> inf ( ( F " C ) ,  B ,  S )  =  ( F ` inf ( C ,  A ,  R ) ) )
Distinct variable groups:    u, A, v, x, y, z    u, B, v, x, y, z   
u, C, v, x, y, z    u, F, v, x, y, z   
u, R, v, x, y, z    u, S, v, x, y, z    ph, u, v, x, y, z

Proof of Theorem infisoti
StepHypRef Expression
1 infisoti.1 . . . 4  |-  ( ph  ->  F  Isom  R ,  S  ( A ,  B ) )
2 isocnv2 5963 . . . 4  |-  ( F 
Isom  R ,  S  ( A ,  B )  <-> 
F  Isom  `' R ,  `' S ( A ,  B ) )
31, 2sylib 122 . . 3  |-  ( ph  ->  F  Isom  `' R ,  `' S ( A ,  B ) )
4 infisoti.2 . . 3  |-  ( ph  ->  C  C_  A )
5 infisoti.3 . . . 4  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  C  -.  y R x  /\  A. y  e.  A  ( x R y  ->  E. z  e.  C  z R y ) ) )
65cnvinfex 7277 . . 3  |-  ( ph  ->  E. x  e.  A  ( A. y  e.  C  -.  x `' R y  /\  A. y  e.  A  ( y `' R x  ->  E. z  e.  C  y `' R z ) ) )
7 infisoti.ti . . . 4  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u R v  /\  -.  v R u ) ) )
87cnvti 7278 . . 3  |-  ( (
ph  /\  ( u  e.  A  /\  v  e.  A ) )  -> 
( u  =  v  <-> 
( -.  u `' R v  /\  -.  v `' R u ) ) )
93, 4, 6, 8supisoti 7269 . 2  |-  ( ph  ->  sup ( ( F
" C ) ,  B ,  `' S
)  =  ( F `
 sup ( C ,  A ,  `' R ) ) )
10 df-inf 7244 . 2  |- inf ( ( F " C ) ,  B ,  S
)  =  sup (
( F " C
) ,  B ,  `' S )
11 df-inf 7244 . . 3  |- inf ( C ,  A ,  R
)  =  sup ( C ,  A ,  `' R )
1211fveq2i 5651 . 2  |-  ( F `
inf ( C ,  A ,  R )
)  =  ( F `
 sup ( C ,  A ,  `' R ) )
139, 10, 123eqtr4g 2289 1  |-  ( ph  -> inf ( ( F " C ) ,  B ,  S )  =  ( F ` inf ( C ,  A ,  R ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   A.wral 2511   E.wrex 2512    C_ wss 3201   class class class wbr 4093   `'ccnv 4730   "cima 4734   ` cfv 5333    Isom wiso 5334   supcsup 7241  infcinf 7242
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-isom 5342  df-riota 5981  df-sup 7243  df-inf 7244
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator