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

Theorem suplocexprlem2b 7897
Description: Lemma for suplocexpr 7908. Expression for the lower cut of the putative supremum. (Contributed by Jim Kingdon, 9-Jan-2024.)
Hypothesis
Ref Expression
suplocexprlem2b.b  |-  B  = 
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u } >.
Assertion
Ref Expression
suplocexprlem2b  |-  ( A 
C_  P.  ->  ( 2nd `  B )  =  {
u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w 
<Q  u } )

Proof of Theorem suplocexprlem2b
StepHypRef Expression
1 suplocexprlem2b.b . . 3  |-  B  = 
<. U. ( 1st " A
) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u } >.
21fveq2i 5629 . 2  |-  ( 2nd `  B )  =  ( 2nd `  <. U. ( 1st " A ) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w  <Q  u } >. )
3 fo1st 6301 . . . . . 6  |-  1st : _V -onto-> _V
4 fofun 5548 . . . . . 6  |-  ( 1st
: _V -onto-> _V  ->  Fun 
1st )
53, 4ax-mp 5 . . . . 5  |-  Fun  1st
6 npex 7656 . . . . . 6  |-  P.  e.  _V
76ssex 4220 . . . . 5  |-  ( A 
C_  P.  ->  A  e. 
_V )
8 funimaexg 5404 . . . . 5  |-  ( ( Fun  1st  /\  A  e. 
_V )  ->  ( 1st " A )  e. 
_V )
95, 7, 8sylancr 414 . . . 4  |-  ( A 
C_  P.  ->  ( 1st " A )  e.  _V )
10 uniexg 4529 . . . 4  |-  ( ( 1st " A )  e.  _V  ->  U. ( 1st " A )  e. 
_V )
119, 10syl 14 . . 3  |-  ( A 
C_  P.  ->  U. ( 1st " A )  e. 
_V )
12 nqex 7546 . . . 4  |-  Q.  e.  _V
1312rabex 4227 . . 3  |-  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u }  e.  _V
14 op2ndg 6295 . . 3  |-  ( ( U. ( 1st " A
)  e.  _V  /\  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w 
<Q  u }  e.  _V )  ->  ( 2nd `  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u } >. )  =  {
u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w 
<Q  u } )
1511, 13, 14sylancl 413 . 2  |-  ( A 
C_  P.  ->  ( 2nd `  <. U. ( 1st " A
) ,  { u  e.  Q.  |  E. w  e.  |^| ( 2nd " A
) w  <Q  u } >. )  =  {
u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w 
<Q  u } )
162, 15eqtrid 2274 1  |-  ( A 
C_  P.  ->  ( 2nd `  B )  =  {
u  e.  Q.  |  E. w  e.  |^| ( 2nd " A ) w 
<Q  u } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   E.wrex 2509   {crab 2512   _Vcvv 2799    C_ wss 3197   <.cop 3669   U.cuni 3887   |^|cint 3922   class class class wbr 4082   "cima 4721   Fun wfun 5311   -onto->wfo 5315   ` cfv 5317   1stc1st 6282   2ndc2nd 6283   Q.cnq 7463    <Q cltq 7468   P.cnp 7474
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-iinf 4679
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-1st 6284  df-2nd 6285  df-qs 6684  df-ni 7487  df-nqqs 7531  df-inp 7649
This theorem is referenced by:  suplocexprlemmu  7901  suplocexprlemru  7902  suplocexprlemdisj  7903  suplocexprlemloc  7904  suplocexprlemex  7905  suplocexprlemub  7906
  Copyright terms: Public domain W3C validator